Model-Based Compressive Sensing

By Richard Baraniuk, Volkan Cevher, Marco F. Duarte, Chinmay Hegde. IEEE Transactions on Information Theory, 2008

2,612 citations recorded by the source corpus.

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.

Subfields: Applied Mathematics, Computational Mechanics, Control and Systems Engineering

View Paper: https://www.semanticscholar.org/paper/bf852287566cda9c2f391fa8f7f19122e0671558

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Richard Baraniuk
  2. Francis R. Bach
  3. Marco F. Duarte
  4. Yonina C. Eldar
  5. Bhaskar D. Rao
  6. Julien Mairal
  7. Steven L. Brunton
  8. Zhilin Zhang

In Computational Mechanics

  1. Francis R. Bach
  2. Julien Mairal
  3. Yonina C. Eldar
  4. Richard Baraniuk
  5. Marco F. Duarte
  6. Steven L. Brunton
  7. Jean Ponce
  8. Guillaume Obozinski

In Control and Systems Engineering

  1. Steven L. Brunton
  2. Francis R. Bach
  3. J. Nathan Kutz
  4. Peter Richtárik
  5. Joshua L. Proctor
  6. Bingni W. Brunton
  7. Mark W. Schmidt
  8. Tong Zhang

Citations in the corpus