Continuous relaxation and local maxima selection: conditions for equivalence
Related Experiment Video
Updated: May 29, 2026

Mechanical Control of Relaxation Using Intact Cardiac Trabeculae
Published on: February 17, 2023
S W Zucker1, Y G Leclerc, J L Mohammed
1MEMBER, IEEE, Department of Electrical Engineering, Computer Vision and Graphics Laboratory, McGill University, Montreal, P.Q., Canada.
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.
More Related Videos
Related Concept Videos
Conditions of Equilibrium
Internal forces are not considered for conditions of equilibrium because they occur in equal and opposite pairs within the body, effectively canceling each other. As a result,...
Solution Equilibrium and Saturation
Absolute and Local Extreme Values
State Function, Exact and Inexact Differentials
Relaxation of Skeletal Muscles
When an action potential reaches the axon terminal, it depolarizes the membrane and opens voltage-gated sodium channels. Sodium ions enter the cell, further depolarizing the presynaptic membrane. This depolarization causes voltage-gated calcium channels to open.
The Response of Equilibria to the Conditions

