A New Stereo Matching Method Based on the Adaptive Support-Weight Window

We propose a new stereo matching approach based on the adaptive support-weight of local window. First, we use the truncated absolute differences cost function to compute the disparity space image. Second, we redefine the support-weight of a local window which is evaluated according to two factors such as color difference and space distance between a pixel and its center pixel in the local window. Finally, we aggregate the matching cost based on the support weight and use the winner-take-all method to compute the disparity map. In order to improve method’s speed, we design an efficient support-weight calculation way. The results of the experiment show that our approach can compute the accurate disparity than other methods.

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

[2]  Harry Shum,et al.  Stereo computation using radial adaptive windows , 2002, Object recognition supported by user interaction for service robots.

[3]  Olga Veksler,et al.  A Variable Window Approach to Early Vision , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Aaron F. Bobick,et al.  Large Occlusion Stereo , 1999, International Journal of Computer Vision.

[5]  Darius Burschka,et al.  Advances in Computational Stereo , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[8]  Luis Rueda,et al.  Advances in Image and Video Technology, Second Pacific Rim Symposium, PSIVT 2007, Santiago, Chile, December 17-19, 2007, Proceedings , 2007, PSIVT.

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

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

[11]  Hongbin Zha,et al.  Computer Vision - ACCV 2009, 9th Asian Conference on Computer Vision, Xi'an, China, September 23-27, 2009, Revised Selected Papers, Part III , 2010, Asian Conference on Computer Vision.

[12]  Stefano Mattoccia.  A locally global approach to stereo correspondence , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

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

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

[15]  Qican Zhang,et al.  Local stereo matching with adaptive support-weight, rank transform and disparity calibration , 2008, Pattern Recognit. Lett..

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

[17]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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