Efficient and Scalable Approach to Equilibrium Conditional Simulation of Gibbs Markov Random Fields

We study the performance of an automated hybrid Monte Carlo (HMC) approach for conditional simulation of a recently proposed, single-parameter Gibbs Markov random field (Gibbs MRF). The MRF is based on a modified version of the planar rotator (MPR) model and is used for efficient gap filling in gridded data. HMC combines the deterministic over-relaxation method and the stochastic Metropolis update with dynamically adjusted restriction and performs automatic detection of the crossover to the targeted equilibrium state. We focus on the ability of the algorithm to efficiently drive the system to equilibrium at very low temperatures even with sparse conditioning data. These conditions are the most challenging computationally, requiring extremely long relaxation times if simulated by means of the standard Metropolis algorithm. We demonstrate that HMC has considerable benefits in terms of both computational efficiency and prediction performance of the MPR method.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  J. Inoue,et al.  Multistate image restoration by transmission of bit-decomposed data. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  H. Nishimori,et al.  Statistical mechanics of image restoration and error-correcting codes. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  H. Nishimori,et al.  Statistical Mechanics of Image Restoration by the Plane Rotator Model , 2002 .

[5]  Creutz,et al.  Overrelaxation and Monte Carlo simulation. , 1987, Physical review. D, Particles and fields.

[6]  A. Gelfand,et al.  Handbook of spatial statistics , 2010 .