Robust algorithms for model-based object recognition and localization

We consider the problem of model-based object recognition and localization in the presence of noise, spurious features, and occlusion. We address the case where the model is allowed to be transformed by elements in a given space of allowable transformations. Known algorithms for the problem either treat noise very accurately in an unacceptable worst case running time, or may have unreliable output when noise is allowed. We introduce the idea of tolerance which measures the robustness of a recognition and localization method when noise is allowed. We present a collection of algorithms for the problem, each achieving a different degree of tolerance. The main result is a localization algorithm that achieves any desired tolerance in a relatively low order worst case asymptotic running time. The time constant of the algorithm depends on the ratio of the noise bound over the given tolerance bound. The solution we provide is general enough to handle different cases of allowable transformations, such as planar affine transformations, and scaled rigid motions in arbitrary dimensions.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

1999

Author dc:creator

• Bazzi, Louay Mohamad Jamil, 1974-

Advisor dc:contributor.advisor

• Sanjoy K. Mitter.

• Electrical Engineering and Computer Science

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/9440

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/9440