ReSync: Riemannian Subgradient-based Robust Rotation Synchronization

Author name not available (Why is that?)

Publication date: 24 May 2023

Abstract: This work presents ReSync, a Riemannian subgradient-based algorithm for solving the robust rotation synchronization problem, which arises in various engineering applications. ReSync solves a least-unsquared minimization formulation over the rotation group, which is nonsmooth and nonconvex, and aims at recovering the underlying rotations directly. We provide strong theoretical guarantees for ReSync under the random corruption setting. Specifically, we first show that the initialization procedure of ReSync yields a proper initial point that lies in a local region around the ground-truth rotations. We next establish the weak sharpness property of the aforementioned formulation and then utilize this property to derive the local linear convergence of ReSync to the ground-truth rotations. By combining these guarantees, we conclude that ReSync converges linearly to the ground-truth rotations under appropriate conditions. Experiment results demonstrate the effectiveness of ReSync.

Has companion code repository: https://github.com/huikang2019/resync

This page was built for publication: ReSync: Riemannian Subgradient-based Robust Rotation Synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437808)