On the Robustness of Multi-View Rotation Averaging
- URL: http://arxiv.org/abs/2102.05454v1
- Date: Tue, 9 Feb 2021 05:47:37 GMT
- Title: On the Robustness of Multi-View Rotation Averaging
- Authors: Xinyi Li, Haibin Ling
- Abstract summary: We introduce the $epsilon$-cycle consistency term into the solver.
We implicitly constrain the negative effect of erroneous measurements by weight reducing.
Experiment results demonstrate that our proposed approach outperforms state of the arts on various benchmarks.
- Score: 77.09542018140823
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Rotation averaging is a synchronization process on single or multiple
rotation groups, and is a fundamental problem in many computer vision tasks
such as multi-view structure from motion (SfM). Specifically, rotation
averaging involves the recovery of an underlying pose-graph consistency from
pairwise relative camera poses. Specifically, given pairwise motion in rotation
groups, especially 3-dimensional rotation groups (\eg, $\mathbb{SO}(3)$), one
is interested in recovering the original signal of multiple rotations with
respect to a fixed frame. In this paper, we propose a robust framework to solve
multiple rotation averaging problem, especially in the cases that a significant
amount of noisy measurements are present. By introducing the $\epsilon$-cycle
consistency term into the solver, we enable the robust initialization scheme to
be implemented into the IRLS solver. Instead of conducting the costly edge
removal, we implicitly constrain the negative effect of erroneous measurements
by weight reducing, such that IRLS failures caused by poor initialization can
be effectively avoided. Experiment results demonstrate that our proposed
approach outperforms state of the arts on various benchmarks.
Related papers
- Rotation Averaging: A Primal-Dual Method and Closed-Forms in Cycle Graphs [6.511636092857915]
A benchmark of geometric reconstruction, averaging seeks the set of absolute settings that optimally explains a set of measured relative orientations between them.
We propose a novel primal-dual cycle method motivated by the widely accepted spectral theory.
arXiv Detail & Related papers (2024-05-29T21:46:39Z) - Learning Unorthogonalized Matrices for Rotation Estimation [83.94986875750455]
Estimating 3D rotations is a common procedure for 3D computer vision.
One form of representation -- rotation matrices -- is popular due to its continuity.
We propose unorthogonalized Pseudo' Rotation Matrices (PRoM)
arXiv Detail & Related papers (2023-12-01T09:56:29Z) - Multi-Irreducible Spectral Synchronization for Robust Rotation Averaging [1.2289361708127877]
We show how to estimate a set of unknown orientations $R_1,..., R_N in SO$, given noisy measurements.
Results indicate how to devise measurement networks that are emph guaranteed to achieve accurate estimation.
arXiv Detail & Related papers (2023-11-28T06:25:26Z) - EAR-Net: Pursuing End-to-End Absolute Rotations from Multi-View Images [17.386735294534738]
Absolute rotation estimation is an important topic in 3D computer vision.
We propose an End-to-end method for estimating Absolution Rotations from multi-view images based on deep neural Networks.
arXiv Detail & Related papers (2023-10-16T04:21:07Z) - Unfolding Framework with Prior of Convolution-Transformer Mixture and
Uncertainty Estimation for Video Snapshot Compressive Imaging [7.601695814245209]
We consider the problem of video snapshot compressive imaging (SCI), where sequential high-speed frames are modulated by different masks and captured by a single measurement.
By combining optimization algorithms and neural networks, deep unfolding networks (DUNs) score tremendous achievements in solving inverse problems.
arXiv Detail & Related papers (2023-06-20T06:25:48Z) - Revisiting Rotation Averaging: Uncertainties and Robust Losses [51.64986160468128]
We argue that the main problem of current methods is the minimized cost function that is only weakly connected with the input data via the estimated epipolar.
We propose to better model the underlying noise distributions by directly propagating the uncertainty from the point correspondences into the rotation averaging.
arXiv Detail & Related papers (2023-03-09T11:51:20Z) - RAGO: Recurrent Graph Optimizer For Multiple Rotation Averaging [62.315673415889314]
This paper proposes a deep recurrent Rotation Averaging Graph (RAGO) for Multiple Rotation Averaging (MRA)
Our framework is a real-time learning-to-optimize rotation averaging graph with a tiny size deployed for real-world applications.
arXiv Detail & Related papers (2022-12-14T13:19:40Z) - Learning Iterative Robust Transformation Synchronization [71.73273007900717]
We propose to use graph neural networks (GNNs) to learn transformation synchronization.
In this work, we avoid handcrafting robust loss functions, and propose to use graph neural networks (GNNs) to learn transformation synchronization.
arXiv Detail & Related papers (2021-11-01T07:03:14Z) - An accelerated expectation-maximization for multi-reference alignment [11.168121941015013]
We propose a new computational framework, called Synch-EM, that consists of angular synchronization followed by expectation-maximization (EM)
The synchronization step results in a concentrated distribution of rotations; this distribution is learned and then incorporated into the EM as a Bayesian prior.
We show by extensive numerical experiments that the proposed framework can significantly accelerate EM for MRA in high noise levels, occasionally by a few orders of magnitude, without degrading the reconstruction quality.
arXiv Detail & Related papers (2021-05-16T07:25:51Z) - Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
We propose a novel optimization backbone for visual SLAM systems.
We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems.
Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
arXiv Detail & Related papers (2020-11-02T18:02:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.