Multiview stereo via volumetric graph-cuts and occlusion robust photo-consistency

George Vogiatzis*, Carlos Hernández, Philip H.S. Torr, Roberto Cipolla

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review


    This paper presents a volumetric formulation for the multiview stereo problem which is amenable to a computationally tractable global optimization using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labeled as "object" and "empty" under a cost functional consisting of the following two terms: 1) A term that forces the boundary between the two regions to pass through photo-consistent locations and 2) a ballooning term that inflates the "object" region. To take account of the effect of occlusion on the first term, we use an occlusion robust photo-consistency metric based on Normalized Cross Correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.

    Original languageEnglish
    Pages (from-to)2241-2246
    Number of pages6
    JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
    Issue number12
    Publication statusPublished - Dec 2007


    • 3D/stereo scene analysis
    • Global optimization
    • Graph algorithms
    • Shape


    Dive into the research topics of 'Multiview stereo via volumetric graph-cuts and occlusion robust photo-consistency'. Together they form a unique fingerprint.

    Cite this