Sparse Recovery Using Sparse Matrices

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 t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the IEEE Jg. 98; H. 6; S. 937 - 947
Hauptverfasser: Gilbert, Anna, Indyk, Piotr
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.06.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Compressive sensing
Computation
Computational complexity
Encoding
expanders
Hardware
Image coding
Mathematical analysis
Mathematics
Matrices
Matrix methods
Recovery
Signal processing
Signal processing algorithms
Sparse matrices
sparse recovery
streaming algorithms
Streams
Testing
Vectors
ISSN:0018-9219, 1558-2256
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0018-9219
1558-2256
DOI:10.1109/JPROC.2010.2045092