On the Foundations of Relaxation Labeling Processes

A large class of problems can be formulated in terms of the assignment of labels to objects. Frequently, processes are needed which reduce ambiguity and noise, and select the best label among several possible choices. Relaxation labeling processes are just such a class of algorithms. They are based on the parallel use of local constraints between labels. This paper develops a theory to characterize the goal of relaxation labeling. The theory is founded on a definition of con-sistency in labelings, extending the notion of constraint satisfaction. In certain restricted circumstances, an explicit functional exists that can be maximized to guide the search for consistent labelings. This functional is used to derive a new relaxation labeling operator. When the restrictions are not satisfied, the theory relies on variational cal-culus. It is shown that the problem of finding consistent labelings is equivalent to solving a variational inequality. A procedure nearly identical to the relaxation operator derived under restricted circum-stances serves in the more general setting. Further, a local convergence result is established for this operator. The standard relaxation labeling formulas are shown to approximate our new operator, which leads us to conjecture that successful applications of the standard methods are explainable by the theory developed here. Observations about con-vergence and generalizations to higher order compatibility relations are described.

[1]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[2]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[3]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[4]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Azriel Rosenfeld,et al.  An Application of Relaxation Labeling to Line and Curve Enhancement , 1977, IEEE Transactions on Computers.

[6]  Geoffrey E. Hinton Relaxation and its role in vision , 1977 .

[7]  Edmond Schonberg,et al.  Programming by Refinement, as Exemplified by the SETL Representation Sublanguage , 1979, TOPL.

[8]  Shimon Ullman,et al.  Relaxation and constrained optimization by local processes , 1979 .

[9]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[10]  S. Ullman The interpretation of structure from motion , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[11]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[13]  Olivier D. Faugeras,et al.  Using Context in the Global Recognition of a Set of Objects: An Optimization Approach , 1980, IFIP Congress.

[14]  Olivier D. Faugeras,et al.  Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Azriel Rosenfeld,et al.  Cooperating Processes for Low-Level Vision: A Survey , 1981, Artif. Intell..

[16]  Laveen N. Kanal,et al.  Problem Reduction Representation for the Linguistic Analysis of Waveforms , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.