Some Tradeoffs and a New Algorithm for Geometric Hashing

  • Authors:
  • Affiliations:
  • Venue:
  • ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model-Based object recognition is a fundamentnal task of Computer Vision. In this paperwe consider the performance of the popular geometric hashing (GH) algorithmfor model based recognition and, in a probabilistic setting, examine the influence of some design decisions and derive several tradeoffs 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.