Exploring texture ensembles by efficient Markov chain Monte Carlo-Toward a "trichromacy" theory of texture
- 1 June 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 22 (6) , 554-569
- https://doi.org/10.1109/34.862195
Abstract
This article presents a mathematical definition of texture驴the Julesz ensemble$\Omega({\bf{h}})$, which is the set of all images (defined on ${\rm{Z}}^2$) that share identical statistics ${\bf{h}}$. Then texture modeling is posed as an inverse problem: Given a set of images sampled from an unknown Julesz ensemble $\Omega({\bf{h}}_\ast)$, we search for the statistics ${\bf{h}}_\ast$ which define the ensemble. A Julesz ensemble $\Omega({\bf{h}})$ has an associated probability distribution $q({\rm{\bf{I}}}; {\bf{h}})$, which is uniform over the images in the ensemble and has zero probability outside. In a companion paper [33], $q({\rm{\bf{I}}}; {\bf{h}})$ is shown to be the limit distribution of the FRAME (Filter, Random Field, And Minimax Entropy) model [36], as the image lattice $\Lambda \rightarrow {\rm{Z}}^2$. This conclusion establishes the intrinsic link between the scientific definition of texture on ${\rm{Z}}^2$ and the mathematical models of texture on finite lattices. It brings two advantages to computer vision: 1) The engineering practice of synthesizing texture images by matching statistics has been put on a mathematical foundation. 2) We are released from the burden of learning the expensive FRAME model in feature pursuit, model selection and texture synthesis. In this paper, an efficient Markov chain Monte Carlo algorithm is proposed for sampling Julesz ensembles. The algorithm generates random texture images by moving along the directions of filter coefficients and, thus, extends the traditional single site Gibbs sampler. We also compare four popular statistical measures in the literature, namely, moments, rectified functions, marginal histograms, and joint histograms of linear filter responses in terms of their descriptive abilities. Our experiments suggest that a small number of bins in marginal histograms are sufficient for capturing a variety of texture patterns. We illustrate our theory and algorithm by successfully synthesizing a number of natural textures.
Keywords
This publication has 21 references indexed in Scilit:
- Markov/Gibbs texture modeling: aura matrices and temperature effectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generalised Gibbs sampler and multigrid Monte Carlo for Bayesian computationBiometrika, 2000
- Parameter Expansion for Data AugmentationJournal of the American Statistical Association, 1999
- Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture ModelingInternational Journal of Computer Vision, 1998
- Cluster-based probability model and its application to image and texture processingIEEE Transactions on Image Processing, 1997
- Where practice makes perfect in texture discrimination: evidence for primary visual cortex plasticity.Proceedings of the National Academy of Sciences, 1991
- Features and Objects in Visual ProcessingScientific American, 1986
- Markov Random Field Texture ModelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- On perceptual analyzers underlying visual texture discrimination: Part IIBiological Cybernetics, 1978
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951