Spectral Motion Synchronization in SE(3)
This paper addresses the problem of motion synchronization (or averaging) and describes a simple, closed-form solution based on a spectral decomposition, which does not consider rotation and translation separately but works straight in SE(3), the manifold of rigid motions. Besides its theoretical interest, being the first closed form solution in SE(3), experimental results show that it compares favourably with the state of the art both in terms of precision and speed.
Code (0)
등록된 구현이 없습니다.
Tasks
FormTranslationSimilar Papers 제목 키워드 기반
Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methods
Group synchronization asks to recover group elements from their pairwise measurements. It has found numerous applications across various scientific disciplines. In this work, we focus on orthogonal and permutation group …
A Multi-spectral Dataset for Evaluating Motion Estimation Systems
Visible images have been widely used for motion estimation. Thermal images, in contrast, are more challenging to be used in motion estimation since they typically have lower resolution, less texture, and more noise. In t…
Motion EstimationStereo MatchingMultiBodySync: Multi-Body Segmentation and Motion Estimation via 3D Scan Synchronization
We present MultiBodySync, a novel, end-to-end trainable multi-body motion segmentation and rigid registration framework for multiple input 3D point clouds. The two non-trivial challenges posed by this multi-scan multibod…
Motion EstimationMotion SegmentationSegmentationA Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
Community detection and orthogonal group synchronization are both fundamental problems with a variety of important applications in science and engineering. In this work, we consider the joint problem of community detecti…
Community DetectionFast, Accurate and Memory-Efficient Partial Permutation Synchronization
Previous partial permutation synchronization (PPS) algorithms, which are commonly used for multi-object matching, often involve computation-intensive and memory-demanding matrix operations. These operations become intrac…