Improved recovery guarantees for phase retrieval from coded diffraction patterns
From MaRDI portal
Abstract: In this work we analyze the problem of phase retrieval from Fourier measurements with random diffraction patterns. To this end, we consider the recently introduced PhaseLift algorithm, which expresses the problem in the language of convex optimization. We provide recovery guarantees which require O(log^2 d) different diffraction patterns, thus improving on recent results by Candes et al. [arXiv:1310.3240], which require O(log^4 d) different patterns.
Recommendations
- Phase Recovery Guarantees From Designed Coded Diffraction Patterns in Optical Imaging
- Phase retrieval from coded diffraction patterns
- Super-Resolution Phase Retrieval From Designed Coded Diffraction Patterns
- Uniqueness theorems for tomographic phase retrieval with few coded diffraction patterns
- Phase retrieval: stability and recovery guarantees
- Phase retrieval versus phaseless reconstruction
- Phase Retrieval for Partially Coherent Observations
- Phase retrieval for sub-Gaussian measurements
- Generalized phase retrieval: measurement number, matrix recovery and beyond
Cites work
- A mathematical introduction to compressive sensing
- A partial derandomization of phaselift using spherical designs
- A Probabilistic and RIPless Theory of Compressed Sensing
- An algebraic characterization of injectivity in phase retrieval
- Evenly distributed unitaries: On the structure of unitary designs
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 3140885 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- On signal reconstruction without phase
- Painless reconstruction from magnitudes of frame coefficients
- Phase retrieval from coded diffraction patterns
- Phase retrieval from power spectra of masked signals
- Phase retrieval via matrix completion
- Phase retrieval with polarization
- Phase retrieval: stability and recovery guarantees
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Probabilistic methods for algorithmic discrete mathematics
- Probability Inequalities for Sums of Bounded Random Variables
- Quantum tomography under prior information
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Quasi-linear compressed sensing
- Reconstruction From Anisotropic Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- RIPless compressed sensing from anisotropic measurements
- Strong converse for identification via quantum channels
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- User-friendly tail bounds for sums of random matrices
Cited in
(41)- On global convergence of gradient descent algorithms for generalized phase retrieval problem
- Coded aperture design for solving the phase retrieval problem in X-ray crystallography
- Phase retrieval from Fourier measurements with masks
- A direct solver for the phase retrieval problem in ptychographic imaging
- Phase retrieval with PhaseLift algorithm
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- Riemannian optimization for phase retrieval from masked Fourier measurements
- Proof methods for robust low-rank matrix recovery
- Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform
- Complex phase retrieval from subgaussian measurements
- Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization
- Lower Lipschitz bounds for phase retrieval from locally supported measurements
- A partial derandomization of phaselift using spherical designs
- Phase retrieval from coded diffraction patterns
- Admissible measurements and robust algorithms for ptychography
- Phase retrieval for \(L^2([-\pi, \pi])\) via the provably accurate and noise robust numerical inversion of spectrogram measurements
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Fast Phase Retrieval from Local Correlation Measurements
- Low rank matrix recovery from rank one measurements
- Stable low-rank matrix recovery via null space properties
- Local and global phaseless sampling in real spline spaces
- Toward a mathematical theory of the crystallographic phase retrieval problem
- Uniqueness theorems for tomographic phase retrieval with few coded diffraction patterns
- Phase retrieval: uniqueness and stability
- PhaseMax: stable guarantees from noisy sub-Gaussian measurements
- Well-conditioned ptychograpic imaging via lost subspace completion
- Holographic phase retrieval and reference design
- Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
- Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow
- The numerics of phase retrieval
- Stable phase retrieval and perturbations of frames
- Uniqueness of phase retrieval from three measurements
- Provable Phase Retrieval with Mirror Descent
- Towards a bilipschitz invariant theory
- Solving systems of phaseless equations via Riemannian optimization with optimal sampling complexity
- Truncated amplitude flow with coded diffraction patterns
- Phasebook: a survey of selected open problems in phase retrieval
- Robust outlier bound condition to phase retrieval with adversarial sparse outliers
- Stability in phase retrieval: characterizing condition numbers and the optimal vector set
- Group-invariant max filtering
- Recovery performance of PhaseLift for phase retrieval from coded diffraction patterns
This page was built for publication: Improved recovery guarantees for phase retrieval from coded diffraction patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347510)
