On Conditions for Uniqueness in Sparse Phase Retrieval

Abstract

The phase retrieval problem has a long history and is an important problem in many areas of optics. Theoretical understanding of phase retrieval is still limited and fundamental questions such as uniqueness and stability of the recovered solution are not yet fully understood. This paper provides several additions to the theoretical understanding of sparse phase retrieval. In particular we show that if the measurement ensemble can be chosen freely, as few as 4k-1 phaseless measurements suffice to guarantee uniqueness of a k-sparse M-dimensional real solution. We also prove that 2(k^2-k+1) Fourier magnitude measurements are sufficient under rather general conditions.

References in corpus (1)

• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms

Cited by in corpus (6)

• STFT Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
• Sparse Phase Retrieval from Short-Time Fourier Measurements
• A strong restricted isometry property, with an application to phaseless compressed sensing
• Sparse phase retrieval via group-sparse optimization
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
• An Algorithm for Exact Super-resolution and Phase Retrieval