modelbased-preprint-2009 - arXiv:0808.3572v3 [cs.IT] 2 Jul...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: arXiv:0808.3572v3 [cs.IT] 2 Jul 2009 Model-Based Compressive Sensing Richard G. Baraniuk, Volkan Cevher, Marco F. Duarte, Chinmay Hegde Department of Electrical and Computer Engineering Rice University Abstract 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, we measure inner products with M < N random vectors and then recover the signal via a sparsity-seeking optimization or greedy algorithm. The standard CS theory dictates that robust signal recovery is possible from M = O ( K log( N/K )) measurements. The goal of this paper is to demonstrate that it is possible to substantially decrease M without sacrificing robustness by leveraging more realistic signal models that go beyond simple sparsity and compressibility by includ- ing structural dependencies between the values and locations of the signal coefficients. We introduce 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 (RAmP). The RAmP is the natural counterpart to the restricted isometry property (RIP) of conventional CS. To take practical advantage of the new theory, we 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. Index Terms Compressive sensing, sparsity, signal model, union of subspaces, wavelet tree, block sparsity The authors are listed alphabetically. Email: { richb, volkan, duarte, chinmay } @rice.edu; Web: dsp.rice.edu/cs. This work was supported by the grants NSF CCF-0431150, CCF-0728867, CNS-0435425, and CNS-0520280, DARPA/ONR N66001-08- 1-2065, ONR N00014-07-1-0936, N00014-08-1-1067, N00014-08-1-1112, and N00014-08-1-1066, AFOSR FA9550-07-1-0301, ARO MURI W311NF-07-1-0185, and the Texas Instruments Leadership University Program. I. INTRODUCTION We are in the midst of a digital revolution that is enabling the development and deployment of new sensors and sensing systems with ever increasing fidelity and resolution. The theoretical foundation is the Shannon/Nyquist sampling theorem, which states that a signal’s information is preserved if it is uniformly sampled at a rate at least two times faster than its Fourier bandwidth....
View Full Document

Page1 / 50

modelbased-preprint-2009 - arXiv:0808.3572v3 [cs.IT] 2 Jul...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online