|
Published Articles >> Table of Contents >> Abstract
2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 1
p. 425
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Ziqiang Liu, Microsoft Research Asia
Hong Chen, Microsoft Research Asia
Heung-Yeung Shum, Microsoft Research Asia
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2003.1211385
Send link to a friend
| Abstract |
|
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex high-dimensional distributions. However, its training process is so slow that the applicability of IGM has been greatly restricted. In this paper, we propose an approach for fast parameter learning of IGM. In IGM learning, features are incrementally constructed to constrain the learnt distribution. When a new feature is added, Markov-chain Monte Carlo (MCMC) sampling is repeated to draw samples for parameter learning. In contrast, our new approach constructs a closed-form reference distribution using approximate information gain criteria. Because our reference distribution is very close to the optimal one, importance sampling can be used to accelerate the parameter optimization process. For problems with high-dimensional distributions, our approach typically achieves a speedup of two orders of magnitude compared to the original IGM. We further demonstrate the efficiency of our approach by learning a high-dimensional joint distribution of face images and their corresponding caricatures.
|
 Additional Information
|
Citation:
Ziqiang Liu, Hong Chen, Heung-Yeung Shum,
"An Efficient Approach to Learning Inhomogeneous Gibbs Model,"
cvpr,
p. 425,
2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 1,
2003
|
|
