DocumentCode :
2596121
Title :
On the error analysis of `geometric hashing´
Author :
Lamdan, Yeherkel ; Wolfson, H.J.
Author_Institution :
Courant Inst. of Math. Sci., New York, NY, USA
fYear :
1991
fDate :
3-6 Jun 1991
Firstpage :
22
Lastpage :
27
Abstract :
An experimental and theoretical analysis of the noise model in the geometric hashing technique is presented. The efficacy of the technique is discussed in the cases of affine transformations, similarities, and grid motions. The efficacy of the voting procedure, in geometric hashing is discussed, and it is shown that its introduction significantly reduces the expected burden of the verification stage. The discussion is illustrated by results of simulations which have been performed to test the expected performance of the algorithm
Keywords :
computer vision; computerised pattern recognition; error analysis; file organisation; affine transformations; error analysis; geometric hashing; grid motions; noise model; similarities; voting procedure; Computational modeling; Error analysis; Laboratories; Mathematical model; Performance evaluation; Redundancy; Robots; Solid modeling; Testing; Voting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on
Conference_Location :
Maui, HI
ISSN :
1063-6919
Print_ISBN :
0-8186-2148-6
Type :
conf
DOI :
10.1109/CVPR.1991.139655
Filename :
139655
Link To Document :
بازگشت