A new dynamical model for solving rotation averaging problem

11/23/2021
by   Zinaid Kapić, et al.
0

The paper analyzes the rotation averaging problem as a minimization problem for a potential function of the corresponding gradient system. This dynamical system is one generalization of the famous Kuramoto model on special orthogonal group SO(3), which is known as the non-Abelian Kuramoto model. We have proposed a novel method for finding weighted and unweighted rotation average. In order to verify the correctness of our algorithms, we have compared the simulation results with geometric and projected average using real and random data sets. In particular, we have discovered that our method gives approximately the same results as geometric average.

READ FULL TEXT
research
03/18/2021

Efficient Algorithms for Rotation Averaging Problems

The rotation averaging problem is a fundamental task in computer vision ...
research
11/24/2021

Interpolating Rotations with Non-abelian Kuramoto Model on the 3-Sphere

The paper presents a novel method for interpolating rotations based on t...
research
02/13/2020

A Provably Robust Multiple Rotation Averaging Scheme for SO(2)

We give adversarial robustness results for synchronization on the rotati...
research
09/16/2021

Rotation Averaging in a Split Second: A Primal-Dual Method and a Closed-Form for Cycle Graphs

A cornerstone of geometric reconstruction, rotation averaging seeks the ...
research
03/09/2023

Revisiting Rotation Averaging: Uncertainties and Robust Losses

In this paper, we revisit the rotation averaging problem applied in glob...
research
09/11/2023

Robust Single Rotation Averaging Revisited

In this work, we propose a novel method for robust single rotation avera...
research
09/06/2023

Narrative as a Dynamical System

There is increasing evidence that human activity in general, and narrati...

Please sign up or login with your details

Forgot password? Click here to reset