Sparse Recovery Using Sparse Matrices
Name
Gilbert-2010-Sparse Recovery Using Sparse Matrices.pdf
Size
236.81 KB
Format
Adobe PDF
Checksum (MD5)
cb98ba8fe9a48da385dff997b7b8f04f
Author(s)
Gilbert, Anna
Indyk, Piotr
Date Issued
June 2010
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/jproc.2010.2045092
