The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Minimax Entropy Principle and Its Application to Texture Modeling
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 given set of observed feature statistics, a distribution can be built to bind these feature statistics together by maximizing the entropy over all distributions that reproduce them. 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 minimax entropy principle is then corrected by considering the sample variation in the observed feature statistics, and an information criterion for feature pursuit is derived. 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. The relationship between our theory and the mechanisms of neural computation is also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Optimal approximations by piecewise smooth functions and associated variational problems
Mumford, D., & Shah, J. (1989) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160420503 · Cited by 5,208
Self-citationSpectral Analysis and Time Series
Preston, D. B. (1983) · Technometrics · doi:10.1080/00401706.1983.10487866 · Cited by 5,011
Daugman, J. G. (1985) · Journal of the Optical Society of America A · doi:10.1364/josaa.2.001160 · Cited by 3,219
Entropy-based algorithms for best basis selection
Coifman, R. R., & Wickerhauser, M. V. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119732 · Cited by 3,188
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
Markov Random Field Texture Models
Cross, G. R., & Jain, A. K. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767341 · Cited by 1,414
Shiftable multiscale transforms
Simoncelli, E. P., Freeman, W. T., Adelson, E. H., & Heeger, D. J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119725 · Cited by 1,333
Dayan, P., Hinton, G. E., Neal, R. M., & Zemel, R. S. (1995) · Neural Computation · doi:10.1162/neco.1995.7.5.889 · Cited by 1,207
What Is the Goal of Sensory Coding?
Field, D. J. (1994) · Neural Computation · doi:10.1162/neco.1994.6.4.559 · Cited by 1,183
Karni, A., & Sagi, D. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.11.4966 · Cited by 1,111
Pyramid-based texture analysis/synthesis
Heeger, D. J., & Bergen, J. R. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218446 · Cited by 1,095
On the computational architecture of the neocortex: II The role of cortico-cortical loops
Mumford, D. (1992) · Biological Cybernetics · doi:10.1007/bf00198477 · Cited by 1,074
Self-citationOn the computational architecture of the neocortex: I. The role of the thalamo-cortical loop
Mumford, D. (1991) · Biological Cybernetics · doi:10.1007/bf00202389 · Cited by 929
Self-citationJulesz, B. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057698 · Cited by 886
On entropy maximization principle
Akaike, H. (1977) · Medical Entomology and Zoology · Cited by 634
Fundamentals of statistical exponential families with applications in statistical decision theory
Brown, L. D. (1986) · SPIE eBooks · doi:10.1214/lnms/1215466757 · Cited by 573
Image Analysis, Random Fields and Dynamic Monte Carlo Methods
Winkler, G. (1995) · Springer eBooks · doi:10.1007/978-3-642-97522-6 · Cited by 515
Prior learning and Gibbs reaction-diffusion
Zhu, S. C., & Mumford, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.632983 · Cited by 319
Self-citationWitkin, A., & Kass, M. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122750 · Cited by 300
Efficiency of a model human image code
Watson, A. B. (1987) · Journal of the Optical Society of America A · doi:10.1364/josaa.4.002401 · Cited by 209
Barlow, H. B., Kaushal, T. P., & Mitchison, G. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.412 · Cited by 202
Witkin, A., & Kass, M. (1991) · ACM SIGGRAPH Computer Graphics · doi:10.1145/127719.122750 · Cited by 164
Spatial-frequency organization in primate striate cortex.
Silverman, M. S., Grosof, D. H., Valois, R. L. D., & Elfar, S. D. (1989) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.86.2.711 · Cited by 124
A society of models for video and image libraries
Picard, R. W. (1996) · IBM Systems Journal · doi:10.1147/sj.353.0292 · Cited by 96
FRAME: filters, random fields, and minimax entropy towards a unified theory for texture modeling
Zhu, S. C., Wu, Y., & Mumford, D. (1996) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1996.517147 · Cited by 38
Self-citation
Cited by
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
Torralba, A., Fergus, R., & Freeman, W. T. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.128 · Cited by 1,921
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
Portilla, J., & Simoncelli, E. P. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026553619983 · Cited by 1,806
“Another interesting concept used in a number of recent models is to adapt the basis to the statistical properties of each individual texture example (Bovik et al., 1992; Francos et al., 1993; Portilla et al., 1996; Zhu et al., 1997; Manduchi and Portilla, 1999).”
Object perception as Bayesian inference
Kersten, D., Mamassian, P., & Yuille, A. (2004) · Annual Review of Psychology · doi:10.1146/annurev.psych.55.090902.142005 · Cited by 1,269
“These hypotheses could predict incoming data through feedback and be tested by computing a di(cid:11)erence signal or residual at the earlier level (Mumford 1992, Rao & Ballard 1999).”
BackgroundMethodInfluentialNontexture Inpainting by Curvature-Driven Diffusions
Chan, T. F., & Shen, J. (2001) · Journal of Visual Communication and Image Representation · doi:10.1006/jvci.2001.0487 · Cited by 932
Doretto, G., Chiuso, A., Wu, Y. N., & Soatto, S. (2003) · International Journal of Computer Vision · doi:10.1023/a:1021669406132 · Cited by 885
Self-citation
Metadata
- Authors
- Zhu, S. C., Wu, Y. N., & Mumford, D.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 1997-11-01
- Volume
- 9
- Issue
- 8
- Pages
- 1627-1660
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2126174118
- Cited by
- 420
- References
- 33
- FWCI
- 17.47
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.