Title :
Analysis of stochastic automata algorithm for relaxation labelling
Author :
Sastry, P.S. ; Thathachar, M. A L
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India
fDate :
5/1/1994 12:00:00 AM
Abstract :
A parallel stochastic algorithm for relaxation labeling is analyzed. For the case of symmetric compatibility functions, it is proved that time algorithm will always converge to a consistent labeling
Keywords :
image processing; parallel algorithms; stochastic automata; consistent labeling; parallel stochastic algorithm; relaxation labelling; stochastic automata algorithm; symmetric compatibility functions; Algorithm design and analysis; Computer vision; Convergence; Image converters; Iterative algorithms; Labeling; Learning automata; Machine intelligence; Stochastic processes;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
