The problem of fast rigid matching of 3D curves with subvoxel precision is addressed. More invariant parameters are used, and new hash tables are implemented in order to process larger and more complex sets of data curves. There exists a Bayesian theory of geometric hashing that explains why local minima are not really a problem. The more likely transformation always wins. It is also possible to predict the uncertainty on the match with the help of the Kalman filter, and compare it with real measures.<>
New developments on geometric hashing for curve matching
1993-01-01
215868 byte
Conference paper
Electronic Resource
English
A Bayesian Approach to Model Matching with Geometric Hashing
British Library Online Contents | 1995
|Where's Wally? - Geometric Hashing for Model Based Image Matching
British Library Online Contents | 1993
|Geometric hashing with attributed features
IEEE | 1994
|Geometric Hashing with Attributed Features
British Library Conference Proceedings | 1994
|Content-based image retrieval by interest-point matching and geometric hashing [4925-14]
British Library Conference Proceedings | 2002
|