A remark on compressed sensing
DOI10.1134/S0001434607110193zbMath1155.94014MaRDI QIDQ941909
Vladimir N. Temlyakov, Boris S. Kashin
Publication date: 2 September 2008
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434607110193
signal processing; sparsity; Kolmogorov width; recovery; combinatorial optimization problem; compressed sensing; restricted isometry property; compressive sampling; Gelfand width
46B20: Geometry and structure of normed linear spaces
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
41A46: Approximation by arbitrary nonlinear expressions; widths and entropy
94A20: Sampling theory in information and communication theory
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Atomic Decomposition by Basis Pursuit
- Compressed sensing and best 𝑘-term approximation
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing