Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh

We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not assume that the surface lies within a finite band around the visual hull or any other base surface. Instead, it uses photo-consistency to guide the adaptive subdivision of a coarse mesh of the bounding volume. This generates a multi-resolution volumetric mesh that is densely tesselated in the parts likely to contain the unknown surface. The graph-cut on the dual graph of this tetrahedral mesh produces a minimum cut corresponding to a triangulated surface that minimizes a global surface cost functional. Our method makes no assumptions about topology and can recover deep concavities when enough cameras observe them. Our formulation also allows silhouette constraints to be enforced during the graph-cut step to counter its inherent bias for producing minimal surfaces. Local shape refinement via surface deformation i...

• Type: Conference
• Year: 2007
• Where: ICCV
• Authors: Sudipta N. Sinha, Philippos Mordohai, Marc Pollefeys
• Keywords: Computer Vision, Global Surface Cost, ICCV 2007, Multi-resolution Volumetric Mesh, Surface Deformation, Tetrahedral Mesh, Unknown Surface