ISSN:
1573-7683
Schlagwort(e):
relaxation labeling processes
;
consistency
;
growth transformations
;
Liapunov functions
;
stability
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract We present some new results which definitively explain thebehavior of the classical, heuristic nonlinear relaxation labelingalgorithm of Rosenfeld, Hummel, and Zucker in terms of theHummel-Zucker consistency theory and dynamical systems theory. Inparticular, it is shown that, when a certain symmetry condition is met,the algorithm possesses a Liapunov function which turns out to be (thenegative of) a well-known consistency measure. This follows almostimmediately from a powerful result of Baum and Eagon developed in thecontext of Markov chain theory. Moreover, it is seen that most of theessential dynamical properties of the algorithm are retained when thesymmetry restriction is relaxed. These properties are also shown tonaturally generalize to higher-order relaxation schemes. Someapplications and implications of the presented results are finallyoutlined.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1023/A:1008255111261
Permalink
