By Topic

A theoretical analysis of Monte Carlo algorithms for the simulation of Gibbs random field images

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

1 Author(s)
Goutsias, J.K. ; Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA

Various theoretical and computational issues about the algorithms' behavior are addressed. The concept of relative entropy is introduced as the primary analytical tool, and convergence of the simulation algorithms is discussed in terms of the relative entropy. This approach allows a view of the simulation of Gibbs random field images as a constrained, convex optimization problem, and it results in a systematic study of various Monte Carlo simulation algorithms under a common analytical framework. The problems of proper initialization, of maximizing the rate of convergence at each iteration, and of minimizing the rejection rate are discussed. A computational comparison of various Monte Carlo simulation algorithms is also presented

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )