Orientation-guided geodesic weighting for PatchMatch-based stereo matching

We propose an orientation-guided geodesic weighting (OGGW) strategy for local stereo matching.We propose a method of cost volume filtering combining a multipoint LPA method with our OGGW strategy.We propose a PatchMatch filter with curved surface fitting (PMF-CS) to obtain a disparity map with sub-pixel accuracy. Recently, PatchMatch-based methods for local stereo matching are experiencing great progress with the use of compact and over-segmented regions that have similar intensities or colors. Using patches as support regions, this paper proposes an orientation-guided geodesic weighting (OGGW) strategy to search for an approximate shortest path from a support pixel in the patch to a pixel of interest along a guided orientation. The OGGW is computed by accumulating intensity differences or color dissimilarities between connected pixels along the path. After obtaining matching cost updates by model fitting, the OGGW is used for weighted averaging on the updated costs to obtain a filtered cost volume. In addition, a new filtering method that combines the PatchMatch filter with curved surface fitting (PMF-CS) is presented in this paper. Curved surface fitting along with outliers removal is carried out to seek for a reliable regression model for estimating the disparities on a patch and to achieve a disparity map with sub-pixel accuracy. We conduct a number of experiments to evaluate the performances of OGGW and PMF-CS on cost volume filtering and disparity estimation. Experimental results show that our algorithm produces accurate stereo matching results and outperforms the current state-of-the-art PatchMatch-based methods.

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

[2]  Ding Yuan,et al.  Cross-trees, edge and superpixel priors-based cost aggregation for stereo matching , 2015, Pattern Recognit..

[3]  Changming Sun,et al.  Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques , 2002, International Journal of Computer Vision.

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

[5]  Jun Yu,et al.  Multi-view ensemble manifold regularization for 3D object recognition , 2015, Inf. Sci..

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

[7]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[9]  M. Okutomi,et al.  A simple stereo algorithm to recover precise object boundaries and smooth surfaces , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).

[10]  Don Ray Murray,et al.  Using Real-Time Stereo Vision for Mobile Robot Navigation , 2000, Auton. Robots.

[11]  Sven J. Dickinson,et al.  TurboPixels: Fast Superpixels Using Geometric Flows , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Meng Wang,et al.  Image-Based Three-Dimensional Human Pose Recovery by Multiview Locality-Sensitive Sparse Retrieval , 2015, IEEE Transactions on Industrial Electronics.

[13]  Xu Wang,et al.  A bundled-optimization model of multiview dense depth map synthesis for dynamic scene reconstruction , 2015, Inf. Sci..

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

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

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

[17]  Minh N. Do,et al.  Cross-based local multipoint filtering , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[18]  Frédo Durand,et al.  A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach , 2006, ECCV.

[19]  D. Nistér,et al.  Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Changming Sun,et al.  Stereo matching using cost volume watershed and region merging , 2014, Signal Process. Image Commun..

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

[22]  Narendra Ahuja,et al.  Real-time O(1) bilateral filtering , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[23]  Vamshhi Pavan Kumar Varma Vegeshna,et al.  Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[24]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[25]  Carsten Rother,et al.  PatchMatch Stereo - Stereo Matching with Slanted Support Windows , 2011, BMVC.

[26]  Cevahir Çigla,et al.  Efficient edge-preserving stereo matching , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[27]  Changming Sun,et al.  Multipoint Filtering with Local Polynomial Approximation and Range Guidance , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Umar Mohammed,et al.  Superpixel lattices , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

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

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

[31]  Adam Finkelstein,et al.  The Generalized PatchMatch Correspondence Algorithm , 2010, ECCV.

[32]  Fatih Porikli,et al.  Constant time O(1) bilateral filtering , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[33]  Umar Mohammed,et al.  Scene shape priors for superpixel segmentation , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[34]  Changming Sun.  Closed-form stereo image rectification , 2012, IVCNZ '12.

[35]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

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

[37]  Ramakant Nevatia,et al.  Segment-based stereo matching , 1985, Comput. Vis. Graph. Image Process..

[38]  Margrit Gelautz,et al.  Secrets of adaptive support weight techniques for local stereo matching , 2013, Comput. Vis. Image Underst..

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

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

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