Efficiently Learning a Detection Cascade with Sparse Eigenvectors

Publisher:
IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:
Journal Article
Citation:
IEEE Transactions On Image Processing, 2011, 19 (7), pp. 22 - 35
Issue Date:
2011-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011001964OK.pdf2.5 MB
Adobe PDF
Real-time object detection has many computer vision applications. Since Viola and Jones proposed the first real-time AdaBoost based face detection system, much effort has been spent on improving the boosting method. In this work, we first show that feature selection methods other than boosting can also be used for training an efficient object detector. In particular, we introduce greedy sparse linear discriminant analysis (GSLDA) for its conceptual simplicity and computational efficiency; and slightly better detection performance is achieved compared with . Moreover, we propose a new technique, termed boosted greedy sparse linear discriminant analysis (BGSLDA), to efficiently train a detection cascade. BGSLDA exploits the sample reweighting property of boosting and the class-separability criterion of GSLDA. Experiments in the domain of highly skewed data distributions (e.g., face detection) demonstrate that classifiers trained with the proposed BGSLDA outperforms AdaBoost and its variants. This finding provides a significant opportunity to argue that AdaBoost and similar approaches are not the only methods that can achieve high detection results for real-time object detection.
Please use this identifier to cite or link to this item: