Continuous Global Optimization in Multiview 3D Reconstruction

被引:105
作者
Kolev, Kalin [1 ]
Klodt, Maria [1 ]
Brox, Thomas [1 ]
Cremers, Daniel [1 ]
机构
[1] Univ Bonn, Comp Vis Grp, D-53117 Bonn, Germany
关键词
Continuous global minimization; Convex optimization; Multiview 3D reconstruction; GRAPH-CUTS; STEREO; SEGMENTATION; FLOW;
D O I
10.1007/s11263-009-0233-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this article, we introduce a new global optimization method to the field of multiview 3D reconstruction. While global minimization has been proposed in a discrete formulation in form of the maxflow-mincut framework, we suggest the use of a continuous convex relaxation scheme. Specifically, we propose to cast the problem of 3D shape reconstruction as one of minimizing a spatially continuous convex functional. In qualitative and quantitative evaluation we demonstrate several advantages of the proposed continuous formulation over the discrete graph cut solution. Firstly, geometric properties such as weighted boundary length and surface area are represented in a numerically consistent manner: The continuous convex relaxation assures that the algorithm does not suffer from metrication errors in the sense that the reconstruction converges to the continuous solution as the spatial resolution is increased. Moreover, memory requirements are reduced, allowing for globally optimal reconstructions at higher resolutions. We study three different energy models for multiview reconstruction, which are based on a common variational template unifying regional volumetric terms and on-surface photoconsistency. The three models use data measurements at increasing levels of sophistication. While the first two approaches are based on a classical silhouette-based volume subdivision, the third one relies on stereo information to define regional costs. Furthermore, this scheme is exploited to compute a precise photoconsistency measure as opposed to the classical estimation. All three models are compared on standard data sets demonstrating their advantages and shortcomings. For the third one, which gives the most accurate results, a more exhaustive qualitative and quantitative evaluation is presented.
引用
收藏
页码:80 / 96
页数:17
相关论文
共 40 条
[1]  
[Anonymous], TR1404 HARV COMP SCI
[2]  
[Anonymous], P EUR C COMP VIS ECC
[3]   Globally minimal surfaces by continuous maximal flows [J].
Appleton, B ;
Talbot, H .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (01) :106-118
[4]   Globally optimal Geodesic Active Contours [J].
Appleton, B ;
Talbot, H .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2005, 23 (01) :67-86
[5]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[6]  
Boykov Y., 2006, British machine vision conference, V3, P1149
[7]  
BRESSON X, 2005, CAM0504 U CAL LOS AN
[8]  
CASELLES V, 1995, FIFTH INTERNATIONAL CONFERENCE ON COMPUTER VISION, PROCEEDINGS, P694, DOI 10.1109/ICCV.1995.466871
[9]  
Chambolle A, 2005, LECT NOTES COMPUT SC, V3757, P136, DOI 10.1007/11585978_10
[10]   Algorithms for finding global minimizers of image segmentation and denoising models [J].
Chan, Tony F. ;
Esedoglu, Selim ;
Nikolova, Mila .
SIAM JOURNAL ON APPLIED MATHEMATICS, 2006, 66 (05) :1632-1648