An examination is made of the problem of selecting models from a library, and the combinatorics of determining that a candidate object is not present in the data are examined. It is shown that the expected search is again exponential, implying that naive approaches to indexing are likely to carry an expensive overhead, since exponential work is needed to weed out each incorrect model. The analytical results are shown to be in agreement with empirical data for cluttered object recognition.<>
The effect of indexing on the complexity of object recognition
1990-01-01
661514 byte
Conference paper
Electronic Resource
English
3D Object Recognition and Pose with Relational Indexing
British Library Online Contents | 2000
|Model-Based 3D Object Recognition Using Bayesian Indexing
British Library Online Contents | 1998
|Spectral gradients for color-based object recognition and indexing
British Library Online Contents | 2004
|