An Algorithm for Exact Super-resolution and Phase Retrieval
arXiv:1310.7552
Abstract
We explore a fundamental problem of super-resolving a signal of interest from a few measurements of its low-pass magnitudes. We propose a 2-stage tractable algorithm that, in the absence of noise, admits perfect super-resolution of an -sparse signal from low-pass magnitude measurements. The spike locations of the signal can assume any value over a continuous disk, without increasing the required sample size. The proposed algorithm first employs a conventional super-resolution algorithm (e.g. the matrix pencil approach) to recover unlabeled sets of signal correlation coefficients, and then applies a simple sorting algorithm to disentangle and retrieve the true parameters in a deterministic manner. Our approach can be adapted to multi-dimensional spike models and random Fourier sampling by replacing its first step with other harmonic retrieval algorithms.
arXiv commentaccepted to IEEE ICASSP 2014
References in corpus (10)
- Sparsity-based single-shot sub-wavelength coherent diffractive imaging
- Sparsity based sub-wavelength imaging with partially incoherent light via quadratic compressed sensing
- A Partial Derandomization of PhaseLift using Spherical Designs
- Localization from Incomplete Noisy Distance Measurements
- Phase Retrieval for Sparse Signals: Uniqueness Conditions
- Compressed Sensing off the Grid
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Sparse Phase Retrieval: Convex Algorithms and Limitations
- Super-Resolution from Noisy Data
- On Conditions for Uniqueness in Sparse Phase Retrieval