Analysis of stochastic automata algorithm for relaxation labelling
P. SESHADRI SASTRY, M.A.L. Thathachar · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1994
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.>