Measurement Bounds for Sparse Signal Ensembles via Graphical Models
From MaRDI portal
Abstract: In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing (DCS) extends this framework by defining ensemble sparsity models, allowing a correlated ensemble of sparse signals to be jointly recovered from a collection of separately acquired compressive measurements. In this paper, we introduce a framework for modeling sparse signal ensembles that quantifies the intra- and inter-signal dependencies within and among the signals. This framework is based on a novel bipartite graph representation that links the sparse signal coefficients with the measurements obtained for each signal. Using our framework, we provide fundamental bounds on the number of noiseless measurements that each sensor must collect to ensure that the signals are jointly recoverable.
Recommendations
- Recovery of sums of sparse and dense signals by incorporating graphical structure among predictors
- Sparse sensing for statistical inference
- On the sparsity of signals in a random sample
- Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
- A simple Gaussian measurement bound for exact recovery of block-sparse signals
- Estimation of large sets of stochastic signals: the case of sparse sampling
- Theoretical guarantees for graph sparse coding
- Non-Bayesian Estimation Framework for Signal Recovery on Graphs
- Processing of sparse signals and mutual coherence of ``measurable vectors
- Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
This page was built for publication: Measurement Bounds for Sparse Signal Ensembles via Graphical Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346457)