DOI: 10.1007/978-3-540-74198-5_34
|View full text |Cite
|
Sign up to set email alerts
|

Continuous Global Optimization in Multiview 3D Reconstruction

Abstract: Abstract. In this work, we introduce a robust energy model for multiview 3D reconstruction that fuses silhouette-and stereo-based image information. It allows to cope with significant amounts of noise without manual pre-segmentation of the input images. Moreover, we suggest a method that can globally optimize this energy up to the visibility constraint. While similar global optimization has been presented in the discrete context in form of the maxflow-mincut framework, we suggest the use of a continuous counte… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
47
0

Publication Types

Select...
6
3
1

Relationship

2
8

Authors

Journals

citations
Cited by 42 publications
(47 citation statements)
references
References 32 publications
0
47
0
Order By: Relevance
“…Alternatively, one can dynamically integrate silhouette-aligning forces in each optimization step of stereo reconstruction. Kolev et al [22] used a regional term on volumetric grids to enforce the silhouette constraint, which is similar to the Chan-Vese model in 2D/3D image segmentation [23,24]. This regional term can be updated during energy optimization, so the occluded regions can be determined based on currently estimated surface.…”
Section: Related Workmentioning
confidence: 99%
“…Alternatively, one can dynamically integrate silhouette-aligning forces in each optimization step of stereo reconstruction. Kolev et al [22] used a regional term on volumetric grids to enforce the silhouette constraint, which is similar to the Chan-Vese model in 2D/3D image segmentation [23,24]. This regional term can be updated during energy optimization, so the occluded regions can be determined based on currently estimated surface.…”
Section: Related Workmentioning
confidence: 99%
“…Global methods typically define a global cost function for shapes and then use some global optimization algorithm to recover a shape that minimizes the cost function. Examples of global methods include approaches based on volumetric Markov Random Field (MRF) models [3], which utilize graph cut optimization techniques [2], and variational approaches, which use convex optimization [28]. A common property of global methods is a relatively large memory usage and time complexity due to the use of a dense volumetric grid.…”
Section: General Overviewmentioning
confidence: 99%
“…Variational approach has also been successfully applied in binocular scene flow scenario, in which depth and motion are jointly optimized. In MVS area, Kolev [14] proposed a continuous global optimization algorithm parallel to discrete volumetric graph cuts [28]. Although it is based on variational technique, its solution is in the 3D space, while ours is based on the 2D image space.…”
Section: Related Workmentioning
confidence: 99%