A survey of the Hough transform
Computer Vision, Graphics, and Image Processing
Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Reconfigurable mesh algorithms for the Hough transform
Journal of Parallel and Distributed Computing
Optically interconnected processor arrays with switching capability
Journal of Parallel and Distributed Computing
Time-Division Optical Communications in Multiprocessor Arrays
IEEE Transactions on Computers
Efficient matrix operations in a reconfigurable array with spanning optical buses
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Image Processing on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Time-frequency signal synthesis and its application in multimedia watermark detection
EURASIP Journal on Applied Signal Processing
On the computation of the Circle Hough Transform by a GPU rasterizer
Pattern Recognition Letters
Recognition of circular patterns on GPUs: Performance analysis and contributions
Journal of Parallel and Distributed Computing
Linear array with a reconfigurable pipelined bus system - Concepts and applications
Information Sciences: an International Journal
Real-time detection of lines using parallel coordinates and OpenGL
Proceedings of the 27th Spring Conference on Computer Graphics
Real-time detection of lines using parallel coordinates and CUDA
Journal of Real-Time Image Processing
Hi-index | 0.00 |
This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). It is shown that the Hough transform for line and circle detection in an N \times N image can be implemented in a constant number of steps. The costs of the two algorithms are O(N^2p) and O(N^2p^2), respectively, where p is the magnitude of one dimension in the parameter space. These values are optimal with respect to the time complexity of the best known sequential algorithms.