The Community for Technology Leaders
Green Image
ABSTRACT
<p>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.</p>
INDEX TERMS
image processing; stochastic automata; parallel algorithms; stochastic automata algorithm; relaxation labelling; parallel stochastic algorithm; symmetric compatibility functions; consistent labeling
CITATION
P.S. Sastry, M.A.L. Thathachar, "Analysis of Stochastic Automata Algorithm for Relaxation Labeling", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 538-543, May 1994, doi:10.1109/34.291442
97 ms
(Ver 3.1 (10032016))