Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel formulation that handles occlusion using only one depth map in an asymmetrical way. Consequently, multi-view information is efficiently accumulated to achieve high accuracy. The resulting energy function is complex and approximate graph cut based solutions are proposed. Our approach complements the theory and extends the applicability of using graph cut in stereo. The experiments demonstrate that the approach is comparable with the state of the art and potentially more efficient for multi-view stereo.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Asymmetrical occlusion handling using graph cut for multi-view stereo


    Contributors:
    Wei, Y. (author) / Quan, L. (author)


    Publication date :

    2005-01-01


    Size :

    456144 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Symmetric stereo matching for occlusion handling

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


    Handling occlusions in dense multi-view stereo

    Sing Bing Kang, / Szeliski, R. / Jinxiang Chai, | IEEE | 2001


    Handling Occlusions in Dense Multi-View Stereo

    Kang, S. B. / Szeliski, R. / Chai, J. et al. | British Library Conference Proceedings | 2001


    Multi-view stereo via volumetric graph-cuts

    Vogiatzis, G. / Torr, P.H.S. / Cipolla, R. | IEEE | 2005


    Large Occlusion Stereo

    Bobick, A. F. / Intille, S. S. | British Library Online Contents | 1999