Analysis of Stochastic Automata Algorithm for Relaxation Labeling

Authors:
P. S. Sastry;M. A. L. Thathachar
Affiliations:
-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1994

Citing 3
Cited 1

Relaxation Labeling with Learning Automata

IEEE Transactions on Pattern Analysis and Machine Intelligence
Stable adaptive systems

Stable adaptive systems
Learning automata: an introduction

Learning automata: an introduction

Constraint satisfaction as global optimization

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.15

Visualization

Abstract

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.