Approximation Algorithms for Model-Based Compressive Sensing
Compressive sensing (CS) states that a sparse signal can be recovered from a small number of linear measurements, and that this recovery can be performed efficiently in polynomial time. The framework of model-based CS (model-CS) leverages additional structure in the signal and provides new recovery...
Main Authors: | Hegde, Chinmay, Indyk, Piotr, Schmidt, Ludwig |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
Online Access: | http://hdl.handle.net/1721.1/113846 https://orcid.org/0000-0002-7983-9524 https://orcid.org/0000-0002-9603-7056 |
Similar Items
-
Approximation-tolerant model-based compressive sensing
by: Hegde, Chinmay, et al.
Published: (2018) -
Nearly Linear-Time Model-Based Compressive Sensing
by: Hegde, Chinmay, et al.
Published: (2018) -
Fast recovery from a union of subspaces
by: Hegde, Chinmay, et al.
Published: (2021) -
Better approximations for Tree Sparsity in Nearly-Linear Time
by: Backurs, Arturs, et al.
Published: (2017) -
New LSH-based Algorithm for Approximate Nearest Neighbor
by: Andoni, Alexandr, et al.
Published: (2005)