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

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on pattern analysis and machine intelligence Ročník 16; číslo 5; s. 538 - 543
Hlavní autoři: Sastry, P.S., Thathachar, M.A.L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Los Alamitos, CA IEEE 01.05.1994
IEEE Computer Society
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0162-8828
DOI:10.1109/34.291442