A Cooperative Algorithm for Stereo Matching and Occlusion Detection

Presents a stereo algorithm for obtaining disparity maps with occlusion explicitly detected. To produce smooth and detailed disparity maps, two assumptions that were originally proposed by Marr and Poggio (1976, 1979) are adopted: uniqueness and continuity. That is, the disparity maps have a unique value per pixel and are continuous almost everywhere. These assumptions are enforced within a three-dimensional array of match values in disparity space. Each match value corresponds to a pixel in an image and a disparity relative to another image. An iterative algorithm updates the match values by diffusing support among neighboring values and inhibiting others along similar lines of sight. By applying the uniqueness assumption, occluded regions can be explicitly identified. To demonstrate the effectiveness of the algorithm, we present the processing results from synthetic and real image pairs, including ones with ground-truth values for quantitative comparison with other methods.

[1]  Masatsugu Kidode,et al.  An iterative prediction and correction method for automatic stereocomparison , 1973, Comput. Graph. Image Process..

[2]  Martin D. Levine,et al.  Computer determination of depth maps , 1973, Comput. Graph. Image Process..

[3]  P. Dodwell,et al.  Responses of infants to visually presented objects. , 1976, Science.

[4]  D Marr,et al.  Cooperative computation of stereo disparity. , 1976, Science.

[5]  D Marr,et al.  A computational theory of human stereo vision. , 1979, Proceedings of the Royal Society of London. Series B, Biological sciences.

[6]  T. Poggio,et al.  A computational theory of human stereo vision , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

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

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

[9]  W. Eric L. Grimson,et al.  Computational Experiments with a Feature Based Stereo Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Wolfgang Förstner,et al.  PHOTOGRAMMETRIC STANDARD METHODS AND DIGITAL IMAGE MATCHING TECHNIQUES FOR HIGH PRECISION SURFACE MEASUREMENTS , 1986 .

[12]  E. R. Haddow,et al.  A parallel binocular stereo algorithm utilizing dynamic programming and relaxation labelling , 1987 .

[13]  David Mumford,et al.  A Bayesian treatment of the stereo correspondence problem using half-occluded regions , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Takeo Kanade,et al.  A Multiple-Baseline Stereo , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Avinash C. Kak,et al.  Stereo vision , 1994 .

[16]  최우영,et al.  Stereo vision 및 응용 , 1994 .

[17]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Aaron F. Bobick,et al.  Disparity-Space Images and Large Occlusion Stereo , 1994, ECCV.

[19]  Aaron F. Bobick,et al.  Incorporating intensity edges in the recovery of occlusion regions , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[20]  Hans P. Moravec.  Robot spatial perception by stereoscopic vision and 3D evidence grids , 1996 .

[21]  Yuichi Ohta,et al.  Occlusion detectable stereo-occlusion patterns in camera matrix , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[22]  Robert T. Collins,et al.  A space-sweep approach to true multi-image matching , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[23]  Takeo Kanade,et al.  A Volumetric Iterative Approach to Stereo Matching and Occlusion Detection , 1998 .

[24]  Olga Veksler,et al.  Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[25]  Richard Szeliski,et al.  An Experimental Comparison of Stereo Algorithms , 1999, Workshop on Vision Algorithms.