Global optimization for bidirectional stereo matching with occlusion handling

This paper presents a new global energy optimization method with occlusion handling for stereo matching. We present a new cost function for modeling the problem of stereo matching. A new data term revised from normal NCC algorithm and an occlusion term are constructed in our proposed cost function. In addition, a bidirectional stereo matching strategy is introduced to refine the disparity calculating results. In this paper, we compared the proposed method with state-of-the-art stereo matching algorithm quantitatively and qualitatively. Our experiments are carried out on both real-scene and Middlebury datasets. Experimental results demonstrate that our method evidently outperforms the others. Our method achieves good acceptable results under complex imaging condition, especially for some complex real-scene images.

[1]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[2]  Christophe Rosenberger,et al.  Detecting Half-Occlusion with a Fast Region-Based Fusion Procedure , 2006, BMVC.

[3]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Vladimir Kolmogorov,et al.  Multi-camera Scene Reconstruction via Graph Cuts , 2002, ECCV.

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

[6]  William T. Freeman,et al.  Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[7]  Jonathan Warrell,et al.  “Lattice Cut” - Constructing superpixels using layer constraints , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  C. Cattani,et al.  Markov Models for Image Labeling , 2012 .

[9]  Ruigang Yang,et al.  Global stereo matching leveraged by sparse ground control points , 2011, CVPR 2011.

[10]  Dorin Comaniciu,et al.  Distribution Free Decomposition of Multivariate Data , 1998, Pattern Analysis & Applications.

[11]  Paul Davidsson,et al.  Agent-based Appoaches and Classical Optimization Techniques for Dynamic Distributed Resource Allocation : A preliminary study , 2003 .

[12]  Shengyong Chen,et al.  Acceleration Strategies in Generalized Belief Propagation , 2012, IEEE Transactions on Industrial Informatics.

[13]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[14]  Vladimir Kolmogorov,et al.  Generalized Multi-camera Scene Reconstruction Using Graph Cuts , 2003, EMMCVPR.

[15]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  BleyerMichael,et al.  Graph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions , 2007 .

[17]  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..

[18]  Martin J. Wainwright,et al.  MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.

[19]  Yair Weiss,et al.  MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies , 2007, UAI.