Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||LACBoost and FisherBoost: optimally building cascade classifiers|
|Citation:||Proceedings of 11th European Conference on Computer Vision ( ECCV'10), 5-11 September, 2010, Part II / K. Daniilidis, P. Maragos and N. Paragios (eds.); pp. 608-621|
|Publisher:||Springer Berlin Heidelberg|
|Series/Report no.:||Lecture Notes in Computer Science; 6312|
|Conference Name:||European Conference on Computer Vision (ECCV) (10th : 2010 : Crete, Greece)|
|Chunhua Shen, Peng Wang and Hanxi Li|
|Abstract:||Object detection is one of the key tasks in computer vision. The cascade framework of Viola and Jones has become the de facto standard. A classifier in each node of the cascade is required to achieve extremely high detection rates, instead of low overall classification error. Although there are a few reported methods addressing this requirement in the context of object detection, there is no a principled feature selection method that explicitly takes into account this asymmetric node learning objective. We provide such a boosting algorithm in this work. It is inspired by the linear asymmetric classifier (LAC) of  in that our boosting algorithm optimizes a similar cost function. The new totallycorrective boosting algorithm is implemented by the column generation technique in convex optimization. Experimental results on face detection suggest that our proposed boosting algorithms can improve the state-ofthe-art methods in detection performance.|
|Rights:||© Springer-Verlag Berlin|
|Appears in Collections:||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.