26 September 2017Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Conference Presentation)
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
A spectrally sparse signal of order r is a mixture of r damped or undamped complex sinusoids. This talk investigates the problem of reconstructing spectrally sparse signals from a random subset of n regular time domain samples, which can be reformulated as a low rank Hankel matrix completion problem. We introduce an iterative hard thresholding (IHT) algorithm and a fast iterative hard thresholding (FIHT) algorithm for efficient reconstruction of spectrally sparse signals via low rank Hankel matrix completion. Theoretical recovery guarantees have been established for FIHT, showing that O(r^2log^2(n)) number of samples are sufficient for exact recovery with high probability. Empirical performance comparisons establish significant computational advantages for IHT and FIHT. In particular, numerical simulations on 3D arrays demonstrate the capability of FIHT on handling large and high-dimensional real data.
Jian-Feng Cai
"Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Conference Presentation)", Proc. SPIE 10394, Wavelets and Sparsity XVII, 103941K (26 September 2017); https://doi.org/10.1117/12.2272919
ACCESS THE FULL ARTICLE
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The alert did not successfully save. Please try again later.
Jian-Feng Cai, "Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Conference Presentation)," Proc. SPIE 10394, Wavelets and Sparsity XVII, 103941K (26 September 2017); https://doi.org/10.1117/12.2272919