Please use this identifier to cite or link to this item:
|Web of Science®
|Asymmetric pruning for learning cascade detectors
van den Hengel, A.
|IEEE Transactions on Multimedia, 2014; 16(5):1254-1267
|Institute of Electrical and Electronics Engineers (IEEE)
|Sakrapee Paisitkriangkrai, Chunhua Shen, and Anton van den Hengel
|Cascade classifiers are one of the most important contributions to real-time object detection. Nonetheless, there are many challenging problems arising in training cascade detectors. One common issue is that the node classifier is trained with a symmetric classifier. Having a low misclassification error rate does not guarantee an optimal node learning goal in cascade classifiers, i.e., an extremely high detection rate with a moderate false positive rate. In this work, we present a new approach to train an effective node classifier in a cascade detector. The algorithm is based on two key observations: 1) Redundant weak classifiers can be safely discarded; 2) The final detector should satisfy the asymmetric learning objective of the cascade architecture. To achieve this, we separate the classifier training into two steps: finding a pool of discriminative weak classifiers/features and training the final classifier by pruning weak classifiers which contribute little to the asymmetric learning criterion (asymmetric classifier construction). Our model reduction approach helps accelerate the learning time while achieving the pre-determined learning objective. Experimental results on both face and car data sets verify the effectiveness of the proposed algorithm. On the FDDB face data sets, our approach achieves the state-of-the-art performance, which demonstrates the advantage of our approach.
|Asymmetric classification; asymmetric pruning; boosting; cascade classifier; feature selection; object detection
|© 2014 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission
|Appears in Collections:
|Aurora harvest 2
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.