## Minimax Entropy Principle and Its Application to Texture Modeling (1997)

### Cached

### Download Links

- [www.isi.uu.nl]
- [www.diku.dk]
- [www.cs.toronto.edu]
- [www.stat.ucla.edu]
- [ftp.dam.brown.edu]
- [www.cis.ohio-state.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 193 - 39 self |

### BibTeX

@MISC{Zhu97minimaxentropy,

author = {Song Chun Zhu and Ying Nian Wu and David Mumford},

title = {Minimax Entropy Principle and Its Application to Texture Modeling},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

This article proposes a general theory and methodology, called the minimax entropy principle, for building statistical models for images (or signals) in a variety of applications. This principle consists of two parts. The first is the maximum entropy principle for feature binding (or fusion): for a certain set of feature statistics, a distribution can be built to bind these feature statistics together by maximizing the entropy over all distributions that reproduce these feature statistics. The second part is the minimum entropy principle for feature selection: among all plausible sets of feature statistics, we choose the set whose maximum entropy distribution has the minimum entropy. Computational and inferential issues in both parts are addressed, in particular, a feature pursuit procedure is proposed for approximately selecting the optimal set of features. The model complexity is restricted because of the sample variation in the observed feature statistics. The minimax entropy principle is applied to texture modeling, where a novel Markov random field (MRF) model, called FRAME (Filter, Random field, And Minimax Entropy), is derived, and encouraging results are obtained in experiments on a variety of texture images. Relationship between our theory and the mechanisms of neural computation is also discussed.