By Topic

Simulated annealing in compound Gaussian random fields [image processing]

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

2 Author(s)
Fure-Chinq Jeng ; Bell Commun. Res., Morristown, NJ, USA ; Woods, J.W.

Recently, a stochastic relaxation technique called simulated annealing has been developed to search for a globally optimal solution in image estimation and restoration problems. The convergence of simulated annealing has been proved only for random fields with a compact range space. Because of this, images were modeled as random fields with bounded discrete or continuous values. However, in most image processing problems, it is more natural to model the image as a random field with values in a noncompact space, e.g. conditional Gaussian models. The proof of convergence of the stochastic relaxation method is extended to a class of compound Gauss-Markov random fields. Simulation results are provided to show the power of these methods

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 1 )