Cascade object detection with deformable part models

We describe a general method for building cascade classifiers from part-based deformable models such as pictorial structures. We focus primarily on the case of star-structured models and show how a simple algorithm based on partial hypothesis pruning can speed up object detection by more than one or...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition pp. 2241 - 2248
Main Authors Felzenszwalb, P F, Girshick, R B, McAllester, D
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Buildings
Deformable models
Detection algorithms
Dynamic programming
Object detection
Statistical analysis
Statistical distributions
Testing
Training data
Visualization
Online AccessGet full text

Cover

More Information
Summary:We describe a general method for building cascade classifiers from part-based deformable models such as pictorial structures. We focus primarily on the case of star-structured models and show how a simple algorithm based on partial hypothesis pruning can speed up object detection by more than one order of magnitude without sacrificing detection accuracy. In our algorithm, partial hypotheses are pruned with a sequence of thresholds. In analogy to probably approximately correct (PAC) learning, we introduce the notion of probably approximately admissible (PAA) thresholds. Such thresholds provide theoretical guarantees on the performance of the cascade method and can be computed from a small sample of positive examples. Finally, we outline a cascade detection algorithm for a general class of models defined by a grammar formalism. This class includes not only tree-structured pictorial structures but also richer models that can represent each part recursively as a mixture of other parts.
ISBN:1424469848
9781424469840
ISSN:1063-6919
1063-6919
DOI:10.1109/CVPR.2010.5539906