Compressed sensing with structured sparsity and structured acquisition
From MaRDI portal
Publication:1713639
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.
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
Cites work
- A Probabilistic and RIPless Theory of Compressed Sensing
- A mathematical introduction to compressive sensing
- An algorithm for variable density sampling with block-constrained acquisition
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed sensing
- Compressive sensing and structured random matrices
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- Generalized sampling and infinite-dimensional compressed sensing
- Just relax: convex programming methods for identifying sparse signals in noise
- Model-Based Compressive Sensing
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On minimal trajectories for mobile sampling of bandlimited fields
- 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
- Optimization with sparsity-inducing penalties
- Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Robust Recovery of Signals From a Structured Union of Subspaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling High-Dimensional Bandlimited Fields on Low-Dimensional Manifolds
- Stable and Robust Sampling Strategies for Compressive Imaging
- Stable signal recovery from incomplete and inaccurate measurements
- Structured Compressed Sensing: From Theory to Applications
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- User-friendly tail bounds for sums of random matrices
- Variable density sampling with continuous trajectories
- Why do commercial CT scanners still employ traditional, filtered back-projection for image reconstruction?
Cited in
(21)- Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
- Cosparsity in Compressed Sensing
- An algorithm for variable density sampling with block-constrained acquisition
- Variable density sampling with continuous trajectories
- Optimal compressive imaging of Fourier data
- The Nyquist sampling rate for spiraling curves
- Submatrices with nonuniformly selected random supports and insights into sparse approximation
- Relay fusion frames and bridging results for fusion frames
- Structured iterative hard thresholding with on- and off-grid applications
- On the generation of sampling schemes for magnetic resonance imaging
- Random sampling of bandlimited signals on graphs
- Fully Decomposable Compressive Sampling With Joint Optimization for Multidimensional Sparse Representation
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Coherence pattern-guided compressive sensing with unresolved grids
- Compressed sensing photoacoustic tomography reduces to compressed sensing for undersampled Fourier measurements
- Breaking the coherence barrier: a new theory for compressed sensing
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
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)
