Discrete uncertainty principles and sparse signal processing
From MaRDI portal
Abstract: We develop new discrete uncertainty principles in terms of numerical sparsity, which is a continuous proxy for the 0-norm. Unlike traditional sparsity, the continuity of numerical sparsity naturally accommodates functions which are nearly sparse. After studying these principles and the functions that achieve exact or near equality in them, we identify certain consequences in a number of sparse signal processing applications.
Recommendations
- Uncertainty Principles and Signal Recovery
- A survey of uncertainty principles and some signal processing applications
- Quantitative robust uncertainty principles and optimally sparse decompositions
- On uncertainty principles in the finite dimensional setting
- Uncertainty principles and ideal atomic decomposition
Cites work
- scientific article; zbMATH DE number 3167451 (Why is no real title available?)
- scientific article; zbMATH DE number 1318047 (Why is no real title available?)
- scientific article; zbMATH DE number 515629 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- A remark on compressed sensing
- A simple proof of the restricted isometry property for random matrices
- Adaptive estimation of a quadratic functional by model selection.
- An Improved Estimate in the Restricted Isometry Problem
- An uncertainty principle for cyclic groups of prime order
- Chebotarëv and his density theorem
- Comparing Measures of Sparsity
- Compressed sensing: how sharp is the restricted isometry property?
- Compressive sensing and structured random matrices
- Derandomizing restricted isometries via the Legendre symbol
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Inequalities in Fourier analysis
- Linear Inversion of Band-Limited Reflection Seismograms
- Majorizing measures and proportional subsets of bounded orthonormal systems
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New constructions of RIP matrices with fast multiplication and fewer rows
- On sparse reconstruction from Fourier and Gaussian measurements
- On support properties of Lsup(p)-functions and their Fourier transforms
- On the conditioning of random subdictionaries
- On the linear independence of spikes and sines
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Problems and results in extremal combinatorics. I.
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Scaling law for recovering the sparsest element in a subspace
- Selecting a proportion of characters
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sharp recovery bounds for convex demixing, with applications
- Suprema of chaos processes and the restricted isometry property
- The restricted isometry property and its implications for compressed sensing
- The road to deterministic matrices with the restricted isometry property
- Uncertainty Principles and Signal Recovery
- Uncertainty principles and ideal atomic decomposition
Cited in
(9)- Uncertainty principles with discrete quaternion Fourier transforms
- Uncertainty Principles and Signal Recovery
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Uncertainty principles for random signals
- Discrete uncertainty principle in quaternion setting and application in signal reconstruction
- Uncertainty principle for free metaplectic transformation
- An introduction to compressed sensing
- A survey of uncertainty principles and some signal processing applications
This page was built for publication: Discrete uncertainty principles and sparse signal processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q667658)
