# Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions

Abstract : Efficient recovery of smooth functions which are $s$-sparse with respect to the base of so--called Prolate Spheroidal Wave Functions from a small number of random sampling points is considered. The main ingredient in the design of both the algorithms we propose here consists in establishing a uniform $L^\infty$ bound on the measurement ensembles which constitute the columns of the sensing matrix. Such a bound provides us with the Restricted Isometry Property for this rectangular random matrix, which leads to either the exact recovery property or the ''best $s$-term approximation" of the original signal by means of the $\ell^1$ minimization program. The first algorithm considers only a restricted number of columns for which the $L^\infty$ holds as a consequence of the fact that eigenvalues of the Bergman's restriction operator are close to 1 whereas the second one allows for a wider system of PSWF by taking advantage of a preconditioning technique. Numerical examples are spread throughout the text to illustrate the results.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [59 references]

https://hal.archives-ouvertes.fr/hal-00560962
Contributor : Laurent Gosse <>
Submitted on : Monday, May 30, 2011 - 1:30:24 PM
Last modification on : Monday, March 21, 2016 - 11:33:26 AM
Document(s) archivé(s) le : Wednesday, August 31, 2011 - 2:27:52 AM

### Files

romprolate.pdf
Files produced by the author(s)

### Citation

Laurent Gosse. Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions. Annali dell'Universita di Ferrara, Springer Verlag, 2012, pp.81-116. ⟨10.1007/s11565-012-0159-3⟩. ⟨hal-00560962v2⟩

Record views