In this paper, we present results and experiments with several methods for bundle adjustment, producing the fastest bundle adjuster ever published. The fastest methods work with the well known reduced camera system and handle the block-sparse pattern arising in the reduced camera system in a natural way. Adapting to the naturally arising block-sparsity allows the use of BLAS3, efficient memory handling, fast variable ordering, and customized sparse solving all at the same time. We present two methods, one using exact minimum degree ordering and block-based LDL solving, and one using block-based preconditioned conjugate gradient, both on the reduced camera system. We show experimentally that the adaptation to the natural block sparsity allows both these methods to perform better than previous ones. Further speed improvements are achieved by the novel use of embedded point iterations. The embedded point iterations take place inside each camera update step, yielding a higher cost decrease from each camera update step. This is especially true for points projecting far out on the flatter region of the robustifier.
조회 수 15558 댓글 0
|Yekeun Jeong, David Nister, Drew Steedly, Richard Szeliski, In So Kweon
|IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Prev Euclidean structure from confocal conics: Theory and application to camera calibration Euclidean structure from confocal conics: Theory and application to camera calibration 2010.05.04by 김준식 Visual Tracking for Non-Rigid Objects using Rao-Blackwellized... Next Visual Tracking for Non-Rigid Objects using Rao-Blackwellized... 2010.02.15by