This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of Stochastic Automata Algorithm for Relaxation Labeling
May 1994 (vol. 16 no. 5)
pp. 538-543

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.

[1] M. A. L. Thathachar and P. S. Sastry, "Relaxation labeling with learning automata,"IEEE Trans. Pattern Anal. Machine Intell., vol. 8, pp. 256-268, Mar. 1986.
[2] L. S. Davis and A. Rosenfeld, "Cooperative processes in low level vision: A survey,"Artificial Intell., vol. 17, pp. 245-265, Aug. 1981.
[3] R. A. Hummel and S. W. Zucker, "On the foundations of relaxation labeling processes,"IEEE Trans. Pattern Anal. Machine Intell., vol. 5, pp. 267-287, May 1983.
[4] S. W. Zucker, Y. G. LeClerc, and J. L. Mohammed, "Continuous relaxation and local maxima selection: Conditions for equivalence,"IEEE Trans. Pattern Anal. Machine Intell., vol. 3, no. 2, pp. 117-126, Feb. 1981.
[5] S. Banejee,Stochastic Relaxation Paradigms for Low Level Vision. Ph.D. thesis, Dept. of Elect. Eng., Indian Inst. of Sci., Bangalore, India, 1989.
[6] W. Jianhua,The Theory of Games. Oxford: Clarendon Press, 1988.
[7] T. Basar and G. J. Olsder,Dynamic Noncooperative Game Theory. New York: Academic Press, 1982.
[8] K. S. Narendra,Learning Automata: An Introduction. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[9] P. S. Sastry, "Stochastic networks for constraint satisfaction and optimization,"Sadhana, vol. 15, pp. 251-262, Dec. 1990.
[10] H. J. Kushner,Approximation and Weak Convergence Methods for Random Processes. Cambridge, MA: MIT Press, 1984.
[11] K.S. Narendra and A.M. Annaswamy,Stable Adaptive Systems. Englewood Cliffs, NJ: Prentice Hall, 1989.

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 and Machine Intelligence, vol. 16, no. 5, pp. 538-543, May 1994, doi:10.1109/34.291442
Usage of this product signifies your acceptance of the Terms of Use.