Study of occlusions problem in stereo vision

This paper presents a symmetric multiple windows using improved fast algorithm in stereo matching. The symmetric multiple windows method is an adaptive and stable scheme, which can smooth depth discontinous area. The method of single matching phase is used to estimate disparity. The adaptive property of symmetric multiple windows are adopted to reduce mistake matching probability. To produce smooth and detailed disparity maps, two assumptions that were originally proposed by Marr and Poggio are adopted: uniqueness and continuity. The improved sum of squared differences (SSD) algorithm avoids repeatedly computing, reduces the computing complexity efficiently. This paper demonstrates and discusses performances with real stereo pairs, the algorithmpsilas excellence can efficiently identify and reduce mistake matching in occluded region, then produce smooth image, and shorten matching time.

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

[2]  Luigi di Stefano,et al.  A fast area-based stereo matching algorithm , 2004, Image Vis. Comput..

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

[4]  Alan L. Yuille,et al.  Occlusions and binocular stereo , 1992, International Journal of Computer Vision.

[5]  Heiko Hirschmüller,et al.  Improvements in real-time correlation-based stereo vision , 2001, CVPR 2001.

[6]  Emanuele Trucco,et al.  Efficient stereo with multiple windowing , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Laurent Moll,et al.  Real time correlation-based stereo: algorithm, implementations and applications , 1993 .

[8]  Takeo Kanade,et al.  A Cooperative Algorithm for Stereo Matching and Occlusion Detection , 2000, IEEE Trans. Pattern Anal. Mach. Intell..