Sastry, P. S. ; Thathachar, M. A. L. (1994) Analysis of stochastic automata algorithm for relaxation labelling IEEE Transactions on Pattern Analysis and Machine Intelligence, 16 (5). pp. 538-543. ISSN 0162-8828
Full text not available from this repository.
Official URL: http://portal.acm.org/citation.cfm?id=628605
Related URL: http://dx.doi.org/10.1109/34.291442
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: | Article |
|---|---|
| Source: | Copyright of this article belongs to IEEE. |
| ID Code: | 51334 |
| Deposited On: | 28 Jul 2011 15:01 |
| Last Modified: | 28 Jul 2011 15:01 |
Repository Staff Only: item control page
