An Analysis of Block Sampling Strategies in Compressed Sensing

DOI10.1109/TIT.2016.2524628MaRDI QIDQ2976935zbMATH OpenOpenAlexFDO

Authors Jérémie Bigot, Claire Boyer, Pierre Weiss

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.4446

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance since they cannot be implemented on real acquisition systems. In this paper, we study a new random sampling approach that consists in projecting the signal over blocks of sensing vectors. A typical example is the case of blocks made of horizontal lines in the 2D Fourier plane. We provide theoretical results on the number of blocks that are required for exact sparse signal reconstruction. This number depends on two properties named intra and inter-support block coherence. We then show through a series of examples including Gaussian measurements, isolated measurements or blocks in time-frequency bases, that the main result is sharp in the sense that the minimum amount of blocks necessary to reconstruct sparse signals cannot be improved up to a multiplicative logarithmic factor. The proposed results provide a good insight on the possibilities and limits of block compressed sensing in imaging devices such as magnetic resonance imaging, radio-interferometry or ultra-sound imaging.

Recommendations

• Estimation of block sparsity in compressive sensing
• A perturbation analysis of nonconvex block-sparse compressed sensing
• A Compressed Sensing Approach to Block-Iterative Equalizers
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• A perturbation analysis of block-sparse compressed sensing via mixed _2/_1 minimization
• A new bound on the block restricted isometry constant in compressed sensing
• A numerical exploration of compressed sampling recovery
• Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm

Cited in

(15)

• Infinite-dimensional compressed sensing and function interpolation
• Random sampling of bandlimited signals on graphs
• Image reconstruction based on improved block compressed sensing
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
• Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
• The Nyquist sampling rate for spiraling curves
• Breaking the coherence barrier: a new theory for compressed sensing
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• Fusion frames and distributed sparsity
• Optimal compressive imaging of Fourier data
• WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
• On the generation of sampling schemes for magnetic resonance imaging
• A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
• Adapted variable density subsampling for compressed sensing

This page was built for publication: An Analysis of Block Sampling Strategies in Compressed Sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976935)