Compressed sensing with structured sparsity and structured acquisition

DOI10.1016/J.ACHA.2017.05.005zbMATH Open1454.94010arXiv1505.01619OpenAlexW1800346269MaRDI QIDQ1713639FDOQ1713639

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

Publication date: 25 January 2019

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: Compressed Sensing (CS) is an appealing framework for applications such as Magnetic Resonance Imaging (MRI). However, up-to-date, the sensing schemes suggested by CS theories are made of random isolated measurements, which are usually incompatible with the physics of acquisition. To reflect the physical constraints of the imaging device, we introduce the notion of blocks of measurements: the sensing scheme is not a set of isolated measurements anymore, but a set of groups of measurements which may represent any arbitrary shape (parallel or radial lines for instance). Structured acquisition with blocks of measurements are easy to implement, and provide good reconstruction results in practice. However, very few results exist on the theoretical guarantees of CS reconstructions in this setting. In this paper, we derive new CS results for structured acquisitions and signals satisfying a prior structured sparsity. The obtained results provide a recovery probability of sparse vectors that explicitly depends on their support. Our results are thus support-dependent and offer the possibility for flexible assumptions on the sparsity structure. Moreover, the results are drawing-dependent, since we highlight an explicit dependency between the probability of reconstructing a sparse vector and the way of choosing the blocks of measurements. Numerical simulations show that the proposed theory is faithful to experimental observations.

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

Recommendations

• Structured Compressed Sensing: From Theory to Applications
• Compressed sensing and sparse filtering
• Compressed sensing
• Compressed sensing
• Compressed Sensing and Parallel Acquisition
• Compressive sensing
• Compressive Sensing
• Compressive sensing and structured random matrices
• Compressive sensing with redundant dictionaries and structured measurements
• Compressive Sensing of Sparse Tensors

zbMATH Keywords

compressed sensingMRIstructured sparsity\(\ell_1\) minimizationexact recoveryblocks of measurements

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Just relax: convex programming methods for identifying sparse signals in noise
• Stable signal recovery from incomplete and inaccurate measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing
• User-friendly tail bounds for sums of random matrices
• Optimization with sparsity-inducing penalties
• A mathematical introduction to compressive sensing
• Why do commercial CT scanners still employ traditional, filtered back-projection for image reconstruction?
• A Probabilistic and RIPless Theory of Compressed Sensing
• Stable and Robust Sampling Strategies for Compressive Imaging
• Exact Recovery Conditions for Sparse Representations With Partial Support Information
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• On minimal trajectories for mobile sampling of bandlimited fields
• Compressive sensing and structured random matrices
• Structured Compressed Sensing: From Theory to Applications
• Model-Based Compressive Sensing
• Robust Recovery of Signals From a Structured Union of Subspaces
• Generalized sampling and infinite-dimensional compressed sensing
• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• Breaking the coherence barrier: a new theory for compressed sensing
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• Variable density sampling with continuous trajectories
• 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
• Sampling High-Dimensional Bandlimited Fields on Low-Dimensional Manifolds
• An algorithm for variable density sampling with block-constrained acquisition
• Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing

Cited In (21)

• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
• Relay fusion frames and bridging results for fusion frames
• The Nyquist sampling rate for spiraling curves
• Fully Decomposable Compressive Sampling With Joint Optimization for Multidimensional Sparse Representation
• Coherence pattern-guided compressive sensing with unresolved grids
• Compressed Sensing Photoacoustic Tomography Reduces to Compressed Sensing for Undersampled Fourier Measurements
• Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation
• Random sampling of bandlimited signals on graphs
• Variable density sampling with continuous trajectories
• On the generation of sampling schemes for magnetic resonance imaging
• Optimal Compressive Imaging of Fourier Data
• An algorithm for variable density sampling with block-constrained acquisition
• WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions
• Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
• Cosparsity in Compressed Sensing
• Structured iterative hard thresholding with on- and off-grid applications
• Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
• Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
• Breaking the coherence barrier: a new theory for compressed sensing
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
• A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry

This page was built for publication: Compressed sensing with structured sparsity and structured acquisition

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