This paper presents a novel formulation for the multi-view scene reconstruction problem. While this formulation benefits from a volumetric scene representation, it is amenable to a computationally tractable global optimisation using Graph-cuts. The algorithm proposed uses the visual hull of the scene to infer occlusions and as a constraint on the topology of the scene. A photo consistency-based surface cost functional is defined and discretised with a weighted graph. The optimal surface under this discretised functional is obtained as the minimum cut solution of the weighted graph. Our method provides a viewpoint independent surface regularisation, approximate handling of occlusions and a tractable optimisation scheme. Promising experimental results on real scenes as well as a quantitative evaluation on a synthetic scene are presented.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-view stereo via volumetric graph-cuts


    Contributors:
    Vogiatzis, G. (author) / Torr, P.H.S. (author) / Cipolla, R. (author)


    Publication date :

    2005-01-01


    Size :

    861391 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    GPU-friendly multi-view stereo reconstruction using surfel representation and graph cuts

    Chang, J. Y. / Park, H. / Park, I. K. et al. | British Library Online Contents | 2011


    Multi-label Depth Estimation for Graph Cuts Stereo Problems

    Papadakis, N. | British Library Online Contents | 2010


    Segment-based stereo matching using graph cuts

    Li Hong, / Chen, G. | IEEE | 2004


    Segment-Based Stereo Matching Using Graph Cuts

    Hong, L. / Chen, G. / IEEE Computer Society | British Library Conference Proceedings | 2004


    Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering

    Chang, J. Y. / Lee, K. M. / Lee, S. U. | British Library Conference Proceedings | 2006