Abstract
International audience
Keywords
Orthonormal basisSparse approximationLinear programmingAlgebra over a fieldCombinatoricsComputer scienceMathematicsAlgorithmPure mathematics
Affiliated Institutions
Related Publications
Compressed sensing
Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible ...
Uncertainty principles and ideal atomic decomposition
Suppose a discrete-time signal S(t), 0/spl les/t<N, is a superposition of atoms taken from a combined time-frequency dictionary made of spike sequences 1/sub {t=/spl tau/}/ and ...
Compressed sensing
Suppose x is an unknown vector in Ropf <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> (a digital image or signal); we pla...
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
This paper proves best known guarantees for exact reconstruction of a sparse signal f from few non-adaptive universal linear measurements. We consider Fourier measurements (rand...
Improved time bounds for near-optimal sparse Fourier representations
•We study the problem of finding a Fourier representation <b>R </b>of <i>m</i> terms for a given discrete signal <b>A</b> of length<i> N</i>. The Fast Fourier Transform (FFT) ca...
Publication Info
- Year
- 2003
- Type
- article
- Volume
- 49
- Issue
- 12
- Pages
- 3320-3325
- Citations
- 963
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
963
OpenAlex
Cite This
Rémi Gribonval,
Morten Nielsen
(2003).
Sparse representations in unions of bases.
IEEE Transactions on Information Theory
, 49
(12)
, 3320-3325.
https://doi.org/10.1109/tit.2003.820031
Identifiers
- DOI
- 10.1109/tit.2003.820031