Image Analysis
DOI: 10.1007/978-3-540-73040-8_40
|View full text |Cite
|
Sign up to set email alerts
|

Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts

Abstract: This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of a GPU-based plane-sweep approach, to compute individual dense depth maps and a subsequent robust volumetric depth map integration technique. Basically, the dense depth map values are transformed to a volumetric grid, which are further embedded in a graph structure. The edge weights of the graph are derived from the dense depth map va… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 21 publications
(21 reference statements)
0
8
0
Order By: Relevance
“…Furthermore, there is no easy handling of occlusions and visibility problems. Even if building a depth-map is faster nowadays, the fusion part implies a heavy computational cost [7], which hinders the use of such methods for our application.…”
Section: A Surface-based Methodsmentioning
confidence: 99%
“…Furthermore, there is no easy handling of occlusions and visibility problems. Even if building a depth-map is faster nowadays, the fusion part implies a heavy computational cost [7], which hinders the use of such methods for our application.…”
Section: A Surface-based Methodsmentioning
confidence: 99%
“…Most of methods need some prior information as auxiliary to get more precise results. According to the taxonomy of Seitz et al [4], MVS algorithms can be divided into four categories: 3D volumetric approaches [5,6], surface evolution techniques [7,8], algorithms that compute and merge depth maps [9,10], and techniques that grow regions or surfaces starting from a set of extracted features or seed points [3,11], our algorithm apparently falls into the last category.…”
Section: Related Workmentioning
confidence: 99%
“…Depending on size, number and shape of sampling geometry, our approach simulates exposing the scanned surface to a fluid pushing through the model. The idea of generating watertight models from previously generated datasets has been documented before [17], [16], so the novelties here are:…”
Section: Algorithmmentioning
confidence: 99%