Unrolled algorithms for group synchronization
Not on the map. Why?
Abstract (arXiv)
The group synchronization problem involves estimating a collection of group elements from noisy measurements of their pairwise ratios. This task is a key component in many computational problems, including the molecular reconstruction problem in single-particle cryo-electron microscopy (cryo-EM). The standard methods to estimate the group elements are based on iteratively applying linear and non-linear operators, and are not necessarily optimal. Motivated by the structural similarity to deep neural networks, we adopt the concept of algorithm unrolling, where training data is used to optimize the algorithm. We design unrolled algorithms for several group synchronization instances, including synchronization over the group of 3-D rotations: the synchronization problem in cryo-EM. We also apply a similar approach to the multi-reference alignment problem. We show by numerical experiments that the unrolling strategy outperforms existing synchronization algorithms in a wide variety of scenarios.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 53 references that are in the map. First posted on arXiv 19 Jul 2022.
Builds on
27 of 53 references.
References · 27
- 2019Deep Equilibrium Modelscited by 603
- 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 411
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2015Trainable Nonlinear Reaction Diffusion: A Flexible Framework for Fast and Effective Image Restorationcited by 194
- 2017A Survey of Structure from Motioncited by 157
- 2016SE-Sync: A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Groupcited by 80
- 2019Momentum-Net: Fast and convergent iterative neural network for inverse problemscited by 38
- 2020Graph Unrolling Networks: Interpretable Neural Networks for Graph Signal Denoisingcited by 33
- 2017Near-optimal bounds for phase synchronizationcited by 32
- 2016Nonconvex phase synchronizationcited by 30
- 2014Tightness of the maximum likelihood semidefinite relaxation for angular synchronizationcited by 23
- 2016Message-passing algorithms for synchronization problems over compact groupscited by 18
15 more
- 2020Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methodscited by 18
- 2015Sync-Rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and Semidefinite Programming Synchronizationcited by 14
- 2017Estimation under group actions: recovering orbits from invariantscited by 14
- 2019An Algorithm Unrolling Approach to Deep Image Deblurringcited by 14
- 2013Multireference Alignment using Semidefinite Programmingcited by 9
- 2021Deep Unrolled Recovery in Sparse Biological Imagingcited by 9
- 2015Non-unique games over compact groups and orientation estimation in cryo-EMcited by 7
- 2014Alternating Projection, Ptychographic Imaging and Phase Synchronizationcited by 5
- 2020Multi-reference alignment in high dimensions: sample complexity and phase transitioncited by 5
- 2021The generalized method of moments for multi-reference alignmentcited by 4
- 2016Synchronization over Cartan motion groups via contractioncited by 3
- 2018Heterogeneous multireference alignment for images with application to 2-D classification in single particle reconstructioncited by 3
- 2021Dihedral multi-reference alignmentcited by 3
- 2021Compactification of the Rigid Motions Group in Image Processingcited by 2
- 2021An accelerated expectation-maximization algorithm for multi-reference alignmentcited by 1
Built on by
Citing papers per year: 2023: 1.
1 paper.