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 distribution of votes for random matches is compared with experiments that have a set of artificially generated, randomly distributed points as input. We find that the theoretical model accurately predicts the votes for random matches for most of the object models that we used. For the other models there were only small deviations.
منابع مشابه
Limitations of Geometric Hashing in the Presence of Gaussian Noise
This paper presents a detailed error analysis of geometric hashing in the domain of 2D object recogition. Earlier analysis has shown that these methods are likely to produce false positive hypotheses when one allows for uniform bounded sensor error and moderate amounts of extraneous clutter points. These false positives must be removed by a subsequent veri cation step. Later work has incorporat...
متن کاملCorrectness and Robustness of 3D Rigid Matching with Bounded Sensor Error
We present in this paper a precise study of Alignment and Geometric Hashing for the recognition of 3D rigid objects in the presence of uncertainty. Given a bounded error on point features, we propagate it through the computations to determine the translation and rotation error. This allows the computation of the compatibility zone, either in the image or in the hash table, to insure the correct...
متن کاملGeometric Hashing: Rehashing for Bayesian Voting
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 enhancements have been suggested to the basic method improving its performance and reliability. Here we consider two of them. One is r...
متن کاملA Probabilistic Approach to Geometric Hashing Using Line Features
One of the most important goals of computer vision research is object recognition. Most current object recognition algorithms assume reliable image segmentation, which in practice is often not available. This research exploits the combination of the Hough method with the geometric hashing technique for model-based object recognition in seriously degraded intensity images. We describe the analys...
متن کاملSimilarity Hashing: A Computer Vision Solution to the Inverse Problem of Linear Fractals
The di cult task of nding a fractal representation of an input shape is called the inverse problem of fractal geometry. Previous attempts at solving this problem have applied techniques from numerical minimization, heuristic search and image compression. The most appropriate domain from which to attack this problem is not numerical analysis nor signal processing, but model-based computer vision...
متن کامل