Geometric hashing

In computer science, geometric hashing is originally a method for efficiently finding two-dimensional objects represented by discrete points that…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2008

The problem of grasping novel objects in a fully automatic way has gained increasing importance. In this work we consider the…

2004

Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear…

1997

Object recognition is complicated by clutter, occlusion, and sensor error. Since pose hypotheses are based on image feature…

1996

this paper we will show that the inherent robustness of geometric hashing to spurious data can be used to overcome the problems…

1995

We introduce a geometric hashing strategy to recognize CAD models from an organized hierarchy. Unlike most prior work in hashing…

1994

Geometric hashing systems for object recognition have typically made use of point features in order to describe models and…

1991

The authors report on a scalable implementation of geometric hashing on the Connection Machine. Using this implementation, it is…

1991

Affine transformations are often used in recognition systems, to approximate the effects of perspective projection. The…

1990

A parallel implementation of a system to recognize 2D objects under realistic scenarios (occlusion, rotation, translation, and…

1989

This thesis proposes a general and efficient model-based object recognition scheme. The scheme addresses the problem of…