A Fast Efficient Parallel Hough Transform Algorithm on LARPBS

Authors:
Ling Chen;Hongjian Chen;Yi Pan;Yixin Chen
Affiliations:
Department of Computer Science, Yangzhou University, Yangzhou 225009, China;Department of Computer Science, Yangzhou University, Yangzhou 225009, China;Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
Venue:
The Journal of Supercomputing
Year:
2004

Citing 8
Cited 0

Computing the Hough Transform on a Scan Line Array Processor (Image Processing)

IEEE Transactions on Pattern Analysis and Machine Intelligence
Randomized Hough transform (RHT): basic mechanisms, algorithms, and computational complexities

CVGIP: Image Understanding
Hough transform on reconfigurable meshes

Computer Vision and Image Understanding
Parallel Computing Using Optical Interconnections

Parallel Computing Using Optical Interconnections
Geometric Primitive Extraction Using a Genetic Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Constant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Geometric Primitive Extraction Using Tabu Search

ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
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: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

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 mn2 processors and achieve optimal speed and efficiency. We also illustrate how to partition data and perform the algorithm on a LARPBS with fewer than mn2 processors, and hence show that the algorithm is highly scalable.