Analysis of stochastic automata algorithm for relaxation labelling

1 May 1994

journal article
letter
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 16 (5) , 538-543
https://doi.org/10.1109/34.291442

Abstract

A parallel stochastic algorithm for relaxation labeling is analyzed. For the case of symmetric compatibility functions, it is Proved that the algorithm will always converge to a consistent labeling.

Keywords

This publication has 5 references indexed in Scilit:

Stochastic networks for constraint satisfaction and optimization
Sādhanā, 1990
Relaxation Labeling with Learning Automata
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
On the Foundations of Relaxation Labeling Processes
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
Cooperating processes for low-level vision: A survey
Artificial Intelligence, 1981
Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981