PDF

Description

Recent papers have shown that indexing is a promising approach to fast model-based object recognition because it allows most of the possible matches between image point groups and model point groups to be quickly eliminated from consideration. Current indexing systems for the problem of recognizing three-dimensional objects from single two-dimensional images require groups of four points to generate a key into the table of model groups and each model group must be represented over an infinite subspace of a multi-dimensional table. We present a system that is capable of indexing using groups of three points by taking advantage of the probabilistic peaking effect. Each model group need only be represented at one point in the index table. To be able to index using groups of three points, we must allow false negatives for point group matches. If there are n model points present in the image, there are O(n^3) groups of three correct model points, so we can withstand negatives by examining information from multiple groups. Since we are able to index on smaller groups of points, indexing can be used with an additional set of algorithms with lower computational complexity. This system can utilize larger point groups to increase accuracy in discriminating between correct and incorrect matches. Results are given on real and synthetic data.

Details

Files

Statistics

from
to
Export
Download Full History