Stationary Markov Random Fields on a Finite Rectangular Lattice
نویسندگان
چکیده
This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborhood system. Equivalently, it characterizes stationary Markov fields on 2 whose restrictions to finite rectangular subsets are still Markovian (i.e., even on the boundaries). Until now, Pickard random fields formed the only known class of such fields. First, we derive a necessary and sufficient condition for Markov random fields on a finite lattice to be stationary. It is shown that their joint distribution factors in terms of the marginal distribution on a generic (2 2) cell which must fulfill some consistency constraints. Second, we solve the consistency constraints and provide a complete characterization of such measures in three cases. Symmetric measures and Gaussian measures are shown to necessarily belong to the Pickard class, whereas binary measures belong either to the Pickard class, or to a new nontrivial class which is further studied. In particular, the corresponding fields admit a simple parameterization and may be simulated in a simple, although nonunilateral manner.
منابع مشابه
Hidden Markov Random Fields
A noninvertible function of a first order Markov process, or of a nearestneighbor Markov random field, is called a hidden Markov model. Hidden Markov models are generally not Markovian. In fact, they may have complex and long range interactions, which is largely the reason for their utility. Applications include signal and image processing, speech recognition, and biological modeling. We show t...
متن کاملA Fast and Exact Simulation Algorithm for General Gaussian Markov Random Fields
This paper presents a fast and exact simulation algorithm for a general Gaussian Markov Random Field (GMRF) defined on a lattice, . For a neighborhood, the algorithm has initializationcost of flops and exact samples are then available using flops. Conditioned samples on general constraints costs only extra flops. The algorithm is easy to generalize to non-rectangular lattices, compute the log-l...
متن کاملNorges Teknisk-naturvitenskapelige Universitet Fitting Gaussian Markov Random Fields to Gaussian Fields Fitting Gaussian Markov Random Fields to Gaussian Fields Tmr Project on Spatial Statistics (erb-fmrx-ct960095) for Support and Inspiration
SUMMARY This paper discusses the following task often encountered building Bayesian spatial models: construct a homogeneous Gaussian Markov random field (GMRF) on a lattice with correlation properties either as present in observed data or consistent with prior knowledge. The Markov property is essential in design of computational efficient Markov chain Monte Carlo algorithms used to analyse suc...
متن کاملFinite-size scaling analysis of percolation in three-dimensional correlated binary Markov chain random fields.
Percolation and finite-size scaling properties in three-dimensional binary correlated Markov-chain random fields on a cubic lattice are computed by extensive Monte Carlo simulation. At short correlation scales, the percolation threshold in correlated random fields decreases as the correlation scale increases. The rate of decrease rapidly diminishes for correlation lengths larger than 2-3 lattic...
متن کاملA Markov Random Field Approach for Microstructure Synthesis
We test the notion that many microstructures have an underlying stationary probability distribution. The stationary probability distribution is ubiquitous: we know that different windows taken from a polycrystalline microstructure generally ‘look alike’. To enable computation of such a probability distribution, we represented microstructures in the form of undirected probabilistic graphs called...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998