LACBoost and FisherBoost: optimally building cascade classifiers

  • Authors:
  • Chunhua Shen;Peng Wang;Hanxi Li

  • Affiliations:
  • NICTA, Canberra Research Laboratory, ACT, Australia and Australian National University, ACT, Australia;Beihang University, Beijing, China;Australian National University, ACT, Australia and NICTA, Canberra Research Laboratory, ACT, Australia

  • Venue:
  • ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 [1] 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-of the art methods in detection performance.