Linearly Solving Robust Rotation Estimation

• URL: http://arxiv.org/abs/2506.11547v1
• Date: Fri, 13 Jun 2025 08:00:03 GMT
• Title: Linearly Solving Robust Rotation Estimation
• Authors: Yinlong Liu, Tianyu Huang, Zhi-Xin Yang,
• Abstract summary: We propose an easily understandable-based method to solve rotation estimation problems.<n>The proposed method exhibits exceptional robustness to noise and outliers and can be computed in parallel with graphics processing units.<n>We conduct controlled experiments and demonstrate the superiority of our proposed method.
• Score: 11.8260722786548
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rotation estimation plays a fundamental role in computer vision and robot tasks, and extremely robust rotation estimation is significantly useful for safety-critical applications. Typically, estimating a rotation is considered a non-linear and non-convex optimization problem that requires careful design. However, in this paper, we provide some new perspectives that solving a rotation estimation problem can be reformulated as solving a linear model fitting problem without dropping any constraints and without introducing any singularities. In addition, we explore the dual structure of a rotation motion, revealing that it can be represented as a great circle on a quaternion sphere surface. Accordingly, we propose an easily understandable voting-based method to solve rotation estimation. The proposed method exhibits exceptional robustness to noise and outliers and can be computed in parallel with graphics processing units (GPUs) effortlessly. Particularly, leveraging the power of GPUs, the proposed method can obtain a satisfactory rotation solution for large-scale($10^6$) and severely corrupted (99$\%$ outlier ratio) rotation estimation problems under 0.5 seconds. Furthermore, to validate our theoretical framework and demonstrate the superiority of our proposed method, we conduct controlled experiments and real-world dataset experiments. These experiments provide compelling evidence supporting the effectiveness and robustness of our approach in solving rotation estimation problems.

Related papers

• Accelerating Outlier-robust Rotation Estimation by Stereographic Projection [11.031734331985975]
  We propose an efficient and robust rotation estimation method.<n>Our method can solve large-scale ($106$ points) and severely corrupted (90% outlier rate) rotation estimation problems within 0.07 seconds.
  arXiv  Detail & Related papers  (2025-02-10T10:37:36Z)
• Multiple Rotation Averaging with Constrained Reweighting Deep Matrix Factorization [22.487393413405954]
  Multiple rotation averaging plays a crucial role in computer vision and robotics domains. This paper proposes an effective rotation averaging method for mining data patterns in a learning manner.
  arXiv  Detail & Related papers  (2024-09-15T16:50:27Z)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Deep Projective Rotation Estimation through Relative Supervision [31.05330535795121]
  Deep learning has offered a way to develop image-based orientation estimators. These estimators often require training on a large labeled dataset. We propose a new algorithm for selfsupervised orientation estimation.
  arXiv  Detail & Related papers  (2022-11-21T04:58:07Z)
• DRKF: Distilled Rotated Kernel Fusion for Efficient Rotation Invariant Descriptors in Local Feature Matching [9.68840174997957]
  Rotated Fusion Kernel (RKF) imposes rotations on the convolution kernel to improve the inherent nature of CNN. MOFA aggregates features extracted from multiple rotated versions of the input image. Our method can outperform other state-of-the-art techniques when exposed to large rotation variations.
  arXiv  Detail & Related papers  (2022-09-22T10:29:17Z)
• E-Graph: Minimal Solution for Rigid Rotation with Extensibility Graphs [61.552125054227595]
  A new minimal solution is proposed to solve relative rotation estimation between two images without overlapping areas. Based on E-Graph, the rotation estimation problem becomes simpler and more elegant. We embed our rotation estimation strategy into a complete camera tracking and mapping system which obtains 6-DoF camera poses and a dense 3D mesh model.
  arXiv  Detail & Related papers  (2022-07-20T16:11:48Z)
• The Probabilistic Normal Epipolar Constraint for Frame-To-Frame Rotation Optimization under Uncertain Feature Positions [53.478856119297284]
  We introduce the probabilistic normal epipolar constraint (PNEC) that overcomes the limitation by accounting for anisotropic and inhomogeneous uncertainties in the feature positions. In experiments on synthetic data, we demonstrate that the novel PNEC yields more accurate rotation estimates than the original NEC. We integrate the proposed method into a state-of-the-art monocular rotation-only odometry system and achieve consistently improved results for the real-world KITTI dataset.
  arXiv  Detail & Related papers  (2022-04-05T14:47:11Z)
• On the Robustness of Multi-View Rotation Averaging [77.09542018140823]
  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.
  arXiv  Detail & Related papers  (2021-02-09T05:47:37Z)
• On the Tightness of Semidefinite Relaxations for Rotation Estimation [49.49997461835141]
  We show that semidefinite relaxations have been successful in numerous applications in computer vision and robotics. A general framework based on tools from algebraic geometry is introduced for analyzing semidefinite relaxations. We show that for some problem, an appropriate pararization guarantees tight relaxations.
  arXiv  Detail & Related papers  (2021-01-06T15:42:02Z)
• 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.