Skip to search formSkip to main contentSkip to account menu

Geometric hashing

In computer science, geometric hashing is originally a method for efficiently finding two-dimensional objects represented by discrete points that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A rapid, sensitive and cost-effective method was developed for detection of foodborne pathogens, particularly Salmonella species… 
Highly Cited
2009
Highly Cited
2009
We demonstrate an efficient data-parallel algorithm for building large hash tables of millions of elements in real-time. We… 
Highly Cited
2009
Highly Cited
2009
This paper presents a matching method for 3D shapes, which comprises a new technique for surface sampling and two algorithms for… 
Highly Cited
2006
Highly Cited
2006
This article introduces a method for partial matching of surfaces represented by triangular meshes. Our method matches surface… 
Highly Cited
2006
Highly Cited
2006
We propose a novel representation of local image structure and a matching scheme that are insensitive to a wide range of… 
Highly Cited
2004
Highly Cited
2004
  • Hui ChenB. Bhanu
  • Proceedings of the 17th International Conference…
  • 2004
  • Corpus ID: 2303138
Highly Cited
2003
Highly Cited
2003
One of the challenges in 3D shape matching arises from the fact that in many applications, models should be considered to be the… 
Highly Cited
1998
Highly Cited
1998
Review
1997
Review
1997
Geometric hashing, a technique originally developed in computer vision for matching geometric features against a database of such… 
Highly Cited
1988
Highly Cited
1988
  • Y. LamdanH. Wolfson
  • [ Proceedings] Second International Conference on…
  • 1988
  • Corpus ID: 20693764
A general method for model-based object recognition in occluded scenes is presented. It is based on geometric hashing. The method…