Synchronization over Cartan Motion Groups via Contraction

  title={Synchronization over Cartan Motion Groups via Contraction},
  author={Onur {\"O}zyesil and Nir Sharon and Amit Singer},
  journal={SIAM J. Appl. Algebra Geom.},
Group contraction is an algebraic map that relates two classes of Lie groups by a limiting process. We utilize this notion for the compactification of the class of Cartan motion groups. The compactification process is then applied to reduce a non-compact synchronization problem to a problem where the solution can be obtained by means of a unitary, faithful representation. We describe this method of synchronization via contraction in detail and analyze several important aspects of this… Expand
On Matching, and Even Rectifying, Dynamical Systems through Koopman Operator Eigenfunctions
It is argued that the use of the Koopman operator and its spectrum is particularly well suited for this endeavor, both in theory, but also especially in view of recent data-driven algorithm developments. Expand
Dihedral multi-reference alignment
It is shown that if the group elements are drawn from a generic distribution, the orbit of a generic signal is uniquely determined from the second moment of the observations, which implies that the optimal estimation rate in the high noise regime is proportional to the square of the variance of the noise. Expand
The Noise-Sensitivity Phase Transition in Spectral Group Synchronization Over Compact Groups
This work identifies a Baik-Ben Arous-P\'ech\'e type phase transition in the noise level, beyond which spectral group synchronization necessarily fails, and provides asymptotically exact formulas for the accuracy and noise sensitivity of spectral groups synchronization below the phase transition, up to the rounding error. Expand
Cartan-Sync: Fast and Global SE(d)-Synchronization
This work addresses the fundamental problem of pose graph optimization (PGO), which is pervasive in the context of SLAM, and widely known as <inline-formula><tex-math notation="LaTeX">$\text{SE}(d)$</tex- math> -synchronization in the mathematical community, with a novel, elegant, and compact matrix formulation of the maximum likelihood estimation (MLE) for this problem. Expand
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
This paper studies an optimization problem on the sum of traces of matrix quadratic forms in m semi-orthogonal matrices, which can be considered as a generalization of the synchronization ofExpand
Tightness of the semidefinite relaxation for orthogonal trace-sum maximization.
This paper studies an optimization problem on the sum of traces of matrix quadratic forms on $m$ orthogonal matrices, which can be considered as a generalization of the synchronization of rotations.Expand
Initialization of 3D pose graph optimization using Lagrangian duality
This work contributes a complete recovery procedure that, given the (tractable) optimal solution of the relaxation, provides either the optimal MLE solution if the relaxation is tight, or a remarkably good feasible guess if the Relaxation is non-tight, which occurs in specially challenging PGO problems. Expand
Ranking and synchronization from pairwise measurements via SVD
This work proposes a simple SVD-based algorithmic pipeline for both the problem of time synchronization and ranking, and provides a detailed theoretical analysis in terms of robustness against both sampling sparsity and noise perturbations with outliers. Expand
SE(n)++: An Efficient Solution to Multiple Pose Estimation Problems.
A new technique called the SE( n)++ is proposed in this article that exploits a novel mapping from SE(n) to SO(n + 1), which transforms the coupling between rotation and translation into a unified formulation on the Lie group and gives better analytical results and computational performances. Expand
Cramér–Rao Bounds and Optimal Design Metrics for Pose-Graph SLAM
This article focuses on the relation between the graphical structure of pose-graph SLAM and Fisher information matrix, Cramér–Rao lower bounds (CRLB), and its optimal design metrics (T-optimality and D- Optimality). Expand


On the Contraction of Groups and Their Representations.
  • E. Inonu, E. Wigner
  • Physics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1953
The purpose of the present note is to investigate, in some generality, in which sense groups can be limiting cases of other groups, and how their representations can be obtained from the representations of the groups of which they appear as limits. Expand
On contractions of semisimple Lie groups
A limiting formula is given for the representation theory of the Cartan motion group associated to a Riemannian symmetric pair (G, K) in terms of the representation theory of G. Introduction. Let GExpand
Lie Groups with Bi-invariant Metrics
This chapter deals with Lie groups with special types of Riemannian metrics: bi-invariant metrics. Every compact Lie group admits one such metric (see Proposition 2.24), which plays a very importantExpand
A constructive algorithm for the Cartan decomposition of SU(2N)
We present an explicit numerical method to obtain the Cartan-Khaneja-Glaser decomposition of a general element G∊SU(2N) in terms of its “Cartan” and “non-Cartan” components. This effectively factorsExpand
Contractions of rotation groups and their representations
It is a classical result in the theory of special functions that Bessel functions are limits in an appropriate sense of Legendre polynomials. For example in ( 11 ), § 17.4, the following result isExpand
Metrics and Connections for Rigid-Body Kinematics
This paper investigates possilble choices of Riemannian metrics and affine connections on SE(3) for applications to kinematic analysis and robot-trajectory planning and proves there is a unique symmetric connection with this property. Expand
Simplest Lie groups, special functions and integral transforms
Series Editor's Preface. Preface. List of Special Symbols. 0: Introduction. 1: Elements of the Theory of Lie Groups and Lie Algebras. 2: Group Representations and Harmonic Analysis on Groups. 3:Expand
Means and Averaging in the Group of Rotations
  • Maher Moakher
  • Computer Science, Mathematics
  • SIAM J. Matrix Anal. Appl.
  • 2002
This paper gives precise definitions of different, properly invariant notions of mean or average rotation and shows that the Riemannian mean rotation shares many common features with the geometricmean of positive numbers and the geometric mean of positive Hermitian operators. Expand
Lie-algebraic averaging for globally consistent motion estimation
  • V. Govindu
  • Computer Science
  • Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.
  • 2004
The Lie-algebras of the Special Orthogonal and Special Euclidean groups are used to define averages on the Lie-group which gives statistically meaningful, efficient and accurate algorithms for fusing motion information. Expand
Multiview registration via graph diffusion of dual quaternions
A novel multiview registration algorithm that projects several pairwise alignments onto a common reference frame that is both orders of magnitude faster than the state of the art, and more robust to extreme positional noise and outliers. Expand