Geometric Hashing (1997)
| Venue: | IEEE Computational Science Engineering |
| Citations: | 3 - 0 self |
BibTeX
@ARTICLE{Rigoutsos97geometrichashing,
author = {Isidore Rigoutsos and Haim Wolfson},
title = {Geometric Hashing},
journal = {IEEE Computational Science Engineering},
year = {1997},
volume = {4},
pages = {1070--9924}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we describe the Geometric Hashing paradigm for matching of a set of geometric features against a database of such feature sets. Specific examples are model based object recognition in computer vision for which this technique was originally developed, matching of volumetric data obtained from CT or MRI images of different persons, matching of an individual fingerprint versus a database, matching the molecular surface of a receptor molecule against a data base of drugs and so on. The features considered can be points, segments, infinite lines, corners and any other geometric entities. The matching is performed under any non-elastic geometric transformation such as the rigid, similarity, affine and projective transformations in any dimension. Moreover, the problem addressed is the much more difficult partial matching problem, where one tries to detect (previously unknown) large subsets of the feature set which are compatible with subsets of the database feature sets...
