A continuous relaxation labeling algorithm for Markov random fields

A probabilistic relaxation algorithm is described for labeling the vertices of a Markov random field (MRF) defined on a finite graph. The algorithm has two features which make it attractive. First, the multilinear structure of the relaxation operator allows simple, necessary, and sufficient convergence conditions to be derived. The second advantage is local optimality. Given a class of MRFs indexed by a parameter c, such that when c=0 the vertices are independent, it is shown that the estimates of the a posteriori probabilities generated by the algorithm differ from the true values by terms that are at least second order in c. >

[1]  Robert M. Haralick,et al.  Decision Making in Context , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Steven W. Zucker,et al.  On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  S. Kullback,et al.  Contingency tables with given marginals. , 1968, Biometrika.

[4]  Chee Sun Won,et al.  A parallel image segmentation algorithm using relaxation with varying neighborhoods and its mapping to array processors , 1987, Computer Vision Graphics and Image Processing.

[5]  David B. Cooper,et al.  Simple Parallel Hierarchical and Relaxation Algorithms for Segmenting Noncausal Markovian Random Fields , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Josef Kittler,et al.  Contextual classification of multispectral pixel data , 1984, Image Vis. Comput..

[7]  H. Trussell.  The relationship between image restoration by the maximum a posteriori method and a maximum entropy method , 1980 .

[8]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[12]  Solomon Kullback,et al.  Approximating discrete probability distributions , 1969, IEEE Trans. Inf. Theory.

[13]  I. Good.  Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables , 1963 .

[14]  Donald Geman,et al.  Bayes smoothing algorithms for segmentation of images modeled by Markov random fields , 1984, ICASSP.

[15]  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.

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