Abstract
Sparse phase retrieval (PR) aims at reconstructing a sparse signal vector from a few phaseless linear measurements. It emerges naturally in diverse applications, but it is NP-hard in general. Drawing from advances in nonconvex optimization, this paper presents a new algorithm that is termed compressive reweighted amplitude flow (CRAF) for sparse PR. CRAF operates in two stages: Stage one computes an initial guess by means of a new spectral procedure, and stage two implements a few hard thresholding based iteratively reweighted gradient iterations on the amplitude-based least-squares cost. When there are sufficient measurements, CRAF reconstructs the true signal vector exactly under suitable conditions. Furthermore, its sample complexity coincides with that of the state-of-the-art approaches. Numerical experiments showcase improved performance of the proposed approach relative to existing alternatives.
Original language | English (US) |
---|---|
Title of host publication | 2018 26th European Signal Processing Conference, EUSIPCO 2018 |
Publisher | European Signal Processing Conference, EUSIPCO |
Pages | 712-716 |
Number of pages | 5 |
ISBN (Electronic) | 9789082797015 |
DOIs | |
State | Published - Nov 29 2018 |
Event | 26th European Signal Processing Conference, EUSIPCO 2018 - Rome, Italy Duration: Sep 3 2018 → Sep 7 2018 |
Publication series
Name | European Signal Processing Conference |
---|---|
Volume | 2018-September |
ISSN (Print) | 2219-5491 |
Other
Other | 26th European Signal Processing Conference, EUSIPCO 2018 |
---|---|
Country/Territory | Italy |
City | Rome |
Period | 9/3/18 → 9/7/18 |
Bibliographical note
Publisher Copyright:© EURASIP 2018.
Keywords
- Linear convergence
- Model-based hard thresholding
- Sparse recovery
- Spectral initialization