Asymmetric constraint optimization based adaptive boosting for cascade face detector

  • Authors:
  • Jia-Bao Wen;Yue-Shan Xiong

  • Affiliations:
  • College of Computer, National University of Defense Technology, Changsha, Hunan, China;College of Computer, National University of Defense Technology, Changsha, Hunan, China

  • Venue:
  • ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel variant of AdaBoost named AcoBoost is proposed to directly solve the asymmetric constraint optimization problem for cascade face detector using a two-stage feature selection approach. In the first stage, many candidate features are picked out by minimizing the weighted error. In the second stage, the optimal feature is singled out by minimizing the asymmetric constraint error. By doing so, the convergence rate is greatly speeded up. Besides, a new sample set called selection set is added into AcoBoost to prevent overfitting on the training set, which ensures good enough generalization ability for AcoBoost. The experimental results on building several upright frontal cascade face detectors show that the AcoBoost based classifiers have much better convergence ability and slightly worse generalization ability than the AdaBoost based ones. Some AcoBoost based cascade face detectors have satisfactory performance on the CMU+MIT upright frontal face test set.