Model-Based Compressive Sensing
From MaRDI portal
Publication:5281550
DOI10.1109/TIT.2010.2040894zbMATH Open1366.94215arXiv0808.3572OpenAlexW3125735862MaRDI QIDQ5281550FDOQ5281550
Authors: Richard G. Baraniuk, Volkan Cevher, Marco F. Duarte, Chinmay Hegde 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0808.3572
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Sampling theory in information and communication theory (94A20)
Cited In (98)
- Model's sparse representation based on reduced mixed GMsFE basis methods
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements
- PROMP: a sparse recovery approach to lattice-valued signals
- Hierarchical compressed sensing
- Globally sparse and locally dense signal recovery for compressed sensing
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- Generalized Kalman smoothing: modeling and algorithms
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Recovery error analysis of noisy measurement in compressed sensing
- Spectral compressive sensing
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Estimation of block sparsity in compressive sensing
- Near oracle performance and block analysis of signal space greedy methods
- Stable restoration and separation of approximately sparse signals
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Optimization problems involving group sparsity terms
- Compressed sensing and dynamic mode decomposition
- Quantization of compressive samples with stable and robust recovery
- Sampling, Metric Entropy, and Dimensionality Reduction
- Sparse recovery with partial support knowledge
- Sparse disjointed recovery from noninflating measurements
- Bayesian robust principal component analysis with structured sparse component
- Sparse reconstruction with multiple Walsh matrices
- Sharp MSE bounds for proximal denoising
- Compressive sensing based sampling and reconstruction for wireless sensor array network
- Sparsity preserving discriminant projections with applications to face recognition
- Expander \(\ell_0\)-decoding
- Sparsity driven people localization with a heterogeneous network of cameras
- Robust face recognition via block sparse Bayesian learning
- Sampling in the analysis transform domain
- From compression to compressed sensing
- Interpolation via weighted \(\ell_{1}\) minimization
- Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Sparsity constrained estimation in image processing and computer vision
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- A survey of compressed sensing
- Representation and coding of signal geometry
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
- Compressive sensing SAR range compression with chirp scaling principle
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging
- Compressed sensing with structured sparsity and structured acquisition
- On reconstructing functions from binary measurements
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Robust non-parametric regression via incoherent subspace projections
- Uncertainty quantification for Bayesian CART
- Structured iterative hard thresholding with on- and off-grid applications
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- Compressed sensing of low-rank plus sparse matrices
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Structured sparsity through convex optimization
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- Hierarchical isometry properties of hierarchical measurements
- Foveated compressed sensing
- Typical reconstruction limits for distributed compressed sensing based on \(\ell_{2,1} \)-norm minimization and Bayesian optimal reconstruction
- Cellular automata for efficient image and video compression
- A new bound on the block restricted isometry constant in compressed sensing
- Greedy signal space methods for incoherence and beyond
- Breaking the coherence barrier: a new theory for compressed sensing
- Regularized least absolute deviation-based sparse identification of dynamical systems
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Sparsity based methods for overparameterized variational problems
- Sparse Bayesian learning with automatic-weighting Laplace priors for sparse signal recovery
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Single-frame signal recovery using a similarity-prior
- Discrete optimization methods for group model selection in compressed sensing
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Signal Decomposition Using Masked Proximal Operators
- Fast thresholding algorithms with feedbacks and partially known support for compressed sensing
- Approximation Algorithms for Model-Based Compressive Sensing
- Sparse feature map-based Markov models for nonlinear fluid flows
- Classification of spatiotemporal data via asynchronous sparse sampling: application to flow around a cylinder
- CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction
- A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- Block sparse signal recovery via minimizing the block \(q\)-ratio sparsity
- Structured sparsity: discrete and convex approaches
- 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
- Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN
- Constrained mix sparse optimization via hard thresholding pursuit
- Compressed sensing by iterative thresholding of geometric wavelets: a comparing study
- A survey on compressive sensing: classical results and recent advancements
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction
- Moving force identification based on group Lasso and compressed sensing
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- Typical reconstruction performance for distributed compressed sensing based on \(\ell_{2,1} \)-norm regularized least square and Bayesian optimal reconstruction: influences of noise
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)
