Many recognition systems use constrained search to locate objects in cluttered environments. Earlier analysis showed that the expected search is quadratic in the number of model and data features, if all the data comes from one object, but is exponential when spurious data is included. To overcome this, many methods terminate search once an interpretation that is "good enough" is found. We formally examine the combinatorics of this, showing that correct termination procedures dramatically reduce search. We provide conditions on the object model and the scene clutter such that the expected search is quartic. These results are shown to agree with empirical data for cluttered object recognition.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6027 |
| Date | 01 May 1989 |
| Creators | Grimson, W. Eric L. |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 30 p., 3882593 bytes, 1505756 bytes, application/postscript, application/pdf |
| Relation | AIM-1111 |
Page generated in 0.0019 seconds