Infomax Boosting

Lyu, Siwei

doi:10.1109/CVPR.2005.187

Infomax Boosting

Siwei Lyu

CVPR 2005 pp. 533-538

doi:10.1109/CVPR.2005.187 /cvpr/2005/lyu2005cvpr-infomax/

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.

CVPR Semantic Scholar

Cite

Text

Lyu. "Infomax Boosting." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.187

Markdown

[Lyu. "Infomax Boosting." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/lyu2005cvpr-infomax/) doi:10.1109/CVPR.2005.187

BibTeX

@inproceedings{lyu2005cvpr-infomax,
  title     = {{Infomax Boosting}},
  author    = {Lyu, Siwei},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2005},
  pages     = {533-538},
  doi       = {10.1109/CVPR.2005.187},
  url       = {https://mlanthology.org/cvpr/2005/lyu2005cvpr-infomax/}
}