GESPAR: Efficient Phase Retrieval of Sparse Signals
From MaRDI portal
Abstract: We consider the problem of phase retrieval, namely, recovery of a signal from the magnitude of its Fourier transform, or of any other linear transform. Due to the loss of the Fourier phase information, this problem is ill-posed. Therefore, prior information on the signal is needed in order to enable its recovery. In this work we consider the case in which the signal is known to be sparse, i.e., it consists of a small number of nonzero elements in an appropriate basis. We propose a fast local search method for recovering a sparse signal from measurements of its Fourier transform (or other linear transform) magnitude which we refer to as GESPAR: GrEedy Sparse PhAse Retrieval. Our algorithm does not require matrix lifting, unlike previous approaches, and therefore is potentially suitable for large scale problems such as images. Simulation results indicate that GESPAR is fast and more accurate than existing techniques in a variety of settings.
Cited in
(51)- A geometric analysis of phase retrieval
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Binary sparse phase retrieval via simulated annealing
- Phase retrieval from Fourier measurements with masks
- Phase retrieval with PhaseLift algorithm
- On DC based methods for phase retrieval
- Recovery under side constraints
- Constructing confidence intervals for the signals in sparse phase retrieval
- Gradient projection Newton pursuit for sparsity constrained optimization
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Phase retrieval: a data-driven wavelet frame based approach
- Phaseless compressive sensing using partial support information
- Solving equations of random convex functions via anchored regression
- Phase retrieval via sparse Wirtinger flow
- Phase retrieval: stability and recovery guarantees
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Phase retrieval from Gabor measurements
- Phase retrieval for sparse binary signal: uniqueness and algorithm
- Fast Phase Retrieval from Local Correlation Measurements
- Reconstruction methods in THz single-pixel imaging
- Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
- Robust sparse phase retrieval made easy
- GESPAR
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Proximal mapping for symmetric penalty and sparsity
- Total variation-based phase retrieval for Poisson noise removal
- Variational phase retrieval with globally convergent preconditioned proximal algorithm
- Phase retrieval with sparse phase constraint
- Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
- Quantization-aware phase retrieval
- Hyperbolic wavelet frames and multiresolution in the weighted Bergman spaces
- A proximal operator for multispectral phase retrieval problems
- Quasi-linear compressed sensing
- A message-passing approach to phase retrieval of sparse signals
- On the characterizations of solutions to perturbed l₁ conic optimization problem
- An inexact projected gradient method for sparsity-constrained quadratic measurements regression
- A survey on compressive sensing: classical results and recent advancements
- The numerics of phase retrieval
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- 3D tomographic phase retrieval and unwrapping
- Inducing sparsity via the horseshoe prior in imaging problems
- Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- Cardinality minimization, constraints, and regularization: a survey
- Single-shot phase retrieval via gradient-sparse non-convex regularization integrating physical constraints
- Optimal sparse phase retrieval via a quasi-Bayesian approach
- An oracle gradient regularized Newton method for quadratic measurements regression
- The uniqueness of phase retrieval of analytic signals from very few STFT measurements
- Robust sparse phase retrieval: statistical guarantee, optimality theory and convergent algorithm
- A block coordinate variable metric forward-backward algorithm
This page was built for publication: GESPAR: Efficient Phase Retrieval of Sparse Signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579008)
