Synchronization of rotations on a graph
(2011) Dagstuhl Seminar 11451 on Data mining, networks and dynamics — Location: Dagstuhl, Germany (6.November.2011)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- I will start by informally describing two application problems. These will motivate the study of an estimation problem in which the quantities to estimate are N rotations and the measurements to help us do so are noisy observations of relative rotations. The measurements induce a graph which consists of N nodes (each associated to one of the unknown rotations) and such that each edge corresponds to a noisy measurement of the relative rotation between the two incident nodes. I will then state a few results we have obtained on the theoretical and algorithmic aspects of this problem, and try to gradually transform the presentation into a group discussion. The material I will talk about is joint work with Amit Singer (Princeton University) and Pierre-Antoine Absil (UCLouvain).
- Affiliations
Citations
Boumal, N. (2011). Synchronization of rotations on a graph. Dagstuhl Reports, 1(11), 23-38. https://doi.org/10.4230/DagRep.1.11.23 (Original work published 2012)