Robust sparse phase retrieval made easy

DOI10.1016/J.ACHA.2015.06.007MaRDI QIDQ347523zbMATH OpenOpenAlexFDO

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)

Full work available at URL https://arxiv.org/abs/1410.5295

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

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.

Recommendations

• Phase retrieval for sparse signals
• Sparse signal recovery from phaseless measurements via hard thresholding pursuit
• A flexible convex relaxation for phase retrieval
• The recovery of complex sparse signals from few phaseless measurements
• Phase retrieval from very few measurements

Cites work

• A mathematical introduction to compressive sensing
• A simple proof of the restricted isometry property for random matrices
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
• Compressive Phase Retrieval via Generalized Approximate Message Passing
• GESPAR: Efficient Phase Retrieval of Sparse Signals
• Graph implementations for nonsmooth convex programs
• Iterative hard thresholding for compressed sensing
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On signal reconstruction without phase
• Painless reconstruction from magnitudes of frame coefficients
• Phase retrieval for sparse signals
• Phase retrieval from very few measurements
• Phase retrieval with polarization
• Phase retrieval: stability and recovery guarantees
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Quantum tomography under prior information
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Sparse signal recovery from quadratic measurements via convex programming
• Stable signal recovery from incomplete and inaccurate measurements
• Templates for convex cone problems with applications to sparse signal recovery
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

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
• Admissible measurements and robust algorithms for ptychography
• Compressive phase retrieval: Optimal sample complexity with deep generative priors
• Sparse power factorization: balancing peakiness and sample complexity
• Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval
• Fast Phase Retrieval from Local Correlation Measurements
• Phase retrieval from Fourier measurements with masks
• Phase retrieval with PhaseLift algorithm
• Phaselift is robust to a constant fraction of arbitrary errors
• Sampling schemes and recovery algorithms for functions of few coordinate variables
• Provable sample-efficient sparse phase retrieval initialized by truncated power method
• Constructing confidence intervals for the signals in sparse phase retrieval
• Phaseless reconstruction from space-time samples
• Stable signal recovery from phaseless measurements
• Fast rank-one alternating minimization algorithm for phase retrieval
• Performance bounds of the intensity-based estimators for noisy phase retrieval
• SparsePR
• Riemannian thresholding methods for row-sparse and low-rank matrix recovery
• Sparse signal recovery from phaseless measurements via hard thresholding pursuit
• Stable recovery of weighted sparse signals from phaseless measurements via weighted l₁ minimization
• The recovery of complex sparse signals from few phaseless measurements
• Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
• Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
• Variational phase retrieval with globally convergent preconditioned proximal algorithm
• Applied harmonic analysis and data science. Abstracts from the workshop held April 21--26, 2024
• Flavors of compressive sensing

Describes a project that uses

Uses Software

• PhaseLift
• GESPAR
• TFOCS
• CoSaMP
• CVX

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)