DocumentCode :
2135474
Title :
Efficient algorithms for the Hough transform on arrays with reconfigurable optical buses
Author :
Pavel, Sandy ; Akl, Selim G.
Author_Institution :
Dept. of Comput. & Inf. Sci., Queen´´s Univ., Kingston, Ont., Canada
fYear :
1996
fDate :
15-19 Apr 1996
Firstpage :
697
Lastpage :
701
Abstract :
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×N image can be implemented in a constant number of steps. The costs of the two algorithms are O(N2p) and O(N2p2), 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
Keywords :
Hough transforms; computational complexity; edge detection; multiprocessor interconnection networks; optical interconnections; parallel algorithms; parallel architectures; reconfigurable architectures; system buses; Hough transform; arrays; circle detection; edge detection; image processing; line detection; multiprocessor interconnection network; optimal values; parallel algorithms; reconfigurable optical buses; sequential algorithms; time complexity; Costs; Detection algorithms; Image converters; Image edge detection; Information science; Object detection; Optical arrays; Optical computing; Pixel; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Conference_Location :
Honolulu, HI
Print_ISBN :
0-8186-7255-2
Type :
conf
DOI :
10.1109/IPPS.1996.508134
Filename :
508134
Link To Document :
بازگشت