Benchmark problems for phase retrieval
From MaRDI portal
Abstract: In recent years, the mathematical and algorithmic aspects of the phase retrieval problem have received considerable attention. Many papers in this area mention crystallography as a principal application. In crystallography, the signal to be recovered is periodic and comprised of atomic distributions arranged homogeneously in the unit cell of the crystal. The crystallographic problem is both the leading application and one of the hardest forms of phase retrieval. We have constructed a graded set of benchmark problems for evaluating algorithms that perform this type of phase retrieval. The data, publicly available online, is provided in an easily interpretable format. We also propose a simple and unambiguous success/failure criterion based on the actual needs in crystallography. Baseline runtimes were obtained with an iterative algorithm that is similar but more transparent than those used in crystallography. Empirically, the runtimes grow exponentially with respect to a new hardness parameter: the sparsity of the signal autocorrelation. We also review the algorithms used by the leading software packages. This set of benchmark problems, we hope, will encourage the development of new algorithms for the phase retrieval problem in general, and crystallography in particular.
Recommendations
Cites work
- A short history of \textit{SHELX}
- Alternating direction methods for classical and ptychographic phase retrieval
- Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes
- Bispectrum Inversion With Application to Multireference Alignment
- Factoring polynomials with rational coefficients
- Fourier phase retrieval with a single mask by Douglas-Rachford algorithms
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Manopt, a Matlab toolbox for optimization on manifolds
- Matrix product constraints by projection methods
- Non-Convex Phase Retrieval From STFT Measurements
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Phase recovery, MaxCut and complex semidefinite programming
- Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms
- Phase retrieval from coded diffraction patterns
- Phase retrieval via matrix completion
- Phase retrieval: stability and recovery guarantees
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Relaxed averaged alternating reflections for diffraction imaging
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
- The Complexity of Bit Retrieval
- The Structure of Homometric Sets
Cited in
(25)- Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform
- On signal reconstruction from FROG measurements
- Accelerating Proximal Markov Chain Monte Carlo by Using an Explicit Stabilized Method
- RRR
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Toward a mathematical theory of the crystallographic phase retrieval problem
- scientific article; zbMATH DE number 7626752 (Why is no real title available?)
- Bayesian Imaging with Data-Driven Priors Encoded by Neural Networks
- Simultaneous phase retrieval and blind deconvolution via convex programming
- Phase retrieval with background information
- Projection methods for high numerical aperture phase retrieval
- The numerics of phase retrieval
- Sparse multi-reference alignment: phase retrieval, uniform uncertainty principles and the beltway problem
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval
- Nearly optimal bounds for the global geometric landscape of phase retrieval
- Finite alphabet phase retrieval
- \textit{XGANDALF} -- extended gradient descent algorithm for lattice finding
- Polarimetric Fourier phase retrieval
- No existence of a linear algorithm for the one-dimensional Fourier phase retrieval
- The beltway problem over orthogonal groups
- The stability of generalized phase retrieval problem over compact groups
- Phase retrieval with semialgebraic and ReLU neural network priors
- Affine phase retrieval via second-order methods
- The generic crystallographic phase retrieval problem
- A transversality theorem for semi-algebraic sets with application to signal recovery from the second moment and cryo-EM
This page was built for publication: Benchmark problems for phase retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230417)
