Comparisons reducing for local stereo matching using hierarchical structure

We propose a method for local stereo matching that reduces the number of matching comparisons, which also reduces the running time. By using hierarchical structure with suitable disparity candidate set, the proposed method maintains accuracy of local matching methods. Theoretical analysis and experimental results show that the number of comparisons of the proposed method is independent of the disparity range, while the accuracy is nearly the same as the corresponding local method.

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

[2]  Heiko Hirschmüller,et al.  Evaluation of Cost Functions for Stereo Matching , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Narendra Ahuja,et al.  A constant-space belief propagation algorithm for stereo matching , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

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

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

[7]  Christopher Joseph Pal,et al.  Learning Conditional Random Fields for Stereo , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

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

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

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

[11]  Richard P. Wildes,et al.  Efficient Stereo with Accurate 3-D Boundaries , 2006, BMVC.

[12]  Thomas O. Binford,et al.  Depth from Edge and Intensity Based Stereo , 1981, IJCAI.

[13]  Lifeng Sun,et al.  Virtual support window for adaptive-weight stereo matching , 2011, 2011 Visual Communications and Image Processing (VCIP).

[14]  Ramin Zabih,et al.  Dynamic Programming and Graph Algorithms in Computer Vision , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Jan-Michael Frahm,et al.  Adaptive Scale Selection for Hierarchical Stereo , 2011, BMVC.