GESPAR: Efficient Phase Retrieval of Sparse Signals

DOI10.1109/TSP.2013.2297687MaRDI QIDQ4579008zbMATH OpenOpenAlexFDO

Authors Yoav Shechtman, Amir Beck, Y. C. Eldar

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

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

(47)

• Single-shot phase retrieval via gradient-sparse non-convex regularization integrating physical constraints
• Phase retrieval with sparse phase constraint
• On DC based methods for phase retrieval
• Proximal mapping for symmetric penalty and sparsity
• A proximal operator for multispectral phase retrieval problems
• Reconstruction methods in THz single-pixel imaging
• Approximately normalized iterative hard thresholding for nonlinear compressive sensing
• Phase retrieval for sparse binary signal: uniqueness and algorithm
• Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• Gradient projection Newton pursuit for sparsity constrained optimization
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• Quantization-aware phase retrieval
• Hyperbolic wavelet frames and multiresolution in the weighted Bergman spaces
• A survey on compressive sensing: classical results and recent advancements
• Recovery under side constraints
• Cardinality minimization, constraints, and regularization: a survey
• A message-passing approach to phase retrieval of sparse signals
• 3D tomographic phase retrieval and unwrapping
• Robust sparse phase retrieval made easy
• Phaseless compressive sensing using partial support information
• Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
• Phase retrieval: a data-driven wavelet frame based approach
• Constructing confidence intervals for the signals in sparse phase retrieval
• Phase retrieval via sparse Wirtinger flow
• Total variation-based phase retrieval for Poisson noise removal
• A geometric analysis of phase retrieval
• Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
• Phase retrieval from Fourier measurements with masks
• The numerics of phase retrieval
• An inexact projected gradient method for sparsity-constrained quadratic measurements regression
• GESPAR
• Phase retrieval from Gabor measurements
• A block coordinate variable metric forward-backward algorithm
• Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
• On the characterizations of solutions to perturbed \(l_1\) conic optimization problem
• Variational phase retrieval with globally convergent preconditioned proximal algorithm
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Fast Phase Retrieval from Local Correlation Measurements
• Binary sparse phase retrieval via simulated annealing
• Inducing sparsity via the horseshoe prior in imaging problems
• Phase retrieval: stability and recovery guarantees
• Solving equations of random convex functions via anchored regression
• Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval
• Phase retrieval with PhaseLift algorithm
• Quasi-linear compressed sensing
• Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions

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)