Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals
Lists
Only you see this
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.
BibTeX
@inproceedings{cho2016fast,
author = {Myung Cho and Jian-Feng Cai and Suhui Liu and Yonina C. Eldar and Weiyu Xu},
title = {{Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2016},
url = {https://openreview.net/forum?id=ijFp8UcFmZ3},
}Loading related content...