LACBoost and FisherBoost: Optimally Building Cascade Classifiers

Details LACBoost and FisherBoost: Optimally Building Cascade Classifiers LACBoost and FisherBoost: Optimally Building Cascade Classifiers

2010-05-22

arxiv.org/abs/1005.4103v1

Computer Science

Computer Vision and Pattern Recognition

15 pages

Scientific paper

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 Wu et al. in that our boosting algorithm optimizes a similar cost function. The new totally-corrective 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-of-the-art methods in detection performance.

Affiliated with

Also associated with

No associations

Rating

LACBoost and FisherBoost: Optimally Building Cascade Classifiers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with LACBoost and FisherBoost: Optimally Building Cascade Classifiers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LACBoost and FisherBoost: Optimally Building Cascade Classifiers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-412701