Segment-Based Stereo Matching Using Energy-Based Regularization

We propose a new stereo matching algorithm through energy-based regularization using color segmentation and visibility constraint. Plane parameters in the entire segments are modeled by robust least square algorithm, which is LMedS method. Then, plane parameter assignment is performed by the cost function penalized for occlusion, iteratively. Finally, disparity regularization which considers the smoothness between the segments and penalizes the occlusion through visibility constraint is performed. For occlusion and disparity estimation, we include the iterative optimization scheme in the energy-based regularization. Experimental results show that the proposed algorithm produces comparable performance to the state-of-the-arts especially in the object boundaries, un-textured regions.

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

[2]  Rachid Deriche,et al.  Dense Disparity Map Estimation Respecting Image Discontinuities: A PDE and Scale-Space BasedApproach , 2002, MVA.

[3]  Juliang Shao,et al.  Generation of Temporally Consistent Multiple Virtual Camera Views from Stereoscopic Image Sequences , 2002, International Journal of Computer Vision.

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

[5]  Kwanghoon Sohn,et al.  Hierarchical disparity estimation with energy-based regularization , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

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

[7]  Peter Meer,et al.  Synergism in low level vision , 2002, Object recognition supported by user interaction for service robots.

[8]  Hai Tao,et al.  A global matching framework for stereo computation , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[9]  Margrit Gelautz,et al.  A layered stereo algorithm using image segmentation and global visibility constraints , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[10]  Berthold K. P. Horn,et al.  Determining Optical Flow , 1981, Other Conferences.

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

[12]  Rachid Deriche,et al.  A Robust Technique for Matching two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry , 1995, Artif. Intell..

[13]  Luc Van Gool,et al.  Dense matching of multiple wide-baseline views , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.