One-Dimensional Phase Retrieval: Regularization, Box Relaxation and Uniqueness

Abstract

Recovering a signal from its Fourier magnitude is referred to as phase retrieval, which occurs in different fields of engineering and applied physics. This paper gives a new characterization of the phase retrieval problem. Particularly useful is the analysis revealing that the common gradient-based regularization does not restrict the set of solutions to a smaller set. Specifically focusing on binary signals, we show that a box relaxation is equivalent to the binary constraint for Fourier-types of phase retrieval. We further prove that binary signals can be recovered uniquely up to trivial ambiguities under certain conditions. Finally, we use the characterization theorem to develop an efficient denoising algorithm.

arXiv comment25 pages, 11 figures

References in corpus (7)

• An algebraic characterization of injectivity in phase retrieval
• STFT Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
• Sparse Phase Retrieval from Short-Time Fourier Measurements
• Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms
• Phase Retrieval for Sparse Signals: Uniqueness Conditions
• Sparse Signal Recovery from Quadratic Measurements via Convex Programming
• Non-negativity constraints in the one-dimensional discrete-time phase retrieval problem

Cited by in corpus (1)

• Toward a mathematical theory of the crystallographic phase retrieval problem