Fast recovery from a union of subspaces
© 2016 NIPS Foundation - All Rights Reserved. We address the problem of recovering a high-dimensional but structured vector from linear observations in a general setting where the vector can come from an arbitrary union of subspaces. This setup includes well-studied problems such as compressive sens...
Main Authors: | Indyk, Piotr (Author), Schmidt, Ludwig (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2021-11-08T13:01:41Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Fast recovery from a union of subspaces
by: Hegde, Chinmay, et al.
Published: (2021) -
Almost-Euclidean Subspaces of ℓ1N via Tensor Products: A Simple Approach to Randomness Reduction
by: Indyk, Piotr, et al.
Published: (2012) -
Sampling and reconstructing signals from a union of linear subspaces
by: Blumensath, Thomas
Published: (2011) -
Sampling theorems for signals from the union of finite-dimensional linear subspaces
by: Blumensath, Thomas, et al.
Published: (2009) -
Fast Iterative Subspace Algorithms for Airborne STAP Radar
by: Belkacemi Hocine, et al.
Published: (2006-01-01)