Published 2006 | Version public
Book Section - Chapter

A Sparse Object Category Model for Efficient Learning and Complete Recognition

Abstract

We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a weakly-supervised manner: the model is learnt from example images containing category instances, without requiring segmentation from background clutter. The model is a sparse representation of the object, and consists of a star topology configuration of parts modeling the output of a variety of feature detectors. The optimal choice of feature types (whose repertoire includes interest points, curves and regions) is made automatically. In recognition, the model may be applied efficiently in a complete manner, bypassing the need for feature detectors, to give the globally optimal match within a query image. The approach is demonstrated on a wide variety of categories, and delivers both successful classification and localization of the object within the image.

Additional Information

© Springer-Verlag Berlin Heidelberg 2006. We are very grateful for suggestions from and discussions with Michael Isard, Dan Huttenlocher and Alex Holub. Financial support was provided by: EC Project CogViSys; EC PASCAL Network of Excellence, IST-2002-506778; UK EPSRC; Caltech CNSE and the NSF.

Additional details

Identifiers

Eprint ID
94255
Resolver ID
CaltechAUTHORS:20190328-144424435

Funding

European Research Council (ERC)
CogViSys
EC PASCAL Network of Excellence
IST-2002-506778
Engineering and Physical Sciences Research Council (EPSRC)
Center for Neuromorphic Systems Engineering, Caltech
NSF

Dates

Created
2019-03-28
Created from EPrint's datestamp field
Updated
2021-11-16
Created from EPrint's last_modified field

Caltech Custom Metadata

Series Name
Lecture Notes in Computer Science
Series Volume or Issue Number
4170