By Topic

Approximation of Conditional Density of Markov Random Field and its Application to Texture Synthesis

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
$33 $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

2 Author(s)
Arnab Sinha ; Dept. of Electrical Engineering, Indian Institute of Technology, kanpur, India, Email: ; Sumana Gupta

Markov random field (MRF) based sampling method is popular for synthesizing natural textures. The main drawback of the synthesis procedure is the large computational complexity involved. In this paper, we propose an approximation of the conditional density description for the reduction of computational complexity required in sampling texture pixels from the conditional density. Assuming, Y isin Lambda, and X isin Lambdad, we in this work studied the approximation of the conditional density function P(Y|X) as P(Y|thetast X), where thetas isin Rd, is a unit vector. We have also shown that the classical gradient based optimization method is not suitable for finding the solution of thetas. We have estimated thetas using genetic algorithm. The perceptual (visual) similarity and neighborhood similarity measures between the textures synthesized using the full conditional description and approximated description, are shown for validating the method developed.

Published in:

2007 IEEE International Conference on Image Processing  (Volume:3 )

Date of Conference:

Sept. 16 2007-Oct. 19 2007