Deterministic pseudo-annealing: Optimization in Markov-Random-Fields an application to pixel classification

  • Marc Berthod
  • Gérard Giraudon
  • Jean Paul Stromboni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 588)


We present in this paper a new deterministic and massively parallel algorithm for combinatorial optimization in a Markov Random Field. This algorithm is an extension of previous relaxation labeling by optimization algorithms. First, the a posteriori probability of a tentative labeling, defined in terms of a Markov Random Field is generalized to continuous labelings. This merit function of probabilistic vectors is then convexified by changing its domain. Global optimization is performed, and the maximum is tracked down while the original domain is restaured. On an application to contextual pixel quantization, it compares favorably to recent stochastic (simulated annealing) or deterministic (graduated non-convexity) methods popularized for low-level vision.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Berthod. Definition of a consistent labeling as a global extremum. In Proceedings ICPR6, Munich, pages 339–341, 1982.Google Scholar
  2. 2.
    J. Besag. On the statistical analysis of ditty pictures. Jl. Roy. Statis. Soc. B., 1986.Google Scholar
  3. 3.
    A. Blake. Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1:2–12, 1989.Google Scholar
  4. 4.
    H. Derin, H. E. R. Cristi, and D. Geman. Bayes smoothing algorithms for segmentation of binary images modeled by markov random fields. IEEE trans. on Pattern analysis and mach. intel., Vol 6, 1984.Google Scholar
  5. 5.
    O. Faugeras and M. Berthod. Improving consistency and reducing ambiguity in stochastic labeling: an optimization approach. IEEE Trans. on Pattern Analysis and Machine Intelligence, 3(4):412–423, 1981.Google Scholar
  6. 6.
    S. Geman and D. Geman. Stochastic relaxation, gibbs distributions and the bayesian restoration of images. IEEE Trans. on Pattern Analysis and Machine Intelligence, 6:721–741, 1984.Google Scholar
  7. 7.
    P. S. Marc, J. Chen, and G. Medioni. Adaptive smoothing: A general tool for early vision. IEEE Trans. on Pattern Analysis and Machine Intelligence, 13(6):514–529, 1991.Google Scholar
  8. 8.
    J. Zerubia and R. Chellappa. Mean field approximation using compound gauss-markov random field for edge detection and image restoration. Proc. ICASSP, Albuquerque, USA, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Marc Berthod
    • 1
  • Gérard Giraudon
    • 1
  • Jean Paul Stromboni
    • 2
  1. 1.INRIA, Sophia-AntipolisValbonne
  2. 2.Laboratoire Signaux et Systèmes, URA 1376 CNRSUniversité de Nice Sophia-AntipolisNiceFrance

Personalised recommendations