Analysis of Stochastic Automata Algorithm for Relaxation Labelling

Sastry, PS and Thathachar, MAL (1994) Analysis of Stochastic Automata Algorithm for Relaxation Labelling. In: IEEE Transactions on Pattern Analysis and Machine Intelligence, 16 (5). pp. 538-543.

Preview

PDF anaysis_of.pdf Download (574kB)

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

Item Type:	Journal Article
Publication:	IEEE Transactions on Pattern Analysis and Machine Intelligence
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Relaxation labeling;Learning automata;Constraint satisfaction.
Department/Centre:	Division of Electrical Sciences > Electrical Engineering
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:27
URI:	http://eprints.iisc.ac.in/id/eprint/6986

Actions (login required)

View Item