Greedy phase retrieval with reference points and bounded sparsity

The phase retrieval problem of recovering a data vector from the squared magnitude of its Fourier transform in general can not be solved uniquely, since the magnitude of the Fourier transform is invariant to a global phase shift, cyclic spatial shift and the conjugate reversal of the signal. We discuss a method of introducing reference points in the signal to resolve aforementioned ambiguities. After specifying requirements for these reference points we present a modification of the GESPAR algorithm to solve the obtained problem.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[3]  S. Sastry,et al.  Compressive Phase Retrieval From Squared Output Measurements Via Semidefinite Programming , 2011, 1111.6323.

[4]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[5]  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.

[6]  Bhiksha Raj,et al.  Greedy sparsity-constrained optimization , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[7]  Alexandre d'Aspremont,et al.  Phase recovery, MaxCut and complex semidefinite programming , 2012, Math. Program..

[8]  Chandra Sekhar Seelamantula,et al.  An iterative algorithm for phase retrieval with sparsity constraints: application to frequency domain optical coherence tomography , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

[10]  Thomas F. Coleman,et al.  An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds , 1993, SIAM J. Optim..

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

[12]  Yonina C. Eldar,et al.  Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms , 2012, SIAM J. Optim..

[13]  Zhang Fe.  Phase retrieval from coded diffraction patterns , 2015 .

[14]  M. Hayes.  The reconstruction of a multidimensional sequence from the phase or magnitude of its Fourier transform , 1982 .

[15]  Yonina C. Eldar,et al.  GESPAR: Efficient Phase Retrieval of Sparse Signals , 2013, IEEE Transactions on Signal Processing.

[16]  Thomas F. Coleman,et al.  On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds , 1994, Math. Program..

[17]  Thomas F. Coleman,et al.  A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems , 1999, SIAM J. Sci. Comput..