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

Tools

Zheng, Jiangbin and Zuo, Xinxin and Ren, Jinchang and Wang, Sen (2015) Multiple depth maps integration for 3D reconstruction using geodesic graph cuts. International Journal of Software Engineering and Knowledge Engineering, 2015. ISSN 0218-1940 (https://doi.org/10.1142/S0218194015400173)

[thumbnail of Zheng-etal-IJSEKE-2015-Multiple-depth-maps-integration-for-3D-reconstruction]
Preview
 Text. Filename: Zheng_etal_IJSEKE_2015_Multiple_depth_maps_integration_for_3D_reconstruction.pdf
Accepted Author Manuscript
Download (2MB)| Preview

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.

ORCID iDs

Zheng, Jiangbin, Zuo, Xinxin, Ren, Jinchang ORCID logoORCID: https://orcid.org/0000-0001-6116-3194 and Wang, Sen;
CORE (COnnecting REpositories)