Multiple depth maps integration for 3D reconstruction using geodesic graph cuts

Jiangbin Zheng, Xinxin Zuo, Jinchang Ren, Sen Wang

Research output: Contribution to journalArticle

3 Citations (Scopus)
91 Downloads (Pure)

Abstract

Depth images, in particular depth maps estimated from stereo vision, may have a substantial amount of outliers and result in inaccurate 3D modelling and reconstruction. To address this challenging issue, in this paper, a graph-cut based multiple depth maps integration approach is proposed to obtain smooth and watertight surfaces. First, confidence maps for the depth images are estimated to suppress noise, based on which reliable patches covering the object surface are determined. These patches are then exploited to estimate the path weight for 3D geodesic distance computation, where an adaptive regional term is introduced to deal with the “shorter-cuts” problem caused by the effect of the minimal surface bias. Finally, the adaptive regional term and the boundary term constructed using patches are combined in the graph-cut framework for more accurate and smoother 3D modelling. We demonstrate the superior performance of our algorithm on the well-known Middlebury multi-view database and additionally on real-world multiple depth images captured by Kinect. The experimental results have shown that our method is able to preserve the object protrusions and details while maintaining surface smoothness.
Original languageEnglish
Number of pages14
JournalInternational Journal of Software Engineering and Knowledge Engineering
Volume2015
DOIs
Publication statusPublished - Apr 2015

Keywords

  • multiple depth maps integration
  • geodesic distance
  • adaptive regional term
  • graph cuts

Fingerprint Dive into the research topics of 'Multiple depth maps integration for 3D reconstruction using geodesic graph cuts'. Together they form a unique fingerprint.

Cite this