Sparsity in time-frequency representations
From MaRDI portal
Publication:967573
Abstract: We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an -sparse Gabor representation in with respect to a random unimodular window can be recovered by Basis Pursuit with high probability provided that . Our results are applicable to the channel estimation problem in wireless communications and they establish the usefulness of a class of measurement matrices for compressive sensing.
Recommendations
- Sparse time frequency representations and dynamical systems
- Sparse time-frequency representation of nonlinear and nonstationary data
- Sparse Bayesian representation in time-frequency domain
- Reduced Interference Sparse Time-Frequency Distributions for Compressed Observations
- On the uniqueness of sparse time-frequency representation of multiscale data
- Sparse time-frequency decomposition for multiple signals with same frequencies
- Sparse time-frequency decomposition based on dictionary adaptation
- Sparse Sinusoidal Signal Representation for Speech and Music Signals
- Adaptive data analysis via sparse time-frequency representation
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 1111497 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A discrete model for the efficient analysis of time-varying narrowband communication channels
- A simple proof of the restricted isometry property for random matrices
- Adaptive greedy approximations
- An introduction to frames and Riesz bases
- Atomic Decomposition by Basis Pursuit
- Complex sequences with low periodic correlations (Corresp.)
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Foundations of time-frequency analysis
- Gabor analysis over finite Abelian groups
- Grassmannian frames with applications to coding and communication
- Greed is Good: Algorithmic Results for Sparse Approximation
- High-Resolution Radar via Compressed Sensing
- Identification of Matrices Having a Sparse Representation
- Linear independence of Gabor systems in finite dimensional vector spaces
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On Sparse Representations in Arbitrary Redundant Bases
- On sparse reconstruction from Fourier and Gaussian measurements
- On the conditioning of random subdictionaries
- Random sampling of sparse trigonometric polynomials
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- Uncertainty in time-frequency representations on finite Abelian groups and applications
Cited in
(25)- Sampling of operators
- Compressive Sensing
- Sparse reconstruction of Hardy signal and applications to time-frequency distribution
- Suprema of chaos processes and the restricted isometry property
- Beyond coherence: Recovering structured time-frequency representations
- Cornerstones of sampling of operator theory
- Sparse time-frequency representation based on multiwindow discrete Gabor transform
- The Faber-Krahn inequality for the short-time Fourier transform
- Remote sensing via \(\ell_1\)-minimization
- The restricted isometry property for time-frequency structured random matrices
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- On uncertainty principles in the finite dimensional setting
- Improved bounds for sparse recovery from subsampled random convolutions
- Sparse Bayesian representation in time-frequency domain
- Time-Frequency Energy Distributions Meet Compressed Sensing
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- scientific article; zbMATH DE number 5944404 (Why is no real title available?)
- Super-resolution for doubly-dispersive channel estimation
- Sparse channel separation using random probes
- Sparse signal recovery using a new class of random matrices
- Theoretical frame properties of wave-packet matrices over prime fields
- Constructing tight Gabor frames using CAZAC sequences
- Geometric compressed sensing and structured sparsity
- Time filters and spurious acoustics in artificial compression methods
- Donoho-Logan large sieve principles for modulation and polyanalytic Fock spaces
This page was built for publication: Sparsity in time-frequency representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967573)
