Issue No. 03 - March (2008 vol. 30)
A cascade face detector uses a sequence of node classifiers to distinguish faces from non-faces. This paper presents a new approach to design node classifiers in the cascade detector. Previous methods used machine learning algorithms that simultaneously select features and form ensemble classifiers. We argue that if these two parts are decoupled, we have the freedom to design a classifier that explicitly addresses the difficulties caused by the asymmetric learning goal. There are three contributions in this paper. The first is a categorization of asymmetries in the learning goal, and why they make face detection hard. The second is the Forward Feature Selection (FFS) algorithm and a fast pre- omputing strategy for AdaBoost. FFS and the fast AdaBoost can reduce the training time by approximately 100 and 50 times, in comparison to a naive implementation of the AdaBoost feature selection method. The last contribution is Linear Asymmetric Classifier (LAC), a classifier that explicitly handles the asymmetric learning goal as a well-defined constrained optimization problem. We demonstrated experimentally that LAC results in improved ensemble classifier performance.
face detection, cascade classifier, asymmetry, feature selection
Jianxin Wu, S. Charles Brubaker, Matthew D. Mullin, James M. Rehg, "Fast Asymmetric Learning for Cascade Face Detection", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 30, no. , pp. 369-382, March 2008, doi:10.1109/TPAMI.2007.1181