Stereo Vision Using Cost-Relaxation with 3 D Support Regions

In this paper a new stereo algorithm is presented for computing dense disparity maps from stereo image pairs using a cost relaxation approach, where the disparity map is the momentary state of a dynamic system. Following biologically motivated cooperative approaches a disparity space is defined with cooperating probability variables. In a first step a correlation based similarity measure is performed to initialize the relaxation process. Due to a very simple mathematical formulation, the relaxation itself could be realized as an optimization of a global cost function taking into account both the stereoscopic continuity constraint and considerations of the pixel similarity. The continuity constraint is implemented using a 3D Gaussian-weighted local support area of coupling probability variables which interact during the relaxation process. A special construction of the global cost function guarantees the existence of a unique global minimum of the cost function, which can be easily found with the help of a standard numerical procedure. In a post-processing step occlusions are detected and a sub-pixel precise disparity map is computed.

[1]  Alfred Schmitt,et al.  Real-Time Stereo by using Dynamic Programming , 2003, 2004 Conference on Computer Vision and Pattern Recognition Workshop.

[2]  Takeo Kanade,et al.  A Cooperative Algorithm for Stereo Matching and Occlusion Detection , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Aaron F. Bobick,et al.  Large Occlusion Stereo , 1999, International Journal of Computer Vision.

[4]  T. Poggio,et al.  The analysis of stereopsis. , 1984, Annual review of neuroscience.

[5]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Richard Szeliski,et al.  High-accuracy stereo depth maps using structured light , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[7]  Georg Hartmann,et al.  Stereo Matching with Implicit Detection of Occlusions , 1998, ECCV.

[8]  Li Hong,et al.  Segment-based stereo matching using graph cuts , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[9]  Nanning Zheng,et al.  Stereo Matching Using Belief Propagation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Carlo Tomasi,et al.  Surfaces with occlusions from layered stereo , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Tomaso Poggio,et al.  Cooperative computation of stereo disparity , 1988 .

[12]  Bärbel Mertsching,et al.  Stereo matching with occlusion detection using cost relaxation , 2005, IEEE International Conference on Image Processing 2005.

[13]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[14]  Jian Sun,et al.  Symmetric stereo matching for occlusion handling , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).