Hough transform has O(N) complexity on SIMD N x N mesh array architectures. Technical report
Technical Report
·
OSTI ID:6716389
This paper reports on new algorithms for computing the Hough transform on mesh-array architectures. The mesh is fine-grained, consisting of an N x N array of processors, each holding a single pixel of the image. The mesh array operates in an SIMD mode. Several algorithms, differing in the techniques they use, their asymptotic complexity, or the architectural resources required, are presented for computing the Hough transform. The main algorithm computes any P angles of the Hough transform in O(N + P) time and used only a constant amount of memory per processor. All the algorithms apply to the more general problem of computing the Radon transform of gray-level images.
- Research Organization:
- Washington Univ., Seattle (USA). Dept. of Computer Science
- OSTI ID:
- 6716389
- Report Number(s):
- AD-A-195925/3/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computing the Hough transform on a scan line array processor
O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors
Computing the Hough transform on an MIMD hypercube
Journal Article
·
Tue Feb 28 23:00:00 EST 1989
· IEEE Trans. Pattern Anal. Mach. Intell.; (United States)
·
OSTI ID:5909736
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
Computing the Hough transform on an MIMD hypercube
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5970445