On the use of relaxation labelling in the correspondence problem

Through consideration of the constraints governing the correspondence problem, a new relaxation labelling scheme is proposed. Numerical examples are presented which illustrate the improved performance of the scheme.

[1]  Azriel Rosenfeld,et al.  Point pattern matching by relaxation , 1980, Pattern Recognit..

[2]  Steven W. Zucker,et al.  Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Hideo Ogawa.  Labeled point pattern matching by fuzzy relaxation , 1984, Pattern Recognit..

[4]  Michael A. Arbib,et al.  Computing the optic flow: The MATCH algorithm and prediction , 1983, Comput. Vis. Graph. Image Process..

[5]  A. Rosenfeld,et al.  Some Experiments in Point Pattern Matching , 1978 .

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

[7]  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.