A continuous relaxation labeling algorithm for Markov random fields

This publication has 17 references indexed in Scilit:

• A parallel image segmentation algorithm using relaxation with varying neighborhoods and its mapping to array processors
  Computer Vision, Graphics, and Image Processing, 1987
• Simple Parallel Hierarchical and Relaxation Algorithms for Segmenting Noncausal Markovian Random Fields
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987
• Bayes Smoothing Algorithms for Segmentation of Binary Images Modeled by Markov Random Fields
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
• On the Foundations of Relaxation Labeling Processes
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 1983
• The relationship between image restoration by the maximum a posteriori method and a maximum entropy method
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
• Markov Random Fields and Their Applications
  1980
• Relaxation Processes for Scene Labeling: Convergence, Speed, and Stability
  IEEE Transactions on Systems, Man, and Cybernetics, 1978
• Approximating discrete probability distributions
  IEEE Transactions on Information Theory, 1969
• Contingency tables with given marginals
  Biometrika, 1968
• Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
  The Annals of Mathematical Statistics, 1963