On oracle-type local recovery guarantees in compressed sensing

by   Ben Adcock, et al.

We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order to reflect the structured acquisition that is often encountered in applications; (ii) where the signal has an arbitrary structured sparsity, by results depending on its support S. Within this framework and under a random sign assumption, the number of measurements needed by l1 minimization can be shown to be of the same order than the one required by an oracle least-squares estimator. Moreover, these bounds can be minimized by adapting the variable density sampling to a given prior on the signal support and to the coherence of the measurements. We illustrate both numerically and analytically that our results can be successfully applied to recover Haar wavelet coefficients that are sparse in levels from random Fourier measurements in dimension one and two, which can be of particular interest in imaging problems. Finally, a preliminary numerical investigation shows the potential of this theory for devising adaptive sampling strategies in sparse polynomial approximation.


page 2

page 19

page 24


Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing

A signature result in compressed sensing is that Gaussian random samplin...

Stable Recovery of Weighted Sparse Signals from Phaseless Measurements via Weighted l1 Minimization

The goal of phaseless compressed sensing is to recover an unknown sparse...

Adapted variable density subsampling for compressed sensing

Recent results in compressed sensing showed that the optimal subsampling...

Reducing Sampling Ratios and Increasing Number of Estimates Improve Bagging in Sparse Regression

Bagging, a powerful ensemble method from machine learning, improves the ...

Stable and robust sampling strategies for compressive imaging

In many signal processing applications, one wishes to acquire images tha...

Compressed sensing in the presence of speckle noise

The problem of recovering a structured signal from its linear measuremen...

Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design

In the field of uncertainty quantification, sparse polynomial chaos (PC)...

Please sign up or login with your details

Forgot password? Click here to reset