Abstract
A parallel algorithm for Hough transform on a linear array with reconfigurable pipeline bus system (LARPBS) is presented. Suppose the number of θ-values to be considered is m, for an image with n × n pixels, the algorithm can complete Hough transform in O(1) time using mn 2 processors and achieve optimal speed and efficiency. We also illustrate how to partition data and perform the algorithm on a LARPBS with fewer than mn 2 processors, and hence show that the algorithm is highly scalable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. L. Chung and H. Y. Lin. Hough transform on reconfigurable meshes. Computer Vision and Image Understanding, 61(2):278-284, 1995.
A. L. Fisher and P. T. Highnam. Computing the Hough transform on a scan line array processor. IEEE Transactions on PAMI, 11(3):262-265, 1989.
H. A. H. Ibrahim, J. R. Kender, and D. E. Shaw. The analysis and performance of two middle-level vision tasks on a fine-grained SIMD tree machine. Proceedings IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1985, pp. 387-393.
J. Jolion and A. Rosenfeld. An O(logn) pyramid Hough transform. Pattern Recognition Letters, 9:343-349, 1989.
T. W. Kao, S. J. Horng, and Y. L. Wang. An O(1) time algorithm for computing histogram and the Hough transform on a cross-bridge reconfigurable array of processors. IEEE Transactions on Systems, Man and Cybernetics, 25(4):681-687, 1995.
Xu Lei and O ja Erkki. Randomized Hough transform (RHT): Basic mechanism, algorithms, and computational complexities. CVGIP: Image Understanding, 57(2):131-154, 1993.
K. Li, Y. Pan, and S.-Q. Zheng, eds. Parallel Computing Using Optical Interconnections, Kluwer Academic Publishers, Boston, USA, Hardbound, Oct. 1998, ISBN 0-7923-8296-X.
S. S. Lin. Constant-time Hough transform on the processor array with reconfigurable bus systems. Computing, 52:1-15, 1994.
M. Merry and J.W. Baker. Constant time algorithm for computing Hough transform on a reconfigurable mesh. Image and Vision Computing, 14:35-37, 1996.
Y. Pan. A more efficient constant time algorithm for computing the Hough transform. Parallel Processing Letters, 4(1/2):45-52, 1994.
Y. Pan. Constant-time Hough transform on a 3D reconfigurable mesh using fewer processors. Proceedings of Reconfigurarble Architectures Workshop (RAW2000), May 5, 2000, vol. 1800, LNCS, pp. 966-973.
Y. Pan and H. Y. H. Chung. Faster line detection algorithms on enhanced mesh connected arrays. IEE Proceeding-E, 140(2):95-100, 1993.
Y. Pan, K. Li, and M. Hamdi, An improved constant time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh. IEEE Transactions on Systems, Man, and Cybernetics (Part A), 29(4):417-421, 1999.
S. Pavel and S. G. Akl. Computing the Hough transformation on arrays with reconfigurable optical buses. In K. Li, Y. Pan, and S. Q. Zheng, eds., Parallel Computing Using Optical Interconnections, Kluwer Academic Publishers, Boston, USA, Hardbound, Oct. 1998, pp. 205-226, ISBN 0-7923-8296-X.
G. Roth and M.D. Levin, Geometric primitive extraction using a genetic algorithm. IEEE Trans on PAMI, 9(16):901-905, 1994.
Jiang Tianzi and Ma Songde. Geometric primitive extraction using Tabu search. Proc ICPR'96, Vienna, Austria, 1996, vol. 2, pp. 266-279.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, L., Chen, H., Pan, Y. et al. A Fast Efficient Parallel Hough Transform Algorithm on LARPBS. The Journal of Supercomputing 29, 185–195 (2004). https://doi.org/10.1023/B:SUPE.0000026850.06646.3c
Issue Date:
DOI: https://doi.org/10.1023/B:SUPE.0000026850.06646.3c