Watertight multi-view reconstruction based on volumetric graph-cuts

  • Authors:
  • Mario Sormann;Christopher Zach;Joachim Bauer;Konrad Karner;Horst Bishof

  • Affiliations:
  • VRVis Research Center, Graz, Austria;VRVis Research Center, Graz, Austria;VRVis Research Center, Graz, Austria;VRVis Research Center, Graz, Austria;Institute for Computer Graphics and Vision, Graz University of Technology, Graz, Austria

  • Venue:
  • SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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/max-flow solution of the weighted graph.We demonstrate the robustness and accuracy of our proposed approach on several real world data sets.