On Variable Density Compressive Sampling

Abstract

We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution provides an optimized sampling profile. This minimization problem is solved with the use of convex optimization algorithms. We also propose a refinement of our technique when prior information is available on the signal support in the sparsity basis. The effectiveness of the method is confirmed by numerical experiments. Our results also provide a theoretical underpinning to state-of-the-art variable density Fourier sampling procedures used in magnetic resonance imaging.

References in corpus (1)

• Sparsity and Incoherence in Compressive Sampling

Cited by in corpus (8)

• Sparsity Averaging Reweighted Analysis (SARA): a novel algorithm for radio-interferometric imaging
• Learning-based Compressive Subsampling
• Spread spectrum magnetic resonance imaging
• Uncertainty quantification for radio interferometric imaging: I. proximal MCMC methods
• Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
• On oracle-type local recovery guarantees in compressed sensing
• Proximal nested sampling for high-dimensional Bayesian model selection
• Interferometric lensless imaging: rank-one projections of image frequencies with speckle illuminations