Procedings of the British Machine Vision Conference 2010 2010
DOI: 10.5244/c.24.102
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Sparse Bundle Adjustment

Abstract: Sparse Bundle Adjustment (SBA) is a method for simultaneously optimizing a set of camera poses and visible points. It exploits the sparse primary structure of the problem, where connections exist just between points and cameras. In this paper, we implement an efficient version of SBA for systems where the secondary structure (relations among cameras) is also sparse. The method, which we call Sparse SBA (sSBA), integrates an efficient method for setting up the linear subproblem with recent advances in direct sp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
89
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 128 publications
(90 citation statements)
references
References 15 publications
1
89
0
Order By: Relevance
“…We remark that Schur complement is a common tool in computer vision [22], [20]. However, smart factors do more than Schur complement: they are able to manage degenerate problems, exploiting domain-specific knowledge.…”
Section: A Elimination In Linear(ized) Factor Graphsmentioning
confidence: 99%
“…We remark that Schur complement is a common tool in computer vision [22], [20]. However, smart factors do more than Schur complement: they are able to manage degenerate problems, exploiting domain-specific knowledge.…”
Section: A Elimination In Linear(ized) Factor Graphsmentioning
confidence: 99%
“…This leads to a robust optimization task and an expected improvement of the camera pose path. One of the most successful algorithms is the "sparse bundle adjustment" (Konolige, 2010). The bundle adjustment procedure can be part of the transformation estimation step, or it can be a separate post-processing step.…”
Section: Loop Closurementioning
confidence: 99%
“…This non linear least weighted square problem can be efficiently resolved through several numerical implementations rooted in Gauss-Newton methods, that conveniently exploit the structure of the Jacobian associated to Equation (16), see e.g. (Agarwal et al, 2010, Konolige andGarage, 2010) for a review and a more detailed discussion.…”
Section: Bundle Adjustment With Planar Constraintmentioning
confidence: 99%