Superpixel Soup: Monocular Dense 3D Reconstruction of a Complex Dynamic Scene

被引:15
作者
Kumar, Suryansh [1 ,2 ]
Dai, Yuchao [3 ]
Li, Hongdong [4 ]
机构
[1] Swiss Fed Inst Technol, Comp Vis, CH-8092 Zaurich, Switzerland
[2] Australian Natl Univ, Canberra, ACT 0200, Australia
[3] Northwestern Polytech Univ, Fremont, CA USA
[4] Australian Natl Univ, ARC Ctr Excellent Robot Vis, Canberra, ACT, Australia
关键词
Three-dimensional displays; Dynamics; Image reconstruction; Heuristic algorithms; Cameras; Motion segmentation; Surface reconstruction; Dense 3D reconstruction; perspective camera; as-rigid-as-possible; relative scale ambiguity; structure from motion;
D O I
10.1109/TPAMI.2019.2955131
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work addresses the task of dense 3D reconstruction of a complex dynamic scene from images. The prevailing idea to solve this task is composed of a sequence of steps and is dependent on the success of several pipelines in its execution. To overcome such limitations with the existing algorithm, we propose a unified approach to solve this problem. We assume that a dynamic scene can be approximated by numerous piecewise planar surfaces, where each planar surface enjoys its own rigid motion, and the global change in the scene between two frames is as-rigid-as-possible (ARAP). Consequently, our model of a dynamic scene reduces to a soup of planar structures and rigid motion of these local planar structures. Using planar over-segmentation of the scene, we reduce this task to solving a "3D jigsaw puzzle" problem. Hence, the task boils down to correctly assemble each rigid piece to construct a 3D shape that complies with the geometry of the scene under the ARAP assumption. Further, we show that our approach provides an effective solution to the inherent scale-ambiguity in structure-from-motion under perspective projection. We provide extensive experimental results and evaluation on several benchmark datasets. Quantitative comparison with competing approaches shows state-of-the-art performance.
引用
收藏
页码:1705 / 1717
页数:13
相关论文
共 61 条
[1]   SLIC Superpixels Compared to State-of-the-Art Superpixel Methods [J].
Achanta, Radhakrishna ;
Shaji, Appu ;
Smith, Kevin ;
Lucchi, Aurelien ;
Fua, Pascal ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2274-2281
[2]   Building Rome in a Day [J].
Agarwal, Sameer ;
Furukawa, Yasutaka ;
Snavely, Noah ;
Simon, Ian ;
Curless, Brian ;
Seitz, Steven M. ;
Szeliski, Richard .
COMMUNICATIONS OF THE ACM, 2011, 54 (10) :105-112
[3]   Trajectory Space: A Dual Representation for Nonrigid Structure from Motion [J].
Akhter, Ijaz ;
Sheikh, Yaser ;
Khan, Sohaib ;
Kanade, Takeo .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (07) :1442-1456
[4]  
[Anonymous], 2017, IEEE INT C COMP VIS
[5]   Flow Fields: Dense Correspondence Fields for Highly Accurate Large Displacement Optical Flow Estimation [J].
Bailer, Christian ;
Taetz, Bertram ;
Stricker, Didier .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :4015-4023
[6]   Interior-point methods for nonconvex nonlinear programming: cubic regularization [J].
Benson, Hande Y. ;
Shanno, David F. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 58 (02) :323-346
[7]   Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions [J].
Benson, HY ;
Vanderbei, RJ ;
Shanno, DF .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 23 (02) :257-272
[8]   The least-disturbance principle and weak constraints [J].
Blake, Andrew .
PATTERN RECOGNITION LETTERS, 1983, 1 (5-6) :393-399
[9]  
Blake Andrew, 1987, Visual Reconstruction, P1
[10]  
Bleyer M., 2011, 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), P3081, DOI 10.1109/CVPR.2011.5995581