Occlusion is one of the challenging problems in stereo. In this paper, we solve the problem in a segment-based style. Both images are segmented, and we propose a novel patch-based stereo algorithm that cuts the segments of one image using the segments of the other, and handles occlusion areas in a proper way. A symmetric graph-cuts optimization framework is used to find correspondence and occlusions simultaneously. The experimental results show superior performance of the proposed algorithm, especially on occlusions, untextured areas and discontinuities.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A symmetric patch-based correspondence model for occlusion handling


    Contributors:
    Yi Deng, (author) / Qiong Yang, (author) / Xueyin Lin, (author) / Xiaoou Tang, (author)


    Publication date :

    2005-01-01


    Size :

    530199 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Symmetric Patch-Based Correspondence Model for Occlusion Handling

    Deng, Y. / Yang, Q. / Lin, X. et al. | British Library Conference Proceedings | 2005


    Symmetric stereo matching for occlusion handling

    Jian Sun, / Yin Li, / Kang, S.B. et al. | IEEE | 2005


    Appearance models for occlusion handling

    Senior, A. / Hampapur, A. / Tian, Y. L. et al. | British Library Online Contents | 2006


    Context-based multi-target tracking with occlusion handling

    Tao, J. / Franke, U. / Klette, R. | British Library Online Contents | 2016