A constant time algorithm for computing hough transform
- 28 February 1993
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 26 (2) , 277-286
- https://doi.org/10.1016/0031-3203(93)90036-v
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected ComputersSIAM Journal on Computing, 1990
- Fast hough transform on a mesh connected processor arrayInformation Processing Letters, 1990
- Computing the Hough transform on a scan line array processor (image processing)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Parallel algorithms for line detection on a meshJournal of Parallel and Distributed Computing, 1989
- Array processor with multiple broadcastingJournal of Parallel and Distributed Computing, 1987
- Optimal Bounds for Finding Maximum on Array of Processors with k Global BusesIEEE Transactions on Computers, 1986
- Finding Maximum on an Array Processor with a Global BusIEEE Transactions on Computers, 1984
- Mesh-Connected Computers with BroadcastingIEEE Transactions on Computers, 1983
- Generalizing the Hough transform to detect arbitrary shapesPattern Recognition, 1981
- Use of the Hough transformation to detect lines and curves in picturesCommunications of the ACM, 1972