DocumentCode :
3557247
Title :
Implementation of geometric hashing on the Connection Machine
Author :
Rigoutsos, Isidore ; Hummel, Robert
Author_Institution :
New York Univ., NY, USA
fYear :
1991
fDate :
2-3 Jun 1991
Firstpage :
76
Lastpage :
84
Abstract :
The authors report on a scalable implementation of geometric hashing on the Connection Machine. Using this implementation, it is possible to recognize models consisting of patterns of points embedded in scenes, independent of translation, rotation, and scale changes. With 1024 models and a scene of 200 points, the implementation yields an execution time of 70 milliseconds for recognition of the one embedded model given a two-point basis set (consisting of a pair of points in the model) on a 64 K-processor CM-2 parallel computer. The algorithm is scalable, yielding an expected execution time that is 𝒪(log2 M+log S log M) on a Mn3 -processor hypercube-connected SIMD machine such as the Connection Machine; M is the number of models, n is the number of points per model, S is the number of scene points, and it is assumed that execution proceeds until the first model is discovered
Keywords :
computer vision; computerised pattern recognition; computerised picture processing; file organisation; parallel processing; performance evaluation; solid modelling; 70 ms; CM-2; Connection Machine; SIMD; computer vision; execution time; geometric hashing; hypercube; parallel computer; Computational efficiency; Data structures; Digital images; Layout; Machine vision; Network servers; Parallel processing; Pattern recognition; Solid modeling; Telephony;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automated CAD-Based Vision, 1991., Workshop on Directions in
Conference_Location :
Maui, HI
Print_ISBN :
0-8186-2147-8
Type :
conf
DOI :
10.1109/CADVIS.1991.148760
Filename :
148760
Link To Document :
بازگشت