An edge-based trinocular stereovision algorithm is presented. The primitives it works on are cubic B-spline approximations of the 2-D edges. This allows one to deal conveniently with curvature and to extend to some nonpolyhedral scenes to previous stereo algorithms. To build a matching primitive, the principle of the algorithm is, first, to find a triplet of corresponding points on three splines. This is provided by the bootstrapping part. Second, the algorithm propagates along the three supporting splines to find other matching points. This provides a set of ordered point triplets along these three splines, for which all the matching constraints are verified. This primitive constitutes a trinocular hypothesis. The set of all hypotheses is obtained by propagating from all the point triplets provided by the bootstrapping process. A criterion based on the size of the hypotheses is then used to choose among them a compatible set with respect to the uniqueness constraint. Results of several 3-D reconstructed scenes are shown.<<ETX>>
[1]
J P Frisby,et al.
PMF: A Stereo Correspondence Algorithm Using a Disparity Gradient Limit
,
1985,
Perception.
[2]
Michael Brady,et al.
Stereo matching of curves
,
1990,
Image Vis. Comput..
[3]
J J Koenderink,et al.
What Does the Occluding Contour Tell Us about Solid Shape?
,
1984,
Perception.
[4]
Régis Vaillant.
Using Occluding Contours for 3D Object Modeling
,
1990,
ECCV.
[5]
Takeo Kanade,et al.
Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming
,
1985,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6]
Trevor J. Hastie,et al.
3-D curve matching using splines
,
1990,
J. Field Robotics.
[7]
G. Medioni,et al.
Corner detection and curve representation using cubic B-splines
,
1986,
Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[8]
Yoshifumi Kitamura,et al.
Three-dimensional data acquisition by trinocular vision
,
1989,
Adv. Robotics.