Learning Inhomogeneous Gibbs Model of Faces by Minimax Entropy
Abstract
In this paper we propose a novel inhomogeneous Gibbs model by the minimax entropy principle, and apply it to face modeling. The maximum entropy principle generalizes the statistical properties of the observed samples and results in the Gibbs distribution, while the minimum entropy principle makes the learnt distribution close to the observed one. To capture the fine details of a face, an inhomogeneous Gibbs model is derived to learn the local statistics of facial feature paints. To alleviate the high dimensionality problem of face models, we propose to learn the distribution in a subspace reduced by principal component analysis or PCA. We demonstrate that our model effectively captures important and subtle non-Gaussian face patterns and efficiently generates good face models.
Cite
Text
Liu et al. "Learning Inhomogeneous Gibbs Model of Faces by Minimax Entropy." IEEE/CVF International Conference on Computer Vision, 2001. doi:10.1109/ICCV.2001.10007Markdown
[Liu et al. "Learning Inhomogeneous Gibbs Model of Faces by Minimax Entropy." IEEE/CVF International Conference on Computer Vision, 2001.](https://mlanthology.org/iccv/2001/liu2001iccv-learning/) doi:10.1109/ICCV.2001.10007BibTeX
@inproceedings{liu2001iccv-learning,
title = {{Learning Inhomogeneous Gibbs Model of Faces by Minimax Entropy}},
author = {Liu, Ce and Zhu, Song Chun and Shum, Heung-Yeung},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2001},
pages = {281-287},
doi = {10.1109/ICCV.2001.10007},
url = {https://mlanthology.org/iccv/2001/liu2001iccv-learning/}
}