DocumentCode
47621
Title
GESPAR: Efficient Phase Retrieval of Sparse Signals
Author
Shechtman, Yoav ; Beck, Andre ; Eldar, Yonina C.
Author_Institution
Dept. of Phys., Technion - Israel Inst. of Technol., Haifa, Israel
Volume
62
Issue
4
fYear
2014
fDate
Feb.15, 2014
Firstpage
928
Lastpage
938
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 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.
Keywords
Fourier transforms; concave programming; greedy algorithms; search problems; signal processing; Fourier phase information loss; Fourier transform; GESPAR; fast local search method; greedy sparse phase retrieval; linear transform; nonconvex optimization; nonzero elements; sparse signal phase retrieval; Convergence; Correlation; Discrete Fourier transforms; Signal processing algorithms; Sparse matrices; Vectors; Non-convex optimization; phase retrieval; sparse signal processing;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/TSP.2013.2297687
Filename
6701369
Link To Document