DocumentCode
3439525
Title
Time complexity evaluation of algorithms for the Hough transform on mesh connected computers
Author
Albanesi, Maria Grazia
Author_Institution
Dipartimento di Inf. e Sistemistica, Pavia Univ., Italy
fYear
1991
fDate
13-16 May 1991
Firstpage
253
Lastpage
257
Abstract
The problem of evaluating the time complexity of parallel algorithms for the Hough transform (HT) is addressed. A possible method of analysing several proposals in the literature is presented, referring to different implementations of algorithms on mesh-connected computers. The methodology is based on some assumptions which are motivated by memory and architectural constraints of the HT implementation on meshes and by VLSI requirements for an efficient integration
Keywords
VLSI; computational complexity; parallel algorithms; parallel architectures; transforms; Hough transform; VLSI requirements; architectural constraints; memory constraints; mesh connected computers; parallel algorithms; time complexity; Algorithm design and analysis; Computational efficiency; Computer architecture; Concurrent computing; Memory management; Parallel algorithms; Proposals; Shape; Very large scale integration; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
CompEuro '91. Advanced Computer Technology, Reliable Systems and Applications. 5th Annual European Computer Conference. Proceedings.
Conference_Location
Bologna
Print_ISBN
0-8186-2141-9
Type
conf
DOI
10.1109/CMPEUR.1991.257392
Filename
257392
Link To Document