On the error analysis of 'geometric hashing'

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.< >