Skip to main content
Log in

Computing Hough transforms on hypercube multicomputers

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Efficient algorithms to compute the Hough transform on MIMD and SIMD hypercube multicomputer are developed. Our algorithms can compute p angles of the Hough transform of an N × N image, pN, in 0(p + log N) time on both MIMD and SIMD hypercubes. These algorithms require 0(N 2) processors. We also consider the computation of the Hough transform on MIMD hypercubes with a fixed number of processors. Experimental results on an NCUBE/7 hypercube are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ballard, D.H. 1981. Generalizing the Hough transform to detect arbitrary shapes. Pattern Recognition, 12, 2: 111–122.

    Google Scholar 

  • Ballard, D.H., and Brown, C.M. 1982. Computer Vision. Prentice Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Chan, T.F., and Saad, Y. 1986. Multigrid algorithms on the hypercube multiprocessor. IEEE Trans. Comps., C-35 (Nov.), 969–977.

    Google Scholar 

  • Chandran, S., and Davis, L. 1987. The Hough transform on the Butterfly and the NCUBE. Univ. of Md. tech. rept., College Park, Md.

  • Cypher, R.E., Sanz, J.L.C., and Snyder, L. 1987. The Hough transform has O(N) complexity on SIMD N × N mesh array architectures. In Proc., IEEE Workshop on Comp. Arch. for Pattern Analysis and Machine Intelligence.

  • Dekel, E., Nassimi, D., and Sahni, S. 1981. Parallel matrix and graph algorithms. SIAM J. on Computing, 10, 4 (Nov.), 657–675.

    Google Scholar 

  • Fishburn, A., and Highnam, P. 1987. Computing the Hough transform on a scan line array processor. In Proc., IEEE Workshop on Comp. Arch. for Pattern Analysis and Machine Intelligence, pp. 83–87.

  • Guerra, C., and Hambrusch, S. 1987. Parallel algorithms for line detection on a mesh. In Proc., IEEE Workshop on Comp. Arch. for Pattern Analysis and Machine Intelligence, pp. 99–106.

  • Horowitz, E., and Sahni, S. 1985. Fundamentals of Data Structures in Pascal. Computer Science Press.

  • Ibrahim, H., Kender, J., and Shaw, D.E. 1986. On the application of massively parallel SIMD tree machines to certain intermediate level vision tasks. Comp. Vision, Graphics, and Image Processing, 36: 53–75.

    Google Scholar 

  • Nassimi, D., and Sahni, S. 1981. Data broadcasting in SIMD computers. IEEE Trans. Comps., C-30, 2 (Feb.), 101–107.

    Google Scholar 

  • Prasanna Kumar, V.K., and Krishnan, V. 1987. Efficient image template matching on SIMD hypercube machines. In Proc., 1987 Internat. Conf. on Parallel Processing (Chicago, Aug.), pp. 765–771.

  • Ranka, S., and Sahni, S. 1990. Parallel algorithms for image template matching. In Parallel Algorithms for Machine Intelligence (to appear).

  • Rosenfeld, A., and Kak, A.C. 1982. Digital Picture Processing. Academic Press, New York.

    Google Scholar 

  • Rosenfeld, A., Ornelas, J., and Hung, Y. 1988. Hough transform algorithms for mesh-connected SIMD parallel processors. Comp. Vision, Graphics, and Image Processing, 41, 3: 293–305.

    Google Scholar 

  • Thompson, C.D., and Kung, H.T. 1977. Sorting on a mesh-connected parallel computer. CACM, 20, 4: 263–271.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by the National Science Foundation under grants DCR84-20935 and 86-17374. All correspondence should be mailed to Sanjay Ranka.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ranka, S., Sahni, S. Computing Hough transforms on hypercube multicomputers. J Supercomput 4, 169–190 (1990). https://doi.org/10.1007/BF00127879

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00127879

Key words

Navigation