Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts

This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of a GPU-based plane-sweep approach, to compute individual dense depth maps and a subsequent robust volumetric depth map integration technique. Basically, the dense depth map values are transformed to a volumetric grid, which are further embedded in a graph structure. The edge weights of the graph are derived from the dense depth map values and if available, from sparse 3D information. The final optimized surface is obtained as a min-cut/maxflow solution of the weighted graph. We demonstrate the robustness and accuracy of our proposed approach on several real world data sets. Key words: volumetric 3D reconstruction, graph-cut, dense depth maps, virtual 3D models

• Type: Conference
• Year: 2007
• Where: SCIA
• Authors: Mario Sormann, Christopher Zach, Joachim Bauer, Konrad F. Karner, Horst Bischof
• Keywords: Dense Depth Maps, Depth Map Values, Individual Dense Depth, SCIA 2007