GESPAR

GESPAR: Efficient Phase Retrieval of Sparse Signals. 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.


References in zbMATH (referenced in 23 articles , 1 standard article )

Showing results 1 to 20 of 23.
Sorted by year (citations)

1 2 next

  1. Ma, Cong; Wang, Kaizheng; Chi, Yuejie; Chen, Yuxin: Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (2020)
  2. Bahmani, Sohail; Romberg, Justin: Solving equations of random convex functions via anchored regression (2019)
  3. Fan, Jun; Wang, Liqun; Yan, Ailing: An inexact projected gradient method for sparsity-constrained quadratic measurements regression (2019)
  4. Liu, Yong-Jin; Li, Ruonan; Wang, Bo: On the characterizations of solutions to perturbed (l_1) conic optimization problem (2019)
  5. Roig-Solvas, Biel; Makowski, Lee; Brooks, Dana H.: A proximal operator for multispectral phase retrieval problems (2019)
  6. Yuan, Ziyang; Wang, Hongxia; Wang, Qi: Phase retrieval via sparse Wirtinger flow (2019)
  7. Beck, Amir; Hallak, Nadav: Proximal mapping for symmetric penalty and sparsity (2018)
  8. Bolte, Jérôme; Sabach, Shoham; Teboulle, Marc; Vaisbourd, Yakov: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems (2018)
  9. Chang, Huibin; Lou, Yifei; Duan, Yuping; Marchesini, Stefano: Total variation-based phase retrieval for Poisson noise removal (2018)
  10. Chang, Huibin; Marchesini, Stefano; Lou, Yifei; Zeng, Tieyong: Variational phase retrieval with globally convergent preconditioned proximal algorithm (2018)
  11. Sun, Ju; Qu, Qing; Wright, John: A geometric analysis of phase retrieval (2018)
  12. Yuan, Ziyang; Wang, Hongxia: Phase retrieval for sparse binary signal: uniqueness and algorithm (2018)
  13. Iwen, Mark; Viswanathan, Aditya; Wang, Yang: Robust sparse phase retrieval made easy (2017)
  14. Bahmani, Sohail; Romberg, Justin: Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements (2016)
  15. Bojarovska, Irena; Flinth, Axel: Phase retrieval from Gabor measurements (2016)
  16. Chouzenoux, Emilie; Pesquet, Jean-Christophe; Repetti, Audrey: A block coordinate variable metric forward-backward algorithm (2016)
  17. Iwen, Mark A.; Viswanathan, Aditya; Wang, Yang: Fast phase retrieval from local correlation measurements (2016)
  18. Peng, Wei; Wang, Hongxia: Binary sparse phase retrieval via simulated annealing (2016)
  19. Zhu, Xunzhi: Approximately normalized iterative hard thresholding for nonlinear compressive sensing (2016)
  20. Wei, Ke: Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study (2015)

1 2 next