On the use of relaxation labelling in the correspondence problem

Authors:
M.C Ibison;L Zapalowski
Affiliations:
Plessey Electronic Systems Research Ltd, Roke Manor, Romsey, Hants S05 0ZN, United Kingdom;Plessey Electronic Systems Research Ltd, Roke Manor, Romsey, Hants S05 0ZN, United Kingdom
Venue:
Pattern Recognition Letters
Year:
1986

Citing 2
Cited 0

Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.