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

zbMATH Keywords

signal processing; sparsity; Kolmogorov width; recovery; combinatorial optimization problem; compressed sensing; restricted isometry property; compressive sampling; Gelfand width

Mathematics Subject Classification ID

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

Bounding the restricted isometry constants for a tight frame, Search for Sparse Active Inputs: A Review, Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing, Sampling, Metric Entropy, and Dimensionality Reduction, On error correction with errors in both the channel and syndrome, 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, On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing, Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling, Discrete uncertainty principles and sparse signal processing, On the size of incoherent systems, Separable collusion-secure multimedia codes, Local recovery bounds for prior support constrained compressed sensing, RIPless compressed sensing from anisotropic measurements, Construction of Sparse Binary Sensing Matrices Using Set Systems, 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