An adaptive cost aggregation method based on bilateral filter and canny edge detector with segmented area for stereo matching

In traditional stereo matching, global approach is more accurate but time consuming, also have high accuracy in occlusion area. On the contrary, local approach is usually fast but have bad performance, and easily influenced by noise. This paper proposed a novel method to compute disparity between two images. It is based on local approach, but our new cost function aggregated the cost in global way. This aggregation is processed by a weight map which created by the bilateral filter. Every pixel transfers its own cost information to all pixels on the same object, but this information would be restricted by the weight map. After finishing preliminary depth map, we use L-R check to find occlusion and mismatch pixels to refined our depth map. These refinement mechanics fix occlusion areas by the smallest disparity nearby. At last, we use bilateral filter clean up whole depth map. All of above computing process can be parallelized on GPU or cloud sever. Although this algorithm is designed for lowlevel machine, it still exerts high performance in high-level hardware.

[1]  Franz Franchetti,et al.  High Performance Stereo Vision Designed for Massively Data Parallel Platforms , 2010, IEEE Transactions on Circuits and Systems for Video Technology.

[2]  Christoph Fehn,et al.  Depth-image-based rendering (DIBR), compression, and transmission for a new approach on 3D-TV , 2004, IS&T/SPIE Electronic Imaging.

[3]  Xing Mei,et al.  On building an accurate stereo matching system on graphics hardware , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[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]  In-So Kweon,et al.  Adaptive Support-Weight Approach for Correspondence Search , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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

[9]  M. Bleyer,et al.  Near Real-Time Stereo With Adaptive Support Weight Approaches , 2010 .

[10]  H. Hirschmüller Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information , 2005, CVPR.

[11]  James K. Archibald,et al.  Improved Census Transforms for Resource-Optimized Stereo Vision , 2013, IEEE Transactions on Circuits and Systems for Video Technology.

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