DocumentCode
3549017
Title
Infomax boosting
Author
Lyu, Siwei
Author_Institution
Dept. of Comput. Sci., Dartmouth Coll., Hanover, NH, USA
Volume
1
fYear
2005
fDate
20-25 June 2005
Firstpage
533
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.
Keywords
estimation theory; face recognition; feature extraction; gradient methods; transforms; Gauss transform; feature pursuit; gradient ascent algorithm; infomax boosting; maximal mutual information; nonparametric density estimation; quadratic mutual information; Boosting; Computer science; Computer vision; Educational institutions; Face detection; Gaussian processes; Mutual information; Pursuit algorithms; Robustness; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on
ISSN
1063-6919
Print_ISBN
0-7695-2372-2
Type
conf
DOI
10.1109/CVPR.2005.187
Filename
1467313
Link To Document