Sparse Recovery Using Sparse Matrices

Author(s)
Gilbert, Anna; Indyk, Piotr
Thumbnail
DownloadGilbert-2010-Sparse Recovery Using Sparse Matrices.pdf (236.8Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
In this paper, we survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices has several attractive properties: they support algorithms with low computational complexity, and make it easy to perform incremental updates to signals. We discuss applications to several areas, including compressive sensing, data stream computing, and group testing.
Date issued
2010-06
URI
http://hdl.handle.net/1721.1/70932
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Proceedings of the IEEE
Publisher
Institute of Electrical and Electronics Engineers
Citation
Gilbert, Anna, and Piotr Indyk. “Sparse Recovery Using Sparse Matrices.” Proceedings of the IEEE 98.6 (2010): 937–947. Web. ©2010 IEEE.
Version: Final published version
Other identifiers
INSPEC Accession Number: 11304844
ISSN
0018-9219
Collections