A fast non-local disparity refinement method for stereo matching

This paper presents a fast non-local disparity refinement method based on disparity belief propagation. The disparity belief fast propagated on a minimum spanning tree only need two sequential passes, first from leaf nodes to root, then from root to leaf nodes. Computational complexity of each pixel at all disparity levels is O(1). Performance evaluation on standard Middlebury data sets shows that the proposed method outperforms local refinement method both in accuracy and speed. Compared with the existing nonlocal disparity refinement method, the proposed method shows about maximum 15× faster speed at almost the same accuracy.

[1]  Dongxiao Li,et al.  Full-Image Guided Filtering for Fast Stereo Matching , 2013, IEEE Signal Processing Letters.

[2]  Stefano Mattoccia,et al.  Accurate and Efficient Cost Aggregation Strategy for Stereo Correspondence Based on Approximated Joint Bilateral Filtering , 2009, ACCV.

[3]  Reinhard Männer,et al.  Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation , 2004, International Journal of Computer Vision.

[4]  Qingxiong Yang,et al.  A non-local cost aggregation method for stereo matching , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[5]  Jian Sun,et al.  Guided Image Filtering , 2010, ECCV.

[6]  Roberto Manduchi,et al.  Bilateral filtering for gray and color images , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

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

[8]  Gérard G. Medioni,et al.  3-D Surface Description from Binocular Stereo , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

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

[10]  Neil A. Dodgson,et al.  Real-Time Spatiotemporal Stereo Matching Using the Dual-Cross-Bilateral Grid , 2010, ECCV.

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