A Consensus-Based Framework for Distributed Bundle Adjustment

被引:41
作者
Eriksson, Anders [1 ]
Bastian, John [2 ]
Chin, Tat-Jun [2 ]
Isaksson, Mats [3 ]
机构
[1] Queensland Univ Technol, Sch Elect Engn & Comp Sci, Brisbane, Qld, Australia
[2] Univ Adelaide, Sch Comp Sci, Adelaide, SA, Australia
[3] Colorado State Univ, Elect & Comp Engn Dept, Ft Collins, CO 80523 USA
来源
2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2016年
基金
澳大利亚研究理事会;
关键词
D O I
10.1109/CVPR.2016.194
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we study large-scale optimization problems in multi-view geometry, in particular the Bundle Adjustment problem. In its conventional formulation, the complexity of existing solvers scale poorly with problem size, hence this component of the Structure-from-Motion pipeline can quickly become a bottle-neck. Here we present a novel formulation for solving bundle adjustment in a truly distributed manner using consensus based optimization methods. Our algorithm is presented with a concise derivation based on proximal splitting, along with a theoretical proof of convergence and brief discussions on complexity and implementation. Experiments on a number of real image datasets convincingly demonstrates the potential of the proposed method by outperforming the conventional bundle adjustment formulation by orders of magnitude.
引用
收藏
页码:1754 / 1762
页数:9
相关论文
共 24 条
[1]  
Agarwal S., Ceres Solver: Tutorial & Reference
[2]  
Agarwal S, 2010, LECT NOTES COMPUT SC, V6312, P29, DOI 10.1007/978-3-642-15552-9_3
[3]  
[Anonymous], 2006, PHOTOGRAMMETRIC COMP
[4]  
[Anonymous], 1996, CONSTRAINED OPTIMIZA
[5]  
[Anonymous], 2012, ADV NEURAL INFORM PR
[6]  
[Anonymous], OUTLIER REMOVAL USIN
[7]  
[Anonymous], SCAND C IM AN SCIA 2
[8]  
[Anonymous], 2009, 12 IEEE INT C COMP V
[9]  
Bertsekas D. P., 1989, PARALLEL DISTRIBUTED, V23
[10]  
Byröd M, 2010, LECT NOTES COMPUT SC, V6312, P114, DOI 10.1007/978-3-642-15552-9_9