Multisite updating Markov chain Monte Carlo algorithm for morphologically constrained Gibbs random fields

Krishnamoorthy Sivakumar; John Ioannis Goutsias

doi:10.1117/12.323807

22 September 1998 Multisite updating Markov chain Monte Carlo algorithm for morphologically constrained Gibbs random fields

Krishnamoorthy Sivakumar, John Ioannis Goutsias

Author Affiliations +

Proceedings Volume 3459, Bayesian Inference for Inverse Problems; (1998) https://doi.org/10.1117/12.323807
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

Abstract

We study the problem of simulating a class of Gibbs random field models, called morphologically constrained Gibbs random fields, using Markov chain Monte Carlo sampling techniques. Traditional single site updating Markov chain Monte Carlo sampling algorithm, like the Metropolis algorithm, tend to converge extremely slowly when used to simulate these models, particularly at low temperatures and for constraints involving large geometrical shapes. Moreover, the morphologically constrained Gibbs random fields are not, in general, Markov. Hence, a Markov chain Monte Carlo sampling algorithm based on the Gibbs sampler is not possible. We prose a variant of the Metropolis algorithm that, at each iteration, allows multi-site updating and converges substantially faster than the traditional single- site updating algorithm. The set of sites that are updated at a particular iteration is specified in terms of a shape parameter and a size parameter. Computation of the acceptance probability involves a 'test ratio,' which requires computation of the ratio of the probabilities of the current and new realizations. Because of the special structure of our energy function, this computation can be done by means of a simple; local iterative procedure. Therefore lack of Markovianity does not impose any additional computational burden for model simulation. The proposed algorithm has been used to simulate a number of image texture models, both synthetic and natural.

Citation Download Citation

Krishnamoorthy Sivakumar and John Ioannis Goutsias "Multisite updating Markov chain Monte Carlo algorithm for morphologically constrained Gibbs random fields", Proc. SPIE 3459, Bayesian Inference for Inverse Problems, (22 September 1998); https://doi.org/10.1117/12.323807

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Monte Carlo methods

Computer simulations

Image analysis

Mathematical modeling

Image processing

Lithium

Image filtering

Show All Keywords

Keywords/Phrases

Search In:

Publication Years