A remark on compressed sensing

DOI10.1134/S0001434607110193zbMath1155.94014OpenAlexW2030034184MaRDI 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

zbMATH Keywords

signal processingsparsityKolmogorov widthrecoverycombinatorial optimization problemcompressed sensingrestricted isometry propertycompressive samplingGelfand width

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Sampling theory in information and communication theory (94A20)

Related Items (17)

The gap between the null space property and the restricted isometry property ⋮ Carl's inequality for quasi-Banach spaces ⋮ Deterministic bounds for restricted isometry in compressed sensing matrices ⋮ Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling ⋮ RIPless compressed sensing from anisotropic measurements ⋮ Bounding the restricted isometry constants for a tight frame ⋮ Discrete uncertainty principles and sparse signal processing ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Search for Sparse Active Inputs: A Review ⋮ On the size of incoherent systems ⋮ Construction of Sparse Binary Sensing Matrices Using Set Systems ⋮ Separable collusion-secure multimedia codes ⋮ Sampling, Metric Entropy, and Dimensionality Reduction ⋮ Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing ⋮ Local recovery bounds for prior support constrained compressed sensing ⋮ On error correction with errors in both the channel and syndrome ⋮ SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY

Uses Software

• PDCO

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

This page was built for publication: A remark on compressed sensing