On the error analysis of 'geometric hashing'

Yehezkel Lamdan, Haim J. Wolfson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProc 91 IEEE Comput Soc Conf Comput Vision Pattern Recognit
PublisherPubl by IEEE
Pages22-27
Number of pages6
ISBN (Print)0818621486
StatePublished - 1991
Externally publishedYes
EventProceedings of the 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Maui, HI
Duration: 3 Jun 19916 Jun 1991

Publication series

NameProc 91 IEEE Comput Soc Conf Comput Vision Pattern Recognit

Conference

ConferenceProceedings of the 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
CityMaui, HI
Period3/06/916/06/91

Fingerprint

Dive into the research topics of 'On the error analysis of 'geometric hashing''. Together they form a unique fingerprint.

Cite this