A Surface Reconstruction Method Using Global Graph Cut Optimization |
| |
Authors: | Sylvain Paris François X Sillion Long Quan |
| |
Affiliation: | (1) MIT CSAIL, Cambridge, 02139, MA, USA;(2) ARTIS, GRAVIR/IMAG-INRIA, 38334 Saint Ismier, France;(3) Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, SAR, China |
| |
Abstract: | Surface reconstruction from multiple calibrated images has been mainly approached using local methods, either as a continuous
optimization problem driven by level sets, or by discrete volumetric methods such as space carving. We propose a direct surface
reconstruction approach which starts from a continuous geometric functional that is minimized up to a discretization by a
global graph-cut algorithm operating on a 3D embedded graph. The method is related to the stereo disparity computation based
on graph-cut formulation, but fundamentally different in two aspects. First, existing stereo disparity methods are only interested
in obtaining layers of constant disparity, while we focus on high resolution surface geometry. Second, most of the existing
graph-cut algorithms only reach approximate solutions, while we guarantee a global minimum. The whole procedure is consistently
incorporated into a voxel representation that handles both occlusions and discontinuities. We demonstrate our algorithm on
real sequences, yielding remarkably detailed surface geometry up to 1/10th of a pixel.
Author has worked on this project during his Ph. D. at ARTIS |
| |
Keywords: | graph flow graph cut 3D reconstruction from calibrated cameras discontinuities self-occlusions occlusions global minimum |
本文献已被 SpringerLink 等数据库收录! |
|