Robust sparse phase retrieval made easy
From MaRDI portal
Publication:347523
DOI10.1016/J.ACHA.2015.06.007zbMATH Open1393.94274arXiv1410.5295OpenAlexW1552037902MaRDI QIDQ347523FDOQ347523
Authors: Aditya Viswanathan, Yang Wang, M. A. Iwen 
Publication date: 30 November 2016
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Abstract: In this short note we propose a simple two-stage sparse phase retrieval strategy that uses a near-optimal number of measurements, and is both computationally efficient and robust to measurement noise. In addition, the proposed strategy is fairly general, allowing for a large number of new measurement constructions and recovery algorithms to be designed with minimal effort.
Full work available at URL: https://arxiv.org/abs/1410.5295
Recommendations
Cites Work
- Templates for convex cone problems with applications to sparse signal recovery
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Stable signal recovery from incomplete and inaccurate measurements
- A simple proof of the restricted isometry property for random matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Compressed sensing
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Graph implementations for nonsmooth convex programs
- Compressed sensing and best \(k\)-term approximation
- A mathematical introduction to compressive sensing
- Quantum tomography under prior information
- Painless reconstruction from magnitudes of frame coefficients
- Phase retrieval: stability and recovery guarantees
- On signal reconstruction without phase
- Phase retrieval with polarization
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Phase retrieval for sparse signals
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Phase retrieval from very few measurements
- Sparse signal recovery from quadratic measurements via convex programming
- Compressive Phase Retrieval via Generalized Approximate Message Passing
Cited In (28)
- Jointly low-rank and bisparse recovery: questions and partial answers
- Local and global phaseless sampling in real spline spaces
- The numerics of phase retrieval
- Compressive phase retrieval: Optimal sample complexity with deep generative priors
- Admissible measurements and robust algorithms for ptychography
- Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval
- Sparse power factorization: balancing peakiness and sample complexity
- Fast Phase Retrieval from Local Correlation Measurements
- Phase retrieval from Fourier measurements with masks
- Phaselift is robust to a constant fraction of arbitrary errors
- Phase retrieval with PhaseLift algorithm
- Provable sample-efficient sparse phase retrieval initialized by truncated power method
- Sampling schemes and recovery algorithms for functions of few coordinate variables
- Constructing confidence intervals for the signals in sparse phase retrieval
- Phaseless reconstruction from space-time samples
- Stable signal recovery from phaseless measurements
- Performance bounds of the intensity-based estimators for noisy phase retrieval
- Fast rank-one alternating minimization algorithm for phase retrieval
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery
- SparsePR
- Sparse signal recovery from phaseless measurements via hard thresholding pursuit
- Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
- The recovery of complex sparse signals from few phaseless measurements
- Variational phase retrieval with globally convergent preconditioned proximal algorithm
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
- Applied harmonic analysis and data science. Abstracts from the workshop held April 21--26, 2024
- Flavors of compressive sensing
Uses Software
This page was built for publication: Robust sparse phase retrieval made easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347523)
