Reconstruction of Signals from Magnitudes of Redundant Representations: The Complex Case
arXiv:1304.1839
Abstract
This paper is concerned with the question of reconstructing a vector in a finite-dimensional complex Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We present new invertibility results as well an iterative algorithm that finds the least-square solution and is robust in the presence of noise. We analyze its numerical performance by comparing it to the Cramer-Rao lower bound.
updated 6 Apr. 2013 version arXiv:1304.1839: to appear in Foundations of Computational Mathematics
References in corpus (7)
- An algebraic characterization of injectivity in phase retrieval
- Phase Recovery, MaxCut and Complex Semidefinite Programming
- Reconstruction of Signals from Magnitudes of Redundant Representations
- Solving Quadratic Equations via PhaseLift when There Are About As Many Equations As Unknowns
- Invertibility and Robustness of Phaseless Reconstruction
- Stable optimizationless recovery from phaseless linear measurements
- Conditions for Existence of Dual Certificates in Rank-One Semidefinite Problems