A Computational Framework for Determining Stereo Correspondence from a Set of Linear Spatial Filters

We present a computational framework for stereopsis based on the outputs of linear spatial filters tuned to a range of orientations and scales. This approach goes beyond edge-based and area-based approaches by using a richer image description and incorporating several stereo cues that previously have been neglected in the computer vision literature. A technique based on using the pseudo-inverse is presented for characterizing the information present in a vector of filter responses. We show how in our framework viewing geometry can be recovered to determine the locations of epipolar lines. An assumption that visible surfaces in the scene are piecewise smooth leads to differential treatment of image regions corresponding to binocularly visible surfaces, surface boundaries, and occluded regions that are only monocularly visible. The constraints imposed by viewing geometry and piecewise smoothness are incorporated into an iterative algorithm that gives good results on random-dot stereograms, artificially generated scenes, and natural grey-level images.

[1]  Marsha Jo Hannah,et al.  Computer matching of areas in stereo images. , 1974 .

[2]  Donald B. Gennery,et al.  A Stereo Vision System for an Autonomous Vehicle , 1977, IJCAI.

[3]  Hans P. Moravec Towards Automatic Visual Obstacle Avoidance , 1977, IJCAI.

[4]  Tomaso Poggio,et al.  A Theory of Human Stereo Vision , 1977 .

[5]  William B. Thompson,et al.  TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2009 .

[6]  T. O. Binford,et al.  Geometric Constraints In Stereo Vision , 1980, Optics & Photonics.

[7]  B. Julesz,et al.  A disparity gradient limit for binocular fusion. , 1980, Science.

[8]  Thomas O. Binford,et al.  Depth from Edge and Intensity Based Stereo , 1981, IJCAI.

[9]  W. Eric L. Grimson,et al.  From images to surfaces , 1981 .

[10]  J Mayhew,et al.  The Interpretation of Stereo-Disparity Information: The Computation of Surface Orientation and Depth , 1982, Perception.

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  B. Gillam,et al.  The induced effect, vertical disparity, and stereoscopic theory , 1983, Perception & psychophysics.

[13]  Michael Kass,et al.  Computing Visual Correspondence , 1983 .

[14]  J P Frisby,et al.  PMF: A Stereo Correspondence Algorithm Using a Disparity Gradient Limit , 1985, Perception.

[15]  Ramakant Nevatia,et al.  Segment-based stereo matching , 1985, Comput. Vis. Graph. Image Process..

[16]  Olivier D. Faugeras,et al.  Motion from point matches: multiplicity of solutions , 1988, Geometry and Robotics.

[17]  Narendra Ahuja,et al.  Surfaces from Stereo: Integrating Feature Matching, Disparity Estimation, and Contour Detection , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  O. Faugeras,et al.  Motion from point matches: Multiplicity of solutions , 1989, [1989] Proceedings. Workshop on Visual Motion.

[19]  Shinsuke Shimojo,et al.  Da vinci stereopsis: Depth and subjective occluding contours from unpaired image points , 1990, Vision Research.

[20]  K. Nakayama,et al.  DaVinci stereopsis: Depth and subjective contours from unpaired monocular points , 1990 .

[21]  Edward H. Adelson,et al.  The Design and Use of Steerable Filters , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Jitendra Malik,et al.  Determining Three-Dimensional Shape from Orientation and Spatial Frequency Disparities , 1991, ECCV.

[23]  Jitendra Malik,et al.  Computational framework for determining stereo correspondence from a set of linear spatial filters , 1992, Image Vis. Comput..

[24]  David G. Jones Computational models of binocular vision , 1991 .