Sparsity in time-frequency representations
From MaRDI portal
Publication:967573
DOI10.1007/s00041-009-9086-9zbMath1185.42039arXiv0711.2503OpenAlexW2136152309MaRDI QIDQ967573
Götz E. Pfander, Holger Rauhut
Publication date: 30 April 2010
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.2503
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Convex programming (90C25) Random matrices (algebraic aspects) (15B52)
Related Items
Improved bounds for sparse recovery from subsampled random convolutions, Suprema of Chaos Processes and the Restricted Isometry Property, The restricted isometry property for time-frequency structured random matrices, The Faber-Krahn inequality for the short-time Fourier transform, A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing, Remote sensing via \(\ell_1\)-minimization, Cornerstones of Sampling of Operator Theory, Theoretical frame properties of wave-packet matrices over prime fields, Compressive Sensing, Sampling of operators, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, Sparse signal recovery using a new class of random matrices, On uncertainty principles in the finite dimensional setting, Constructing Tight Gabor Frames Using CAZAC Sequences, Donoho-Logan large sieve principles for modulation and polyanalytic Fock spaces, Super-resolution for doubly-dispersive channel estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random sampling of sparse trigonometric polynomials
- On the conditioning of random subdictionaries
- Uncertainty in time-frequency representations on finite Abelian groups and applications
- Gabor analysis over finite Abelian groups
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- A simple proof of the restricted isometry property for random matrices
- Grassmannian frames with applications to coding and communication
- Foundations of time-frequency analysis
- A discrete model for the efficient analysis of time-varying narrowband communication channels
- Linear independence of Gabor systems in finite dimensional vector spaces
- On sparse reconstruction from Fourier and Gaussian measurements
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Compressed Sensing and Redundant Dictionaries
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Complex sequences with low periodic correlations (Corresp.)
- Atomic Decomposition by Basis Pursuit
- Identification of Matrices Having a Sparse Representation
- High-Resolution Radar via Compressed Sensing
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- An introduction to frames and Riesz bases
- Adaptive greedy approximations
