Stereo matching with Global Edge Constraint and Graph Cuts

We propose a novel method on stereo matching based on the Global Edge Constraint (GEC) and Graph Cuts. Firstly, the GEC composed of particular image edges is employed to generate the initial disparity maps. And then the reliable disparity maps consistent with the observed data are extracted to construct the data term of the energy function. Finally, we incorporate the GEC as a soft constraint into our global optimization framework, and the optimal solution could be approximated via graph cuts. Experimental results demonstrated the good performance of our proposed approach.

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

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

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

[4]  Zheng Zhi A Region Based Stereo Matching Algorithm Using Cooperative Optimization , 2009 .

[5]  Andreas Klaus,et al.  Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[6]  Carlo Tomasi,et al.  A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  W. Freeman,et al.  Generalized Belief Propagation , 2000, NIPS.

[8]  Ding Yuan,et al.  Dense stereo matching based on edge constraint and variable windows , 2011, 2011 IEEE International Conference on Robotics and Biomimetics.

[9]  Pushmeet Kohli,et al.  Object stereo — Joint stereo matching and object segmentation , 2011, CVPR 2011.