Relaxation Labeling with Learning Automata

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-8, Issue 2, 1986, Pages 256-268

  Thathachar, Mandayam A L ^a   Sastry, P S ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Consistency; constraint satisfaction; learning automata; probabilistic relaxation; relaxation labeling

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; SYSTEMS SCIENCE AND CYBERNETICS - LEARNING SYSTEMS;

DOMAIN-SPECIFIC CONSTRAINTS; ITERATIVE LINEAR ALGORITHM; LEARNING AUTOMATA; RELAXATION LABELING;

AUTOMATA THEORY;

EID: 0022686265     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1986.4767779     Document Type: Article

References (23)

1. R. M. Haralick and L. G. Shapiro, “The consistent labeling problem: Part I,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 173–184, Apr. 1979.
2. A. Rosenfeld, R. A. Hammel, and S. W. Zucker, “Scene labeling by relaxation operations,” IEEE Trans. Syst., Man, Cybern., vol. SMC-6, pp. 420–433, June 1976.
3. R. A. Hummel and S. W. Zucker, “On the foundations of relaxation labeling processes,” IEEE Trans. Pattern. Anal. Machine Intell., vol. PAMI-5, p. 267–286, May 1983.
4. S. Peleg, “A new probabilistic relaxation scheme,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, pp. 362–369, July 1980.
5. O. D. Faugeras and M. Berthod, “Improving consistency and reducing ambiguity in stochastic labeling: An optimization approach,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, p. 412–423, July 1981.
6. K. S. Narendra and M. A. L. Thathachar, “Learning automata: A survey,” IEEE Trans. Syst., Man, Cybern., vol. SMC-4, pp. 323–334, July 1974.
7. M. O. Rabin, “Probabilistic algorithms,” in Algorithms and Complexity: New Directions and Recent Trends, J. F. Traub, Ed. New York: Academic, 1976.
8. L. Davis and A. Rosenfeld, “Cooperating processing for low-level vision: A survey,” Artificial Intell., vol. 17, pp. 245–263, Aug. 1981.
9. S. Peleg, “Ambiguity reduction in hand writing with ambiguous segmentation and uncertain interpretation,” Comput. Graphics Image Processing, vol. 10, pp. 235–245, July 1979.
10. D. P. O'Leary and S. Peleg, “Analysis of relaxation processes: The two-node-two-label case,” IEEE Trans. Syst., Man, Cybern., vol. SMC-13, pp. 618–623, July 1983.
11. M. L. Tsetlin, “On the behaviour of finite automata in random media,” Automat. Telemek., vol. 22, pp. 1345–1354, Oct. 1961.
12. S. Lakshimivarahan, Learning Algorithms: Theory and Practice. Berlin, Germany: Springer-Verlag, 1981.
13. P. R. Srikantakumar, “Learning models and adaptive routing in communication networks,” Ph.D. dissertation, Yale Univ., New Haven, CT, 1980.
14. H. J. Kushner, Approximation and Weak Convergence Methods for Random Processes. Cambridge, MA: MIT Press, 1984.
15. H. J. Kushner and A. Schwartz, “An invariant measure approach to the study of stochastic approximations with state-dependent noise,” SIAMJ. Contr. Optimization, vol. 22, 13–27, Jan. 1984.
16. 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. PAMI-3, pp. 17–126, Mar. 1981.
17. H. J. Kushner, Introduction to Stochastic Control. New York: Holt, 1971.
18. S. Lakshmivarahan and M. A. L. Thathachar, “Absolutely expedient learning algorithms for stochastic automata,” IEEE Trans. Syst., Man, Cybern., vol. SMC-3, pp. 281–286, May 1973.
19. M. A. L. Thathachar and P. S. Sastry, “A new approach to the design of reinforcement schemes for learning automata,” IEEE Trans. Syst., Man, Cybern., vol. SMC-15, pp. 168–175, Jan. 1985.
20. P. Mars and W. J. Poppelbaum, Stochastic and Deterministic Averaging Processors. London, England: Institution of Electrical Engineers, 1981.
21. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 721–741, Nov. 1984.
22. M. A. L. Thathachar and P. S. Sastry, “Some probabilistic algorithms for the consistent labeling problem,” Dep. Elec. Eng., Indian Institute of Science, Bangalore, India, Rep. EE163, Oct. 1984.
23. P.S. Sastry, “Systems of learning automata: Estimator algorithms and applications,” Ph.D. dissertation, Dep. Elec. Eng., Indian Institute of Science, Bangalore, India, June 1985.