By Topic

Some trade-offs and a new algorithm for geometric hashing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Hoffman ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; M. Lindenbaum

Model-based object recognition is a fundamental task of computer vision. In this paper we consider the performance of the popular geometric hashing (GH) algorithm for model based recognition and, in a probabilistic setting, examine the influence of some design decisions and derive several trade-offs between two measures of performance: reliability and time complexity. We also propose a variation of the GH algorithm, which alleviates some of its inherent problems and demonstrate its enhanced performance in experiments

Published in:

Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on  (Volume:2 )

Date of Conference:

16-20 Aug 1998