ReSync: Riemannian Subgradient-based Robust Rotation Synchronization

• URL: http://arxiv.org/abs/2305.15136v2
• Date: Wed, 6 Dec 2023 02:00:24 GMT
• Title: ReSync: Riemannian Subgradient-based Robust Rotation Synchronization
• Authors: Huikang Liu, Xiao Li, Anthony Man-Cho So
• Abstract summary: This work presents ReSync, a subgradient-based algorithm for solving the robust synchronization problem. Results demonstrate the effectiveness of ReSync under appropriate conditions.
• Score: 26.151024152071784
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Local-consistent Transformation Learning for Rotation-invariant Point Cloud Analysis [61.04787144322498]
  We propose a Local-consistent Transformation (LocoTrans) learning strategy for point shape analysis. We first construct the local-consistent reference frame (LCRF) by considering the symmetry of the two axes in LRF. As the consistency only exists in local regions, the relative pose information is still lost in the intermediate layers of the network.
  arXiv  Detail & Related papers  (2024-03-17T06:40:50Z)
• Topological quantum synchronization of fractionalized spins [0.0]
  We show that breaking SU(2) symmetry and applying a global spin-lowering dissipator achieves synchronization of fractionalized spins. A direct consequence is that permutation symmetries are not required for the dynamics to be synchronized.
  arXiv  Detail & Related papers  (2023-09-05T05:30:15Z)
• Iterative Sketching for Secure Coded Regression [66.53950020718021]
  We propose methods for speeding up distributed linear regression. Specifically, we randomly rotate the basis of the system of equations and then subsample blocks, to simultaneously secure the information and reduce the dimension of the regression problem.
  arXiv  Detail & Related papers  (2023-08-08T11:10:42Z)
• Rotation Synchronization via Deep Matrix Factorization [24.153207403324917]
  We focus on the formulation of rotation synchronization via neural networks. Inspired by deep matrix completion, we express rotation synchronization in terms of matrix factorization with a deep neural network. Our formulation exhibits implicit regularization properties and, more importantly, is unsupervised.
  arXiv  Detail & Related papers  (2023-05-09T08:46:05Z)
• From Deterioration to Acceleration: A Calibration Approach to Rehabilitating Step Asynchronism in Federated Optimization [13.755421424240048]
  We propose a new algorithm textttFedaGrac, which calibrates the local direction to a predictive global orientation. We theoretically prove that textttFedaGrac holds an improved order of convergence rate than the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-12-17T07:26:31Z)
• 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)
• PR-RRN: Pairwise-Regularized Residual-Recursive Networks for Non-rigid Structure-from-Motion [58.75694870260649]
  PR-RRN is a novel neural-network based method for Non-rigid Structure-from-Motion. We propose two new pairwise regularizations to further regularize the reconstruction. Our approach achieves state-of-the-art performance on CMU MOCAP and PASCAL3D+ dataset.
  arXiv  Detail & Related papers  (2021-08-17T08:39:02Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• Joint Community Detection and Rotational Synchronization via Semidefinite Programming [17.845257705485533]
  In the presence of heterogeneous data, where randomly rotated objects fall into multiple underlying categories, it is challenging to simultaneously classify them into clusters and synchronize them based on pairwise relations. We propose a series of semidefinite relaxations, and prove their exact recovery when extending the celebrated block model to this new setting. Numerical experiments demonstrate the efficacy of our proposed algorithms and confirm our theoretical result which indicates a sharp phase transition for exact recovery.
  arXiv  Detail & Related papers  (2021-05-13T01:40:20Z)
• 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)
• Message Passing Least Squares Framework and its Application to Rotation Synchronization [16.650654530240566]
  We first describe our theoretically guaranteed message passing algorithm that estimates the corruption levels of the measured group ratios. We then propose a novel reweighted least squares method to estimate the group elements, where the weights are iteratively updated using the estimated corruption levels. We demonstrate the superior performance of our algorithm over state-of-the-art methods for rotation synchronization using both synthetic and real data.
  arXiv  Detail & Related papers  (2020-07-27T15:39:19Z)

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.