The calculation of shape from stereo requires matching of points from the left image with points from the right image. Many classes of stereo-matching algorithms have been proposed [1}3] with di!erences in the type of tokens they match and the optimisation method and the constraints they use. They are mainly categorised as area-based or feature-based. Feature-based methods can be either low level, which try to match individual edgels or high level, which try to match edge structures, such as lines or curves. While high-level methods enable comparisons of more complex features and incorporate naturally the "gural continuity (FC) [1,4] constraint, they can su!er from problems of imprecise disparity estimation as well as fragmentation and fragility [3]. In this work we present a novel low-level edge-based algorithm. Its main advantages are explicit optimisation of the FC across bands of epipolars, elimination of the ordering constraint (OC) and highly parallel distributed execution. Each epipolar is searched in parallel for a high con"dence intra-row matching decision (at the local level). Simultaneously, temporary matching information is propagated to the adjoining epipolars for minimisation of FC violations (at the global level).
[1]
Graeme A. Jones,et al.
Constraint, Optimization, and Hierarchy: Reviewing Stereoscopic Correspondence of Complex Features
,
1997,
Comput. Vis. Image Underst..
[2]
B. Ripley,et al.
Pattern Recognition
,
1968,
Nature.
[3]
Jake K. Aggarwal,et al.
Structure from stereo-a review
,
1989,
IEEE Trans. Syst. Man Cybern..
[4]
Ramakant Nevatia,et al.
Stereo Error Detection, Correction, and Evaluation
,
1989,
IEEE Trans. Pattern Anal. Mach. Intell..
[5]
Kenneth A. De Jong,et al.
A Cooperative Coevolutionary Approach to Function Optimization
,
1994,
PPSN.
[6]
T. Ozanian.
Approaches for Stereo Matching
,
1995
.