An empirical eigenvalue-threshold test for sparsity level estimation from compressed measurements

A. Lavrenko, F. Romer, G. Del Galdo, R. Thoma, O. Arikan

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)


Compressed sensing allows for a significant reduction of the number of measurements when the signal of interest is of a sparse nature. Most computationally efficient algorithms for signal recovery rely on some knowledge of the sparsity level, i.e., the number of non-zero elements. However, the sparsity level is often not known a priori and can even vary with time. In this contribution we show that it is possible to estimate the sparsity level directly in the compressed domain, provided that multiple independent observations are available. In fact, one can use classical model order selection algorithms for this purpose. Nevertheless, due to the influence of the measurement process they may not perform satisfactorily in the compressed sensing setup. To overcome this drawback, we propose an approach which exploits the empirical distributions of the noise eigenvalues. We demonstrate its superior performance compared to state-of-the-art model order estimation algorithms numerically.

Original languageEnglish
Title of host publication2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014
Number of pages5
ISBN (Electronic)9780992862619
Publication statusPublished - 13 Nov 2014
Externally publishedYes
Event22nd European Signal Processing Conference, EUSIPCO 2014 - Lisbon, Portugal
Duration: 1 Sept 20145 Sept 2014
Conference number: 22


Conference22nd European Signal Processing Conference, EUSIPCO 2014
Abbreviated titleEUSIPCO 2014
Internet address


  • Compressed sensing
  • detection
  • model order selection
  • sparsity level

Cite this