Sparsity estimation from compressive projections via sparse random matrices

  title={Sparsity estimation from compressive projections via sparse random matrices},
  author={Chiara Ravazzi and Sophie Marie Fosson and Tiziano Bianchi and Enrico Magli},
  journal={Eurasip Journal on Advances in Signal Processing},
The aim of this paper is to develop strategies to estimate the sparsity degree of a signal from compressive projections, without the burden of recovery. We consider both the noise-free and the noisy settings, and we show how to extend the proposed framework to the case of non-exactly sparse signals. The proposed method employs γ-sparsified random matrices and is based on a maximum likelihood (ML) approach, exploiting the property that the acquired measurements are distributed according to a… 
Sparsity Estimation Method in Compressed Data Gathering of Wireless Sensor Networks
A relative threshold based sparsity estimation method (RTSE) is proposed to solve the problem ofSparsity estimation from the measured signal by adjusting the threshold and get the sparsity directly before the reconstruction of the whole sparse signal.
A Compressed Sensing Approach to Group-testing for COVID-19 Detection
We propose Tapestry, a novel approach to pooled testing with application to COVID-19 testing with quantitative Polymerase Chain Reaction (PCR) that can result in shorter testing time and conservation
Identification information sensors of robot systems
The problem of finding an optimal decision rule arises, which, in a number of cases, can be constructed on the basis of a method, based on the definition of the maximum incomplete coefficient of similarity, which passes into the Bayes’ rule.
A Compressed Sensing Approach to Pooled RT-PCR Testing for COVID-19 Detection
Deterministic binary pooling matrices based on combinatorial design ideas of Kirkman Triple Systems are proposed, which balance between good reconstruction properties and matrix sparsity for ease of pooling while requiring fewer tests in practice, which enables large savings using Tapestry at low prevalence rates while maintaining viability at prevalence rates as high as 9.5%.


Signal sparsity estimation from compressive noisy projections via γ-sparsified random matrices
This paper introduces an approximate two-component Gaussian mixture model whose parameters can be estimated via expectation-maximization techniques and demonstrates that the above model is accurate in the large system limit for a proper choice of the sensing matrix sparsifying parameter.
Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
This paper provides sharper necessary conditions for exact support recovery using general (including non-Gaussian) dense measurement matrices, and proves necessary conditions on the number of observations n required for asymptotically reliable recovery using a class of ¿-sparsified measurementMatrices.
Sparsity Order Estimation and its Application in Compressive Spectrum Sensing for Cognitive Radios
A statistical learning methodology is used to quantify the gap between Mr and Me in a closed form via data fitting, which offers useful design guideline for compressive samplers and develops a two-step compressive spectrum sensing algorithm for wideband cognitive radios as an illustrative application.
On the fly estimation of the sparsity degree in Compressed Sensing using sparse sensing matrices
Experimental results on block-based CS acquisition of black and white images show that the proposed adaptive technique outperforms classical CS acquisition methods where the number of measurements is set a priori.
Compressed sensing with sequential observations
This work investigates an alternative scenario where observations are available in sequence and can be stopped as soon as there is reasonable certainty of correct reconstruction, and describes how such a sequence can be solved efficiently.
Compressed Sensing with Very Sparse Gaussian Random Projections
Following a known experimental setup, it is shown that the recovery accuracies of the proposed method are (at least) similar to the standard L1 decoding.
Compressive Sparsity Order Estimation for Wideband Cognitive Radio Receiver
It is shown that the sparsity order of the wideband spectrum can be reliably estimated using the proposed technique using asymptotic eigenvalue probability distribution function of the measured signal's covariance matrix for sparse signals.
High-dimensional Variable Selection with Sparse Random Projections: Measurement Sparsity and Statistical Efficiency
It is proved that it is possible to let the fraction on non-zero entries γ → 0 at some rate, yielding measurement matrices with a vanishing fraction of non-zeros per row, while retaining the same statistical efficiency as dense ensembles.
Sparsity estimation in image compressive sensing
The experimental results with a large number of photo pictures show that, quite most reconstructed images using the pre-calculated number of measurements have good enough quality, which confirms the proposed image-complexity-based model well.
Compressed Sensing With Cross Validation
  • Rachel A. Ward
  • Computer Science
    IEEE Transactions on Information Theory
  • 2009
It is shown in this paper that sharp bounds on the error between x and the best k-term approximation to x can be estimated for p values of k with almost no cost.