Paper
24 August 2015 A fast algorithm for reconstruction of spectrally sparse signals in super-resolution
Jian-Feng Cai, Suhui Liu, Weiyu Xu
Author Affiliations +
Abstract
We propose a fast algorithm to reconstruct spectrally sparse signals from a small number of randomly observed time domain samples. Different from conventional compressed sensing where frequencies are discretized, we consider the super-resolution case where the frequencies can be any values in the normalized continuous frequency domain [0; 1). We first convert our signal recovery problem into a low rank Hankel matrix completion problem, for which we then propose an efficient feasible point algorithm named projected Wirtinger gradient algorithm(PWGA). The algorithm can be further accelerated by a scheme inspired by the fast iterative shrinkage-thresholding algorithm (FISTA). Numerical experiments are provided to illustrate the effectiveness of our proposed algorithm. Different from earlier approaches, our algorithm can solve problems of large scale efficiently.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jian-Feng Cai, Suhui Liu, and Weiyu Xu "A fast algorithm for reconstruction of spectrally sparse signals in super-resolution", Proc. SPIE 9597, Wavelets and Sparsity XVI, 95970A (24 August 2015); https://doi.org/10.1117/12.2188489
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Reconstruction algorithms

Super resolution

Matrices

Convex optimization

Compressed sensing

Algorithms

Monte Carlo methods

Back to Top