Robust Stereo Matching Using Probabilistic Laplacian Surface Propagation

This paper describes a probabilistic Laplacian surface propagation (PLSP) framework for a robust stereo matching under severe radiometric variations. We discover that a progressive scheme overcomes an inherent limitation for this task, while most conventional efforts have been focusing on designing a robust cost function. We propose the ground control surfaces (GCSs) designed as progressive unit, which alleviates the problems of conventional progressive methods and superpixel based methods, simultaneously. Moreover, we introduce a novel confidence measure for stereo pairs taken under radiometric variations based on the probability of correspondences. Specifically, the PLSP estimates the GCSs from initial sparse disparity maps using a weighted least-square. The GCSs are then propagated on a superpixel graph with a surface confidence weighting. Experimental results show that the PLSP outperforms state-of-the-art robust cost function based methods and other propagation methods for the stereo matching under radiometric variations.

[1]  Vladimir Kolmogorov,et al.  Visual correspondence using energy minimization and mutual information , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[2]  Ramin Zabih,et al.  Non-parametric Local Transforms for Computing Visual Correspondence , 1994, ECCV.

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

[4]  Pascal Fua,et al.  SLIC Superpixels Compared to State-of-the-Art Superpixel Methods , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Zhi-Gang Zheng,et al.  A region based stereo matching algorithm using cooperative optimization , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Richard Szeliski,et al.  Piecewise planar stereo for image-based rendering , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[7]  Li Hong,et al.  Segment-based stereo matching using graph cuts , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[8]  Dani Lischinski,et al.  Colorization using optimization , 2004, ACM Trans. Graph..

[9]  Enhua Wu,et al.  Constant Time Weighted Median Filtering for Stereo Matching and Beyond , 2013, 2013 IEEE International Conference on Computer Vision.

[10]  Heiko Hirschmüller,et al.  Evaluation of Stereo Matching Costs on Images with Radiometric Differences , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Klaus Diepold,et al.  Dense disparity maps from sparse disparity measurements , 2011, 2011 International Conference on Computer Vision.

[12]  Youngbae Hwang,et al.  Color Transfer Using Probabilistic Moving Least Squares , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[13]  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).

[14]  Seungryong Kim,et al.  Mahalanobis Distance Cross-Correlation for Illumination-Invariant Stereo Matching , 2014, IEEE Transactions on Circuits and Systems for Video Technology.

[15]  Markus Gross,et al.  Practical temporal consistency for image-based graphics applications , 2012, ACM Trans. Graph..

[16]  Pushmeet Kohli,et al.  Surface stereo with soft segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields , 2006, ECCV.

[18]  Stephen Lin,et al.  Semantic colorization with internet images , 2011, ACM Trans. Graph..

[19]  Jian Sun,et al.  Guided Image Filtering , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Sang Uk Lee,et al.  Mutual information-based stereo matching combined with SIFT descriptor in log-chromaticity color space , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[21]  Tamir Hazan,et al.  Continuous Markov Random Fields for Robust Stereo Estimation , 2012, ECCV.

[22]  Sang Uk Lee,et al.  Robust Stereo Matching Using Adaptive Normalized Cross-Correlation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Minh N. Do,et al.  Patch Match Filter: Efficient Edge-Aware Filtering Meets Randomized Search for Fast Correspondence Field Estimation , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[24]  Richard Szeliski,et al.  Efficient preconditioning of laplacian matrices for computer graphics , 2013, ACM Trans. Graph..

[25]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[26]  D. Scharstein,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).

[27]  Xing Mei,et al.  Stereo Matching with Reliable Disparity Propagation , 2011, 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission.