The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (5) , 805-820
- https://doi.org/10.1137/0219056
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient parallel convex hull algorithmsIEEE Transactions on Computers, 1988
- P3E: New life for projection-based image processingJournal of Parallel and Distributed Computing, 1987
- Computing projections of digital images in image processing pipeline architecturesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Geometric Algorithms for Digitized Pictures on a Mesh-Connected ComputerIEEE Transactions on Pattern Analysis and Machine Intelligence, 1985
- Gauge Inspection Using Hough TransformsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Image processing on MPP: 1Pattern Recognition, 1982
- Parallel Image Processing by Memory-Augmented Cellular AutomataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerSIAM Journal on Computing, 1980
- Design of a Massively Parallel ProcessorIEEE Transactions on Computers, 1980
- On shrinking binary picture patternsCommunications of the ACM, 1972