Adapted variable density subsampling for compressed sensing

by   Simon Ruetz, et al.

Recent results in compressed sensing showed that the optimal subsampling strategy should take into account the sparsity pattern of the signal at hand. This oracle-like knowledge, even though desirable, nevertheless remains elusive in most practical application. We try to close this gap by showing how the sparsity patterns can instead be characterised via a probability distribution on the supports of the sparse signals allowing us to again derive optimal subsampling strategies. This probability distribution can be easily estimated from signals of the same signal class, achieving state of the art performance in numerical experiments. Our approach also extends to structured acquisition, where instead of isolated measurements, blocks of measurements are taken.


page 10

page 11

page 12

page 13


Anisotropic compressed sensing for non-Cartesian MRI acquisitions

In the present note we develop some theoretical results in the theory of...

On oracle-type local recovery guarantees in compressed sensing

We present improved sampling complexity bounds for stable and robust spa...

Probabilistic index maps for modeling natural signals

One of the major problems in modeling natural signals is that signals wi...

Instance-Optimal Compressed Sensing via Posterior Sampling

We characterize the measurement complexity of compressed sensing of sign...

Structural Sparsity in Multiple Measurements

We propose a novel sparsity model for distributed compressed sensing in ...

Reconstruction of Sparse Signals under Gaussian Noise and Saturation

Most compressed sensing algorithms do not account for the effect of satu...

Estimating Unknown Sparsity in Compressed Sensing

In the theory of compressed sensing (CS), the sparsity ||x||_0 of the un...