Issue No. 05 - May (1994 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.291442
<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>
image processing; stochastic automata; parallel algorithms; stochastic automata algorithm; relaxation labelling; parallel stochastic algorithm; symmetric compatibility functions; consistent labeling
P. Sastry and M. Thathachar, "Analysis of Stochastic Automata Algorithm for Relaxation Labeling," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 538-543, 1994.