Stereo Matching with Global Edge Constraint and Occlusion Handling

In this paper, an effective constraint is proposed to leverage the stereo matching in early vision literature. Firstly, some particular edges are extracted to compose the new smooth constraint by categorizing the color edges into different groups. Then the optimal support windows can be established based on the proposed constraint. Finally, the disparity map would be estimated by using match propagation within the optimal support windows. Compared to the traditional window-based algorithms, our method is more effective to deal with the difficulties caused by the occluded regions or disparity discontinuities. We evaluated our algorithm with real stereo pair of images and the experimental results showed the good performance.

[1]  Carsten Rother,et al.  Fast cost-volume filtering for visual correspondence and beyond , 2011, CVPR 2011.

[2]  Federico Tombari,et al.  Classification and evaluation of cost aggregation methods for stereo correspondence , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Olga Veksler,et al.  Fast variable window for stereo correspondence using integral images , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[4]  Philippe Bekaert,et al.  Local Stereo Matching with Segmentation-based Outlier Rejection , 2006, The 3rd Canadian Conference on Computer and Robot Vision (CRV'06).

[5]  Margrit Gelautz,et al.  Local stereo matching using geodesic support weights , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[6]  Olga Veksler,et al.  Stereo Correspondence with Compact Windows via Minimum Ratio Cycle , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Ruigang Yang,et al.  A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching , 2007, International Journal of Computer Vision.

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

[9]  Nasser Kehtarnavaz,et al.  Stereo matching via selective multiple windows , 2007, J. Electronic Imaging.

[10]  Long Quan,et al.  Match Propagation for Image-Based Modeling and Rendering , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Rafael Cabeza,et al.  Near Real-Time Stereo Matching Using Geodesic Diffusion , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Emanuele Trucco,et al.  Efficient stereo with multiple windowing , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[14]  Richard Szeliski,et al.  Stereo matching with non-linear diffusion , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  Richard Szeliski,et al.  Stereo Matching with Nonlinear Diffusion , 1998, International Journal of Computer Vision.

[16]  In-So Kweon,et al.  Adaptive Support-Weight Approach for Correspondence Search , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Federico Tombari,et al.  Segmentation-Based Adaptive Support for Accurate Stereo Correspondence , 2007, PSIVT.