## Nearly Linear-Time Model-Based Compressive Sensing

##### Author(s)

Hegde, Chinmay; Indyk, Piotr; Schmidt, Ludwig
DownloadNearly linear.pdf (563.7Kb)

OPEN_ACCESS_POLICY

# Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

##### Terms of use

##### Metadata

Show full item record##### Abstract

Compressive sensing is a method for recording a k-sparse signal x ∈ ℝ[superscript n] with (possibly noisy) linear measurements of the form y = Ax, where A ∈ ℝ[superscript m × n] describes the measurement process. Seminal results in compressive sensing show that it is possible to recover the signal x from m=O(k log n/k) measurements and that this is tight. The model-based compressive sensing framework overcomes this lower bound and reduces the number of measurements further to m = O(k). This improvement is achieved by limiting the supports of x to a structured sparsity model, which is a subset of all (n/k) possible k-sparse supports. This approach has led to measurement-efficient recovery schemes for a variety of signal models, including tree-sparsity and block-sparsity.
While model-based compressive sensing succeeds in reducing the number of measurements, the framework entails a computationally expensive recovery process. In particular, two main barriers arise: (i) Existing recovery algorithms involve several projections into the structured sparsity model. For several sparsity models (such as tree-sparsity), the best known model-projection algorithms run in time Ω(kn), which can be too slow for large k. (ii) Existing recovery algorithms involve several matrix-vector multiplications with the measurement matrix A. Unfortunately, the only known measurement matrices suitable for model-based compressive sensing require O(nk) time for a single multiplication, which can be (again) too slow for large k.
In this paper, we remove both aforementioned barriers for two popular sparsity models and reduce the complexity of recovery to nearly linear time. Our main algorithmic result concerns the tree-sparsity model, for which we solve the model-projection problem in O(n logn + k log[superscript 2] n) time. We also construct a measurement matrix for model-based compressive sensing with matrix-vector multiplication in O(n logn) time for k ≤ n [superscript 1/2 − μ], μ > 0. As an added bonus, the same matrix construction can also be used to give a fast recovery scheme for the block-sparsity model.
Keywords: Model-based compressive sensing; model-projection; tree-sparsity'; restricted isometry property; compressive sensing

##### Date issued

2014-07##### Department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science##### Journal

Automata, Languages, and Programming

##### Publisher

Springer Berlin Heidelberg

##### Citation

Hegde, Chinmay, et al. “Nearly Linear-Time Model-Based Compressive Sensing.” Automata, Languages, and Programming, edited by Javier Esparza et al., vol. 8572, Springer Berlin Heidelberg, 2014, pp. 588–99.

Version: Author's final manuscript

##### ISBN

978-3-662-43947-0

978-3-662-43948-7

##### ISSN

0302-9743

1611-3349