Cramer-Rao bounds for synchronization of rotations
From MaRDI portal
Abstract: Synchronization of rotations is the problem of estimating a set of rotations R_i in SO(n), i = 1, ..., N, based on noisy measurements of relative rotations R_i R_j^T. This fundamental problem has found many recent applications, most importantly in structural biology. We provide a framework to study synchronization as estimation on Riemannian manifolds for arbitrary n under a large family of noise models. The noise models we address encompass zero-mean isotropic noise, and we develop tools for Gaussian-like as well as heavy-tail types of noise in particular. As a main contribution, we derive the Cram'er-Rao bounds of synchronization, that is, lower-bounds on the variance of unbiased estimators. We find that these bounds are structured by the pseudoinverse of the measurement graph Laplacian, where edge weights are proportional to measurement quality. We leverage this to provide interpretation in terms of random walks and visualization tools for these bounds in both the anchored and anchor-free scenarios. Similar bounds previously established were limited to rotations in the plane and Gaussian-like noise.
Recommendations
- Exact and stable recovery of rotations for robust synchronization
- Near-optimal bounds for phase synchronization
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Cramér-Rao lower bounds for the synchronization of UWB signals
- Synchronization by Two-Way Message Exchanges: Cramér-Rao Bounds, Approximate Maximum Likelihood, and Offshore Submarine Positioning
- Exact Minimax Estimation for Phase Synchronization
- Optimal orthogonal group synchronization and rotation group synchronization
- Frequency domain intepretation of the Cramér-Rao bound for carrier and clock synchronization
- Inferring Synchronization under Limited Observability
- scientific article; zbMATH DE number 2152082
Cited in
(17)- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Synchronization problems in computer vision with closed-form solutions
- The noise-sensitivity phase transition in spectral group synchronization over compact groups
- The geometry of synchronization problems and learning group actions
- Group synchronization on grids
- Deformed Laplacians and spectral ranking in directed networks
- Spectrally optimized pointset configurations
- Nonconvex phase synchronization
- From intrinsic optimization to iterated extended Kalman filtering on Lie groups
- Sensor network localization on the group of three-dimensional displacements
- Synchronization over Cartan motion groups via contraction
- Concentration of the Kirchhoff index for Erdős-Rényi graphs
- Exact and stable recovery of rotations for robust synchronization
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
- Barankin, McAulay-Seidman and Cramér-Rao bounds on matrix Lie groups
- Random multitype spanning forests for synchronization on sparse graphs
This page was built for publication: Cramer-Rao bounds for synchronization of rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177861)