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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the IEEE Ročník 98; číslo 6; s. 937 - 947
Hlavní autoři: Gilbert, Anna, Indyk, Piotr
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.06.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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