Random sampling of sparse trigonometric polynomials
From MaRDI portal
Publication:861807
DOI10.1016/j.acha.2006.05.002zbMath1123.94004arXivmath/0512642MaRDI QIDQ861807
Publication date: 2 February 2007
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512642
random matrices; trigonometric polynomials; set partitions; random sampling; sparse recovery; basis pursuit; \(\ell ^{1}\)-minimization
15B52: Random matrices (algebraic aspects)
94A20: Sampling theory in information and communication theory
42A05: Trigonometric polynomials, inequalities, extremal problems
Related Items
A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing, Iterative thresholding algorithms, Uncertainty in time-frequency representations on finite Abelian groups and applications, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit, On the properties of reachability, observability, controllability, and constructibility of discrete-time positive time-invariant linear systems with aperiodic choice of the sampling instants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extensions of compressed sensing
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Random Sampling of Multivariate Trigonometric Polynomials
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
