The combinatorics of heuristic search termination for objectrecognition in cluttered environments
Grimson, W.E.L.
Artificial Intelligence Lab., MIT, Cambridge, MA ;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Sep 1991
Volume: 13,
Issue: 9
On page(s): 920-935
ISSN: 0162-8828
References Cited: 31
CODEN: ITPIDJ
INSPEC Accession Number: 4041338
Digital Object Identifier: 10.1109/34.93810
Current Version Published: 2002-08-06
Abstract
Many current recognition systems terminate a search once an
interpretation that is good enough is found. The author formally
examines the combinatorics of this approach, showing that choosing
correct termination procedures can dramatically reduce the search. In
particular, the author provides conditions on the object model and the
scene clutter such that the expected search is at most quartic. The
analytic results are shown to be in agreement with empirical data for
cluttered object recognition. These results imply that it is critical to
use techniques that select subsets of the data likely to have come from
a single object before establishing a correspondence between data and
model features
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
