Stability Results for Random Sampling of Sparse Trigonometric Polynomials

Authors:
H. Rauhut
Affiliations:
NuHAG, Univ. of Vienna, Vienna
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 5

Probabilistic spherical Marcinkiewicz-Zygmund inequalities

Journal of Approximation Theory
Sparse approximate solution of partial differential equations

Applied Numerical Mathematics
Average case analysis of multichannel sparse recovery using convex relaxation

IEEE Transactions on Information Theory
Coherence Pattern-Guided Compressive Sensing with Unresolved Grids

SIAM Journal on Imaging Sciences
Full length article: Nonuniform support recovery from noisy random measurements by Orthogonal Matching Pursuit

Journal of Approximation Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

Recently, it has been observed that a sparse trigonometric polynomial, i.e., having only a small number of nonzero coefficients, can be reconstructed exactly from a small number of random samples using basis pursuit (BP) or orthogonal matching pursuit (OMP). In this paper, it is shown that recovery by a BP variant is stable under perturbation of the samples values by noise. A similar partial result for OMP is provided. For BP, in addition, the stability result is extended to (nonsparse) trigonometric polynomials that can be well approximated by sparse ones. The theoretical findings are illustrated by numerical experiments.