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žené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on pattern analysis and machine intelligence Ročník 16; číslo 5; s. 538 - 543
Hlavní autori:	Sastry, P.S., Thathachar, M.A.L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Los Alamitos, CA IEEE 01.05.1994 IEEE Computer Society
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!