Computing the Hough transform on a scan line array processor
Journal Article
·
· IEEE Trans. Pattern Anal. Mach. Intell.; (United States)
This paper describes a parallel algorithm for a line-finding Hough transform that runs on a linearly connected, SIMD vector of processors. The authors show that a high-precision transform, usually considered to be an expensive global operation, can be performed efficiently, in two to three times real time, with only local communication on a long vector. The algorithm also illustrates a decomposition principle that has wide application in algorithm design for large linear arrays. They include a review of straight-line Hough transform implementations.
- Research Organization:
- Carnegie-Mellon Univ., Pittsburgh, PA (USA). Dept. of Computer Science
- OSTI ID:
- 5909736
- Journal Information:
- IEEE Trans. Pattern Anal. Mach. Intell.; (United States), Journal Name: IEEE Trans. Pattern Anal. Mach. Intell.; (United States) Vol. 11:3; ISSN ITPID
- Country of Publication:
- United States
- Language:
- English
Similar Records
Hough transform has O(N) complexity on SIMD N x N mesh array architectures. Technical report
Computing the Hough transform on an MIMD hypercube
O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors
Technical Report
·
Wed Jul 01 00:00:00 EDT 1987
·
OSTI ID:6716389
Computing the Hough transform on an MIMD hypercube
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5970445
O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors
Journal Article
·
Fri Mar 31 23:00:00 EST 1995
· IEEE Transactions on Systems, Man, and Cybernetics
·
OSTI ID:85530