Infomax Boosting

Authors:
Siwei Lyu
Affiliations:
Dartmouth College
Venue:
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Year:
2005

Citing 0
Cited 4

Ent-Boost: Boosting using entropy measures for robust object detection

Pattern Recognition Letters
Universal Estimation of Information Measures for Analog Sources

Foundations and Trends in Communications and Information Theory
Info-margin maximization for feature extraction

Pattern Recognition Letters
On selection and combination of weak learners in AdaBoost

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maximal mutual information with class labels. Direct feature pursuit with infomax is computationally prohibitive, so an efficient gradient ascent algorithm is further proposed, based on the quadratic mutual information, non-parametric density estimation and fast Gauss transform. The feature pursuit process is integrated into a boosting framework as infomax boosting. The performance of a face detector based on infomax boosting is reported.