Analysis of stochastic automata algorithm for relaxation labelling

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.< >

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence Vol. 16; no. 5; pp. 538 - 543
Main Authors: Sastry, P.S., Thathachar, M.A.L.
Format: Journal Article
Language:English
Published: Los Alamitos, CA IEEE 01.05.1994
IEEE Computer Society
Subjects:
Algorithm design and analysis
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Computer vision
Convergence
Exact sciences and technology
Image converters
Iterative algorithms
Labeling
Learning automata
Machine intelligence
Pattern recognition. Digital image processing. Computational geometry
Stochastic processes
Learning
Relaxation
Computer vision
Parallel algorithm
Learning automata
Constraint satisfaction
Stochastic algorithm
ISSN:0162-8828
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0162-8828
DOI:10.1109/34.291442