Model-Based Compressive Sensing
From MaRDI portal
Abstract: Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K << N elements from an N-dimensional basis. Instead of taking periodic samples, CS measures inner products with M < N random vectors and then recovers the signal via a sparsity-seeking optimization or greedy algorithm. Standard CS dictates that robust signal recovery is possible from M = O(K log(N/K)) measurements. It is possible to substantially decrease M without sacrificing robustness by leveraging more realistic signal models that go beyond simple sparsity and compressibility by including structural dependencies between the values and locations of the signal coefficients. This paper introduces a model-based CS theory that parallels the conventional theory and provides concrete guidelines on how to create model-based recovery algorithms with provable performance guarantees. A highlight is the introduction of a new class of structured compressible signals along with a new sufficient condition for robust structured compressible signal recovery that we dub the restricted amplification property, which is the natural counterpart to the restricted isometry property of conventional CS. Two examples integrate two relevant signal models - wavelet trees and block sparsity - into two state-of-the-art CS recovery algorithms and prove that they offer robust recovery from just M=O(K) measurements. Extensive numerical simulations demonstrate the validity and applicability of our new theory and algorithms.
Cited in
(only showing first 100 items - show all)- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Bayesian robust principal component analysis with structured sparse component
- Expander \(\ell_0\)-decoding
- PROMP: a sparse recovery approach to lattice-valued signals
- Generalized Kalman smoothing: modeling and algorithms
- Compressed sensing with structured sparsity and structured acquisition
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Sparsity preserving discriminant projections with applications to face recognition
- Compressive sensing based sampling and reconstruction for wireless sensor array network
- Sparsity driven people localization with a heterogeneous network of cameras
- Robust non-parametric regression via incoherent subspace projections
- Uncertainty quantification for Bayesian CART
- Structured iterative hard thresholding with on- and off-grid applications
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Hierarchical compressed sensing
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Hierarchical isometry properties of hierarchical measurements
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction
- Discrete optimization methods for group model selection in compressed sensing
- Spectral compressive sensing
- Stable restoration and separation of approximately sparse signals
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- Sparse reconstruction with multiple Walsh matrices
- Optimization problems involving group sparsity terms
- Sparse feature map-based Markov models for nonlinear fluid flows
- Near oracle performance and block analysis of signal space greedy methods
- Greedy signal space methods for incoherence and beyond
- Recovery error analysis of noisy measurement in compressed sensing
- A new bound on the block restricted isometry constant in compressed sensing
- Quantization of compressive samples with stable and robust recovery
- Globally sparse and locally dense signal recovery for compressed sensing
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Model's sparse representation based on reduced mixed GMsFE basis methods
- Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Compressed sensing of low-rank plus sparse matrices
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- Classification of spatiotemporal data via asynchronous sparse sampling: application to flow around a cylinder
- Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements
- Breaking the coherence barrier: a new theory for compressed sensing
- Approximation Algorithms for Model-Based Compressive Sensing
- Compressed sensing by iterative thresholding of geometric wavelets: a comparing study
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
- Sparse recovery with partial support knowledge
- Compressed sensing and dynamic mode decomposition
- On reconstructing functions from binary measurements
- Sharp MSE bounds for proximal denoising
- Typical reconstruction limits for distributed compressed sensing based on \(\ell_{2,1} \)-norm minimization and Bayesian optimal reconstruction
- Typical reconstruction performance for distributed compressed sensing based on \(\ell_{2,1} \)-norm regularized least square and Bayesian optimal reconstruction: influences of noise
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics
- Sparsity based methods for overparameterized variational problems
- Cellular automata for efficient image and video compression
- A survey of compressed sensing
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- Structured sparsity: discrete and convex approaches
- Block sparse recovery via mixed l₂/l₁ minimization
- Compressive sensing SAR range compression with chirp scaling principle
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Sparsity constrained estimation in image processing and computer vision
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- Representation and coding of signal geometry
- Robust face recognition via block sparse Bayesian learning
- Single-frame signal recovery using a similarity-prior
- Estimation of block sparsity in compressive sensing
- Fast thresholding algorithms with feedbacks and partially known support for compressed sensing
- CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction
- Sampling, Metric Entropy, and Dimensionality Reduction
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- A survey on compressive sensing: classical results and recent advancements
- Signal Decomposition Using Masked Proximal Operators
- Structured sparsity through convex optimization
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Block sparse signal recovery via minimizing the block q-ratio sparsity
- Sparse Bayesian learning with automatic-weighting Laplace priors for sparse signal recovery
- A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- Moving force identification based on group Lasso and compressed sensing
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- Regularized least absolute deviation-based sparse identification of dynamical systems
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Constrained mix sparse optimization via hard thresholding pursuit
- Bisparse blind deconvolution through hierarchical sparse recovery
- Optimal sampling for least-squares approximation
- On mixing rates for Bayesian CART
- Combining physics-based and data-driven models: advancing the frontiers of research with scientific machine learning
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- A randomized algorithm for model-based sparse signal recovery
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Optimal group thresholding algorithms for group sparse optimization with convergence guarantee
- Foveated compressed sensing
This page was built for publication: Model-Based Compressive Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281550)
