Abstract We describe a graph cut algorithm to recover the 3D object surface using both silhouette and foreground color information. The graph cut algorithm is used for optimization on a color consistency field. Constraints are added to improve its performance. These constraints are a set of predetermined locations that the true surface of the object is likely to pass through. They are used to preserve protrusions and to pursue concavities respectively in the first and the second phase of the algorithm. We also introduce a method for dealing with silhouette uncertainties arising from background subtraction on real data. We test the approach on synthetic data with different numbers of views (8, 16, 32, 64) and on a real image set containing 30 views of a toy squirrel.


    Access

    Download


    Export, share and cite



    Title :

    3D Surface Reconstruction Using Graph Cuts with Surface Constraints


    Contributors:
    Tran, Son (author) / Davis, Larry (author)


    Publication date :

    2006-01-01


    Size :

    13 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    3D Surface Reconstruction Using Graph Cuts with Surface Constraints

    Tran, S. / Davis, L. | British Library Conference Proceedings | 2006


    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



    Joint 3D-Reconstruction and Background Separation in Multiple Views Using Graph Cuts

    Goldlucke, B. / Magnor, M. / IEEE | British Library Conference Proceedings | 2003


    Spatially Coherent Clustering Using Graph Cuts

    Zabih, R. / Kolmogorov, V. / IEEE Computer Society | British Library Conference Proceedings | 2004