Recovery of Clustered Sparse Signals from Compressive Measurements
نویسندگان
چکیده
We introduce a new signal model, called (K,C)-sparse, to capture K-sparse signals in N dimensions whose nonzero coefficients are contained within at most C clusters, with C < K ≪ N . In contrast to the existing work in the sparse approximation and compressive sensing literature on block sparsity, no prior knowledge of the locations and sizes of the clusters is assumed. We prove that O (K + C log(N/C))) random projections are sufficient for (K,C)-model sparse signal recovery based on subspace enumeration. We also provide a robust polynomialtime recovery algorithm for (K,C)-model sparse signals with provable estimation guarantees.
منابع مشابه
Sparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the theory of CS to include signals that are concisely represented in terms of a graphical model. In particular, we useMarkov Random Fields (MRFs) to represent sparse signals whose nonzero coefficients are clustered. Our new...
متن کاملNew Wavelet Coefficient Raster Scannings for Compressive Imaging
The Delsarte-Goethals frame has been proposed for deterministic compressive sensing of sparse and compressible signals. Its performance in compressive imaging applications falls short of that obtained for arbitrary sparse vectors. Prior work has proposed specially tailored signal recovery algorithms that partition the recovery of the input vector into clustered and unclustered portions. In this...
متن کاملCompressive Sensing for Cluster Structured Sparse Signals: Variational Bayes Approach
Compressive Sensing (CS) provides a new paradigm of sub-Nyquist sampling which can be considered as an alternative to Nyquist sampling theorem. In particular, providing that signals are with sparse representations in some known space (or domain), information can be perfectly preserved even with small amount of measurements captured by random projections. Besides sparsity prior of signals, the i...
متن کاملManifold-Based Signal Recovery and Parameter Estimation from Compressive Measurements
A field known as Compressive Sensing (CS) has recently emerged to help address the growing challenges of capturing and processing high-dimensional signals and data sets. CS exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive (or random) linear measurements of that signal. Strong theoretical guarantees have been establi...
متن کاملOn the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements
On the optimality of a ℓ 1 /ℓ 1 solver for sparse signal recovery from sparsely corrupted compressive measurements. Abstract This short note proves the ℓ 2 − ℓ 1 instance optimality of a ℓ 1 /ℓ 1 solver, i.e., a variant of basis pursuit denoising with a ℓ 1 fidelity constraint, when applied to the estimation of sparse (or compressible) signals observed by sparsely corrupted compressive measurem...
متن کامل