arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.01843cs.CV
收藏

大范围重建的平方根光束法平差

Square Root Bundle Adjustment for Large-Scale Reconstruction

Technical University of Munich(慕尼黑工业大学)

Nikolaus Demmel, Christiane Sommer, Daniel Cremers, Vladyslav Usenko

摘要:

我们提出了一个新的制定光束法平差问题,它依赖于零空间边缘化的地标变量的QR分解。我们的方法,我们称之为平方根光束法平差,是代数上等价于常用的舒尔补技巧,提高了计算的数值稳定性,并允许解决大规模的光束法平差问题的单精度浮点数。我们在现实世界的实验与BAL数据集,即使在单精度的的建议求解器实现平均同样准确的解决方案相比,舒尔互补求解器使用双精度的。它运行速度明显更快,但在密集问题上可能需要更大量的内存。建议制定依赖于简单的线性代数运算,并开辟了有效的实现捆绑调整的硬件平台上优化的单精度线性代数处理的方式。

英文摘要:

We propose a new formulation for the bundle adjustment problem which relies on nullspace marginalization of landmark variables by QR decomposition. Our approach, which we call square root bundle adjustment, is algebraically equivalent to the commonly used Schur complement trick, improves the numeric stability of computations, and allows for solving large-scale bundle adjustment problems with single-precision floating-point numbers. We show in real-world experiments with the BAL datasets that even in single precision the proposed solver achieves on average equally accurate solutions compared to Schur complement solvers using double precision. It runs significantly faster, but can require larger amounts of memory on dense problems. The proposed formulation relies on simple linear algebra operations and opens the way for efficient implementations of bundle adjustment on hardware platforms optimized for single-precision linear algebra processing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑