Reconstruction of Signals from Magnitudes of Redundant Representations
classification
🧮 math.FA
cs.ITmath.ITstat.AP
keywords
magnitudesredundantvectoralgorithmanalyzeboundcoefficientscomparing
read the original abstract
This paper is concerned with the question of reconstructing a vector in a finite-dimensional real or 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 two versions of the Cramer-Rao lower bound.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.