Abstract
We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.
| Original language | English |
|---|---|
| Title of host publication | 2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 4638-4642 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781479999880 |
| DOIs | |
| Publication status | Published - 18 May 2016 |
| Event | 41st IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 - Shanghai, China Duration: 20 Mar 2016 → 25 Mar 2016 |
Publication series
| Name | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
|---|---|
| Volume | 2016-May |
| ISSN (Print) | 1520-6149 |
Conference
| Conference | 41st IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 |
|---|---|
| Country/Territory | China |
| City | Shanghai |
| Period | 20/03/16 → 25/03/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Keywords
- atomic norm
- compressed sensing
- matrix completion
- sparse recovery
- spectral estimation
Fingerprint
Dive into the research topics of 'Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver