Square Root Marginalization for Sliding-Window Bundle Adjustment

被引:8
作者
Demmel, Nikolaus [1 ]
Schubert, David [1 ]
Sommer, Christiane [1 ]
Cremers, Daniel [1 ]
Usenko, Vladyslav [1 ]
机构
[1] Tech Univ Munich, Munich, Germany
来源
2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021) | 2021年
关键词
GENERALIZED INVERSES;
D O I
10.1109/ICCV48922.2021.01301
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose a novel square root sliding-window bundle adjustment suitable for real-time odometry applications. The square root formulation pervades three major aspects of our optimization-based sliding-window estimator: for bundle adjustment we eliminate landmark variables with nullspace projection; to store the marginalization prior we employ a matrix square root of the Hessian; and when marginalizing old poses we avoid forming normal equations and update the square root prior directly with a specialized QR decomposition. We show that the proposed square root marginalization is algebraically equivalent to the conventional use of Schur complement (SC) on the Hessian. Moreover, it elegantly deals with rank-deficient Jacobians producing a prior equivalent to SC with Moore-Penrose inverse. Our evaluation of visual and visual-inertial odometry on real-world datasets demonstrates that the proposed estimator is 36% faster than the baseline. It furthermore shows that in single precision, conventional Hessian-based marginalization leads to numeric failures and reduced accuracy. We analyse numeric properties of the marginalization prior to explain why our square root form does not suffer from the same effect and therefore entails superior performance.
引用
收藏
页码:13240 / 13248
页数:9
相关论文
共 30 条
[1]  
Bierman G. J., 2006, Factorization methods for discrete sequential estimation
[2]   GENERALIZED INVERSE FORMULAS USING SCHUR COMPLEMENT [J].
BURNS, F ;
CARLSON, D ;
HAYNSWORTH, E ;
MARKHAM, T .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (02) :254-259
[3]  
Burri Michael, 2016, INT J ROBOTICS RES I, P3
[4]   GENERALIZATION OF SCHUR COMPLEMENT BY MEANS OF MOORE-PENROSE INVERSE [J].
CARLSON, D ;
HAYNSWORTH, E ;
MARKHAM, T .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (01) :169-175
[5]   Square root SAM: Simultaneous localization and mapping via square root information smoothing [J].
Dellaert, Frank ;
Kaess, Michael .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2006, 25 (12) :1181-1203
[6]  
Demmel Nikolaus, 2021, C COMP VIS PATT REC
[7]   Direct Sparse Odometry [J].
Engel, Jakob ;
Koltun, Vladlen ;
Cremers, Daniel .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2018, 40 (03) :611-625
[8]  
Geiger A, 2012, PROC CVPR IEEE, P3354, DOI 10.1109/CVPR.2012.6248074
[9]  
Golub G. H., 2012, Matrix computation, V3
[10]  
Guennebaud G., 2010, Eigen v3