2013 IEEE International Conference on Computer Vision 2013
DOI: 10.1109/iccv.2013.70
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Robust Large-Scale Rotation Averaging

Abstract: In this paper we address the problem of robust and efficient averaging of relative 3D rotations. Apart from having an interesting geometric structure, robust rotation averaging addresses the need for a good initialization for largescale optimization used in structure-from-motion pipelines. Such pipelines often use unstructured image datasets harvested from the internet thereby requiring an initialization method that is robust to outliers. Our approach works on the Lie group structure of 3D rotations and solves… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
278
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 230 publications
(278 citation statements)
references
References 16 publications
0
278
0
Order By: Relevance
“…Thus, methods have been sought after to globally average pairwise camera rotations in a robust way (Hartley et al, 2011, Chatterjee andGovindu, 2013). These methods rely on image features only for the robust computation of relative image orientations.…”
Section: Handling Large Bundle Blocksmentioning
confidence: 99%
“…Thus, methods have been sought after to globally average pairwise camera rotations in a robust way (Hartley et al, 2011, Chatterjee andGovindu, 2013). These methods rely on image features only for the robust computation of relative image orientations.…”
Section: Handling Large Bundle Blocksmentioning
confidence: 99%
“…Even if the size of this linear system is proportional to the number of absolute transformations, its sparsity is usually exploited in solvers such as g 2 o, resulting in an algorithm with a reasonable computational time for a small or medium sized problem. Using this formalism, several algorithms have been recently proposed to perform robust motion averaging (i.e when loop closures contain erroneous measurements): [1] and [8] proposed re-weighted schemes; [28] and [10] introduced auxiliary variables that in fact correspond to using a robust kernel as it was recently shown in [30] in the context of bundle adjustment; [22] proposed a consensus based algorithm which optimizes clusters of loop closures with a GN and checks their consistency with statistical tests. None of these approaches fulfill our first two requirements (Computational efficiency and Memory efficiency).…”
Section: Related Workmentioning
confidence: 99%
“…More specifically, at time instant k − 1, the posterior distribution of the state is assumed to have the following factorized form: (8) where…”
Section: Estimated Statementioning
confidence: 99%
See 1 more Smart Citation
“…The Weiszfeld algorithm under 1 norm is applied in (Hartley et al, 2011) to increase robustness. (Chatterjee & Govindu., 2013) refine their 1 solution in an iteratively reweighted least squares process in which they incorporate the Huber estimator (Huber, 1964), i.e. an M-estimator.…”
Section: Related Workmentioning
confidence: 99%