Scinovex
articleTop 1% cited

Uncertainty principles and ideal atomic decomposition

IEEE Transactions on Information Theory · 2001 · Vol. 47(7) · pp. 2845–2862
David L. DonohoXiaoming Huo

Abstract

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 sinusoids exp{2/spl pi/iwt/N}//spl radic/N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every discrete-time signal can be represented as a superposition of spikes alone, or as a superposition of sinusoids alone, there is no unique way of writing S as a sum of spikes and sinusoids in general. We prove that if S is representable as a highly sparse superposition of atoms from this time-frequency dictionary, then there is only one such highly sparse representation of S, and it can be obtained by solving the convex optimization problem of minimizing the l/sup 1/ norm of the coefficients among all decompositions. Here "highly sparse" means that N/sub t/+N/sub w/</spl radic/N/2 where N/sub t/ is the number of time atoms, N/sub w/ is the number of frequency atoms, and N is the length of the discrete-time signal. Underlying this result is a general l/sup 1/ uncertainty principle which says that if two bases are mutually incoherent, no nonzero signal can have a sparse representation in both bases simultaneously. For the above setting, the bases are sinusoids and spikes, and mutual incoherence is measured in terms of the largest inner product between different basis elements. The uncertainty principle holds for a variety of interesting basis pairs, not just sinusoids and spikes. The results have idealized applications to band-limited approximation with gross errors, to error-correcting encryption, and to separation of uncoordinated sources. Related phenomena hold for functions of a real variable, with basis pairs such as sinusoids and wavelets, and for functions of two variables, with basis pairs such as wavelets and ridgelets. In these settings, if a function f is representable by a sufficiently sparse superposition of terms taken from both bases, then there is only one such sparse representation; it may be obtained by minimum l/sup 1/ norm atomic decomposition. The condition "sufficiently sparse" becomes a multiscale condition; for example, that the number of wavelets at level j plus the number of sinusoids in the jth dyadic frequency band are together less than a constant times 2/sup j/2/.

Mathematical Analysis and Transform MethodsImage and Signal Denoising MethodsSparse and Compressive Sensing TechniquesSuperposition principleSparse approximationBasis (linear algebra)Ideal (ethics)Norm (philosophy)CombinatoricsMathematicsSignal processingDiscrete mathematicsAlgorithm
Citations
1,975
FWCI
31.55
field-weighted impact
References
38
Percentile
100%
vs. same field & year
Citations per year
Cited by
A sparse signal reconstruction perspective for source localization with sensor arrays
IEEE Transactions on Signal Processing · 2005 · 2,559 citations
Compressed Sensing for Real-Time Energy-Efficient ECG Compression on Wireless Body Sensor Nodes
IEEE Transactions on Biomedical Engineering · 2011 · 701 citations
Minimax estimation via wavelet shrinkage
The Annals of Statistics · 1998 · 1,014 citations
An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
IEEE Transactions on Signal Processing · 2007 · 899 citations
The Adaptive Lasso and Its Oracle Properties
Journal of the American Statistical Association · 2006 · 7,497 citations
Greed is Good: Algorithmic Results for Sparse Approximation
IEEE Transactions on Information Theory · 2004 · 3,667 citations
Structured Compressed Sensing: From Theory to Applications
IEEE Transactions on Signal Processing · 2011 · 1,131 citations
References
Matching pursuits with time-frequency dictionaries
IEEE Transactions on Signal Processing · 1993 · 9,047 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.