Research map / Point clouds / Registration and matching
Certifiably Optimal Robust Angular Synchronization
Daniel Barath, Keisuke Tateno, Marc Pollefeys, Federico Tombari
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Presents the first algorithm that certifiably solves the robust maximum-consensus formulation of robust angular synchronization (rotation averaging on the circle) to global optimality.
Problem
Robust angular synchronization / rotation averaging on the circle under outliers, formulated as robust maximum consensus, where global optimality is hard to guarantee.
Approach
Provides a certifiable global solver for the robust maximum-consensus formulation of angular synchronization, yielding globally optimal solutions with a certificate, which prior methods did not offer.
Closest papers by meaning
- Efficient Detection of Long Consistent Cycles and its Application to Distributed Synchronization (CVPR 2024 · similarity 0.86)
- BOE-ViT: Boosting Orientation Estimation with Equivariance in Self-Supervised 3D Subtomogram Alignment (CVPR 2025 · similarity 0.85)
- A Gaussian Filter-Based 3D Registration Method for Series Section Electron Microscopy (AAAI 2025 · similarity 0.84)
- Tensor-Based Synchronization and the Low-Rankness of the Block Trifocal Tensor (NeurIPS 2024 · similarity 0.83)
- Robust Angular Synchronization via Directed Graph Neural Networks (ICLR 2024 · similarity 0.83)
- CryoBench: Diverse and challenging datasets for the heterogeneity problem in cryo-EM (NeurIPS 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
