Stationary Markov Random Fields on a Finite Rectangular Lattice

This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (non-toroidal) lattice in the basic case of a second-order neighborhood system. Equivalently, it characterizes stationary Markov fields on Z/sup 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/spl times/2) cell which must fulfil 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.

[1]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

[2]  H. Derin,et al.  Discrete-index Markov-type random processes , 1989, Proc. IEEE.

[3]  Donald Geman,et al.  Bayes Smoothing Algorithms for Segmentation of Binary Images Modeled by Markov Random Fields , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[5]  Yves Goussard,et al.  Markov modeling for Bayesian restoration of two-dimensional layered structures , 1993, IEEE Trans. Inf. Theory.

[6]  J. Besag Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[7]  D. M. Titterington,et al.  An Empirical Study of the Simulation of Various Models used for Images , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  D. Geman Random fields and inverse problems in imaging , 1990 .

[9]  W. Qian,et al.  Parameter estimation for hidden Gibbs chains , 1990 .

[10]  Patrick Pérez,et al.  Restriction of a Markov random field on a graph and multiresolution statistical image modeling , 1996, IEEE Trans. Inf. Theory.

[11]  D. K. Pickard A curious binary lattice process , 1977, Journal of Applied Probability.

[12]  Devijver,et al.  1 - Champs aléatoires de Pickard et modélisation d'images digitales , 1988 .

[13]  D. Politis Markov Chains in Many Dimensions , 1994, Advances in Applied Probability.

[14]  John K. Goutsias,et al.  Mutually compatible Gibbs random fields , 1989, IEEE Trans. Inf. Theory.

[15]  D. K. Pickard,et al.  Unilateral Gaussian fields , 1992, Advances in Applied Probability.

[16]  John K. Goutsias Unilateral approximation of Gibbs random field images , 1991, CVGIP Graph. Model. Image Process..

[17]  Gerasimos Potamianos,et al.  Stochastic approximation algorithms for partition function estimation of Gibbs random fields , 1997, IEEE Trans. Inf. Theory.

[18]  P. L. Dobruschin The Description of a Random Field by Means of Conditional Probabilities and Conditions of Its Regularity , 1968 .

[19]  Josiane Zerubia,et al.  Fully Bayesian image segmentation-an engineering perspective , 1997, Proceedings of International Conference on Image Processing.

[20]  John W. Woods,et al.  Compound Gauss-Markov random fields for image estimation , 1991, IEEE Trans. Signal Process..

[21]  J. Besag On the Statistical Analysis of Dirty Pictures , 1986 .

[22]  D. K. Pickard,et al.  Unilateral Markov fields , 1980, Advances in Applied Probability.

[23]  D. K. Pickard Inference for Discrete Markov Fields: The Simplest Nontrivial Case , 1987 .