Return
A surface reconstruction method using global graph cut optimization
DOI:10.1007/s11263-005-3953-x.png)
Abstract
En 中文
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.
Keywords:
graph flow
graph cut
3D reconstruction from calibrated cameras
discontinuities
self-occlusions
occlusions
global minimum
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.3
Papers:
3.9K
Citations:
2.8W
Organization
No organization information available
Cited Papers
Applicability of the i/o-characters to a quantitative description of bioconcentration of organic chemicals in fish
Chemosphere
IF0
The influence of former land-use on vegetation and biodiversity in the boreo-nemoral zone of Sweden
Ecography
IF0

