Optimisation Algorithms in Probabilistic Relaxation Labelling

  • John Illingworth
  • Josef Kittler
Part of the NATO ASI Series book series (volume 30)


The use of optimisation approaches for relaxation labelling is reviewed and its relationship to earlier heuristic schemes is considered. The fixed points of optimisation schemes are determined by the constraint relationships and for simple examples can be predicted. Optimisation techniques ensure faster convergence of the relaxation process and can incorporate a wider class of constraints than the heuristic methods. These properties are illustrated using simple “toy” problems.


Descent Direction Steep Descent Method Labelling Problem Probability Component Optimal Step Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Elfving T. and Eklundh J.O., “Some properties of stochastic labeling procedures”, Computer Graphics and Image Processing, Vol 20, pp 158–170 (1982)MATHCrossRefGoogle Scholar
  2. [2]
    Faugeras O.D. and Berthod M., “Improving consistency and reducing ambiguity in stochastic labeling: an optimisation approach”, IEEE PAMI-3, No 4, pp 412–424 (1981)CrossRefGoogle Scholar
  3. [3]
    Haralick R.M., Mohammed J.L. and Zucker S.L.W., “Compatibilities and the fixed points of arithmetic relaxation processes”, Computer Graphics and Image Processing, Vol 13, pp 242–256 (1980)CrossRefGoogle Scholar
  4. [4]
    Hummel R.A. and Zucker S.L.W., “On the foundations of relaxation labelling processes”, IEEE PAMI-5, No 3, pp 267–287 (1983)CrossRefGoogle Scholar
  5. [5]
    Kittler J. and Hancock E.R., “A contextual decision rule based on triplets of object-labels”, Alvey Vision Club Conference, Bristol, U.K. September 1986.Google Scholar
  6. [6]
    Lloyd S.L., “An optimisation approach to relaxation labelling algorithms”, Image and Vision Computing, Vol 1, No 2, pp 85–91 (1983)CrossRefGoogle Scholar
  7. [7]
    O’Leary D.P. and Peleg S., “Analysis of relaxation processes: the two node — two label case”, IEEE SMC-13, No 4, pp 618–623 (1983)Google Scholar
  8. [8]
    Rosenfeld A., Hummel R.A. and Zucker S.W., “Scene labelling by relaxation operations”, IEEE SMC-6, No 6, pp 420–433 (1976)MathSciNetMATHGoogle Scholar
  9. [9]
    Ostrowski, Solutions of Equations and Systems of Equations, Academic Press, New YorkGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • John Illingworth
    • 1
  • Josef Kittler
    • 2
  1. 1.Rutherford Appleton Laboratory ChiltonSERCChilton, Didcot, OxonUK
  2. 2.Department of Electronic and Electrical EngineeringUniversity of SurreyGuildfordUK

Personalised recommendations