Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence

Authors:
Steven W. Zucker;Yvan G. Leclerc;John L. Mohammed
Affiliations:
MEMBER, IEEE, Department of Electrical Engineering, Computer Vision and Graphics Laboratory, McGill University, Montreal, P.Q., Canada.;MEMBER, IEEE, Department of Electrical Engineering, Computer Vision and Graphics Laboratory, McGill University, Montreal, P.Q., Canada.;MEMBER, IEEE, Department of Electrical Engineering, Computer Vision and Graphics Laboratory, McGill University, Montreal, P.Q., Canada.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1981

Citing 0
Cited 3

Iterated tensor voting and curvature improvement

Signal Processing
On the use of relaxation labelling in the correspondence problem

Pattern Recognition Letters
The least-disturbance principle and weak constraints

Pattern Recognition Letters

Quantified Score

Hi-index	0.14

Visualization

Abstract

Relaxation labeling processes are a class of iterative algorithms for using contextual information to reduce local ambiguities. This paper introduces a new perspective toward relaxation-that of considering it as a process for reordering labels attached to nodes in a graph. This new perspective is used to establish the formal equivalence between relaxation and another widely used algorithm, local maxima selection. The equivalence specifies conditions under which a family of cooperative relaxation algorithms, which generalize the well-known ones, decompose into purely local ones. Since these conditions are also sufficient for guaranteeing the convergence of relaxation processes, they serve as stopping criteria. We feel that equivalences such as these are necessary for the proper application of relaxation and maxima selection in complex speech and vision understanding systems.