On robust phase retrieval for sparse signals

Recovering signals from their Fourier transform magnitudes is a classical problem referred to as phase retrieval and has been around for decades. In general, the Fourier transform magnitudes do not carry enough information to uniquely identify the signal and therefore additional prior information is required. In this paper, we shall assume that the underlying signal is sparse, which is true in many applications such as X-ray crystallography, astronomical imaging, etc. Recently, several techniques involving semidefinite relaxations have been proposed for this problem, however very little analysis has been performed. The phase retrieval problem can be decomposed into two tasks - (i) identifying the support of the sparse signal from the Fourier transform magnitudes, and (ii) recovering the signal using the support information. In earlier work [13], we developed algorithms for (i) which provably recovered the support for sparsities upto O(n1/3-ϵ). Simulations suggest that support recovery is possible upto sparsity O(n1/2-ϵ). In this paper, we focus on (ii) and propose an algorithm based on semidefinite relaxation, which provably recovers the signal from its Fourier transform magnitude and support knowledge with high probability if the support size is O(n1/2-ϵ).

[1]  Babak Hassibi,et al.  Recovery of sparse 1-D signals from the magnitudes of their Fourier transform , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[2]  Biing-Hwang Juang,et al.  Fundamentals of speech recognition , 1993, Prentice Hall signal processing series.

[3]  Rick P. Millane,et al.  Phase retrieval in crystallography and optics , 1990 .

[4]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[5]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6]  Babak Hassibi,et al.  Phase retrieval for sparse signals using rank minimization , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  A. Walther.  The Question of Phase Retrieval in Optics , 1963 .

[8]  C. V. Eynden,et al.  A proof of a conjecture of Erdös , 1969 .

[9]  R. Gerchberg.  A practical algorithm for the determination of phase from image and diffraction plane pictures , 1972 .

[10]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[11]  Martin Vetterli,et al.  Sparse spectral factorization: Unicity and reconstruction algorithms , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[12]  øöö Blockinø.  Phase retrieval, error reduction algorithm, and Fienup variants: A view from convex optimization , 2002 .

[13]  J R Fienup,et al.  Phase retrieval algorithms: a comparison. , 1982, Applied optics.

[14]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[15]  Yonina C. Eldar,et al.  Sparsity Based Sub-wavelength Imaging with Partially Incoherent Light via Quadratic Compressed Sensing References and Links , 2022 .

[16]  Emmanuel J. Candès,et al.  PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming , 2011, ArXiv.

[17]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..