Geometric hashing: an overview
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Science and Engineering
- Vol. 4 (4), 10-21
- https://doi.org/10.1109/99.641604
Abstract
Geometric hashing, a technique originally developed in computer vision for matching geometric features against a database of such features, finds use in a number of other areas. Matching is possible even when the recognizable database objects have undergone transformations or when only partial information is present. The technique is highly efficient and of low polynomial complexity.Keywords
This publication has 22 references indexed in Scilit:
- Geometric Hashing: A General And Efficient Model-based Recognition SchemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On recognition of 3-D objects from 2-D imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Object recognition by affine invariant matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- 3D object recognition by indexing structural invariants from multiple viewsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient two dimensional object recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Searching in parallel for similar strings [biological sequences]IEEE Computational Science and Engineering, 1994
- 3D object recognition using invariant feature indexing of interpretation tablesCVGIP: Image Understanding, 1992
- Affine invariant model-based object recognitionIEEE Transactions on Robotics and Automation, 1990
- Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic CurvesThe International Journal of Robotics Research, 1987
- Two-Dimensional, Model-Based, Boundary Matching Using FootprintsThe International Journal of Robotics Research, 1986