Research map / Learning theory and algorithms / Matrix and tensor methods
Fast, Accurate and Memory-Efficient Partial Permutation Synchronization
Check your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use MatchFAME instead of MatchEIG | UCM synchronization · UCM, n=20, m=2000 | runtime (seconds): 1297 -> 27 | Helped |
| Use MatchFAME instead of MatchEIG | UCM synchronization · UCM, m=20, n=700 | runtime (seconds): >5000 -> 826 | Helped |
| Use MatchFAME instead of the strongest listed baseline | Partial permutation synchronization · EPFL datasets, Herz-Jesu-P8 | precision (PR, %): 95.9 -> 95.9 | No clear effect |
| Use MatchFAME instead of the strongest listed baseline | Partial permutation synchronization · EPFL datasets, Castle-P30 | precision (PR, %): 84.7 -> 87.9 | Helped |
| Use MatchFAME instead of LUD alone | LUD camera-pose pipeline · Photo Tourism, Piazza Del Popolo | mean rotation error (degrees): 7.04 -> 1.39 | Helped |
| Use MatchFAME instead of LUD alone | LUD camera-pose pipeline · Photo Tourism, Gendarmenmarkt | mean rotation error (degrees): 40.14 -> 40.20 | Hurt |
| Add cycle-inconsistency-based corruption estimation with CEMP-Partial | MatchFAME · LBC and LAC synthetic corruption | precision | Helped |
| Add edge confidence weights to projected power iterations | MatchFAME · Nonuniform-corruption synthetic data | precision | Helped |
| Initialize projected power iterations with an MST rather than a spectral method | MatchFAME · Partial permutation synchronization | memory efficiency | Helped |
| Replace dense spectral operations with sparse matrix operations | MatchFAME · UCM runtime benchmarks | runtime (seconds): 1297 -> 27 | Helped |
Closest papers by meaning
- Probabilistic Permutation Synchronization Using the Riemannian Structure of the Birkhoff Polytope (CVPR 2019 · similarity 0.88)
- Efficient Detection of Long Consistent Cycles and its Application to Distributed Synchronization (CVPR 2024 · similarity 0.85)
- OT4P: Unlocking Effective Orthogonal Group Path for Permutation Relaxation (NeurIPS 2024 · similarity 0.83)
- Tensor-Based Synchronization and the Low-Rankness of the Block Trifocal Tensor (NeurIPS 2024 · similarity 0.82)
- Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methods (ICLR 2025 · similarity 0.81)
- FastMAC: Stochastic Spectral Sampling of Correspondence Graph (CVPR 2024 · similarity 0.81)
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.