Results 1 - 10
of
276
Geometric Hashing
- IEEE Computational Science Engineering
, 1997
"... 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 obtai ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
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
Geometric hashing techniques for watermarking
- in ICIP 2001, 2001, p. Watermarking i
, 2001
"... In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techniques into the watermarking methodology. Geometric Hashing was developed to detect objects in a visual scene under a clas ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techniques into the watermarking methodology. Geometric Hashing was developed to detect objects in a visual scene under a
An Enhanced Geometric Hashing
"... Abstract—This paper presents an enhanced geometric hashing technique suitable for object recognition. Unlike the available geometric hashing, the proposed technique needs less amount of time and memory, uniform index distribution in the hash space without using any rehashing function. It performs in ..."
Abstract
- Add to MetaCart
Abstract—This paper presents an enhanced geometric hashing technique suitable for object recognition. Unlike the available geometric hashing, the proposed technique needs less amount of time and memory, uniform index distribution in the hash space without using any rehashing function. It performs
Geometric Hashing: Error Analysis
"... We develop a model for predicting the probability of incorrect, random matches when using a geometric hashing based recognition scheme. To estimate the vote for random matches we approximate the voting function by a discrete function and use the binomial distribution. The resulting probability distr ..."
Abstract
- Add to MetaCart
We develop a model for predicting the probability of incorrect, random matches when using a geometric hashing based recognition scheme. To estimate the vote for random matches we approximate the voting function by a discrete function and use the binomial distribution. The resulting probability
Rehashing for Bayesian Geometric Hashing
"... Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. In the last decade a number of enhancements have been suggested to the basic method improving its performance and reliability. One of the important en ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. In the last decade a number of enhancements have been suggested to the basic method improving its performance and reliability. One of the important
Geometric hashing: Rehashing for bayesian voting
- Accepted to International Conference of Pattern Recognition
, 2004
"... Abstract. Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. Today it is widely used as an object recognition method in numerous applications. In the last decade a number of en-hancements have been sug ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. Today it is widely used as an object recognition method in numerous applications. In the last decade a number of en-hancements have been
2- and 3-Dimensional Geometric Hashing with Points and Lines
"... In this paper we compare our 3-D geometric hashing approach to object recognition to a 2-D geometric hashing approach developed by Gavrila and Groen. We apply both methods to same recognition task using real images. We found that the indexing technique used in geometric hashing is much more efficien ..."
Abstract
- Add to MetaCart
In this paper we compare our 3-D geometric hashing approach to object recognition to a 2-D geometric hashing approach developed by Gavrila and Groen. We apply both methods to same recognition task using real images. We found that the indexing technique used in geometric hashing is much more
Weaknesses of Password Authentication Scheme Based on Geometric Hashing
"... Abstract We show that a recently proposed password authentication scheme based on geometric hashing has several security weaknesses, and that the use of this scheme should be avoided in practice. ..."
Abstract
- Add to MetaCart
Abstract We show that a recently proposed password authentication scheme based on geometric hashing has several security weaknesses, and that the use of this scheme should be avoided in practice.
IMPROVING GEOMETRIC HASHING BY MEANS OF FEATURE DESCRIPTORS
"... Abstract: Geometric Hashing is a well-known technique for object recognition. This paper proposes a novel method aimed at improving the performance of Geometric Hashing in terms of robustness toward occlusion and clutter. To this purpose, it employs feature descriptors to notably decrease the amount ..."
Abstract
- Add to MetaCart
Abstract: Geometric Hashing is a well-known technique for object recognition. This paper proposes a novel method aimed at improving the performance of Geometric Hashing in terms of robustness toward occlusion and clutter. To this purpose, it employs feature descriptors to notably decrease
Multiple Structural Alignment and Core Detection by Geometric Hashing
, 1999
"... . A Multiple Structural Alignment algorithm is presented. The algorithm accepts an ensemble of protein structures and finds the largest substructure (core) of C ff atoms whose geometric configuration appear in all the molecules of the ensemble (core). Both the detection of this core and the resultin ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
and the resulting structural alignment are done simultaneously. Other large enough multistructural superimpositions are detected as well. Our method is based on the Geometric Hashing paradigm and a superimposition clustering technique which represents superimpositions by sets of matching atoms. The algorithm proved
Results 1 - 10
of
276