Certifiably Optimal Anisotropic Rotation Averaging
Paper in proceeding, 2025

Rotation averaging is a key subproblem in applications of computer vision and robotics. Many methods for solving this problem exist, and there are also several theoretical results analyzing difficulty and optimality. However, one aspect that most of these have in common is a focus on the isotropic setting, where the intrinsic uncertainties in the measurements are not fully incorporated into the resulting optimization task. Recent empirical results suggest that moving to an anisotropic framework, where these uncertainties are explicitly included, can result in an improvement of solution quality. However, global optimization for rotation averaging has remained a challenge in this scenario. In this work we show how anisotropic costs can be incorporated in certifiably optimal rotation averaging. We also demonstrate how existing solvers, designed for isotropic situations, fail in the anisotropic setting. Finally, we propose a stronger relaxation and empirically show that it recovers global optima in all tested datasets and leads to more accurate reconstructions in almost all scenes.

rotation averaging

structure from motion

semidefinite programming

convex optimization

Author

Carl Olsson

Lund University

Yaroslava Lochman

Chalmers, Electrical Engineering, Signal Processing and Biomedical Engineering

Johan Malmport

Lund University

Christopher Zach

Chalmers, Electrical Engineering, Signal Processing and Biomedical Engineering

Proceedings of the 2025 IEEE/CVF International Conference on Computer Vision

14856-14865

2025 IEEE/CVF International Conference on Computer Vision (ICCV)
Honolulu, USA,

Subject Categories (SSIF 2025)

Computer graphics and computer vision

Computational Mathematics

Related datasets

URI: https://github.com/ylochman/anisotropic-ra

More information

Latest update

12/2/2025