By Topic

Exploring texture ensembles by efficient Markov chain Monte Carlo-Toward a “trichromacy” theory of texture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Song Chun Zhu ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; Liu, X.W. ; Ying Nian Wu

Presents a mathematical definition of texture, the Julesz ensemble Ω(h), which is the set of all images (defined on Z2) that share identical statistics h. Then texture modeling is posed as an inverse problem: Given a set of images sampled from an unknown Ω(h *), we search for the statistics h* which define the ensemble. A Ω(h) has an associated probability distribution q(I; h), which is uniform over the images in Ω(h) and has zero probability outside. The authors previously (1999) showed q(I; h) to be the limit distribution of the FRAME (filter, random field, and minimax entropy) model, as the image lattice Λ→Z2. This conclusion establishes the intrinsic link between the scientific definition of texture on Z2 and the mathematical models of texture on finite lattices. It brings two advantages: the practice of texture image synthesis by matching statistics is put on a mathematical foundation; and we need not learn the expensive FRAME model in feature pursuit, model selection and texture synthesis. An efficient Markov chain Monte Carte algorithm is proposed for sampling Julesz ensembles. It generates random texture images by moving along the directions of filter coefficients and, thus, extends the traditional single site Gibbs sampler. We compare four popular statistical measures in the literature, 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

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:22 ,  Issue: 6 )