Blind calibration of sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Sparse representations are most likely to be the sparsest possible
EURASIP Journal on Applied Signal Processing
Sampling theorems for signals from the union of finite-dimensional linear subspaces
IEEE Transactions on Information Theory
Uncertainty relations for shift-invariant analog signals
IEEE Transactions on Information Theory
Sparse approximate solution of partial differential equations
Applied Numerical Mathematics
Sparse signal recovery with exponential-family noise
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
High resoluton image reconstruction: a new imager VIA movable random exposure
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Dequantizing compressed sensing with non-Gaussian constraints
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Average case analysis of multichannel sparse recovery using convex relaxation
IEEE Transactions on Information Theory
Uncertainty principles and vector quantization
IEEE Transactions on Information Theory
Cooperative OTH communications for airborne networks: opportunities and challenges
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Fast and accurate reconstruction of HARDI data using compressed sensing
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part I
Exact optimization for the l1-Compressive Sensing problem using a modified Dantzig-Wolfe method
Theoretical Computer Science
A non-adapted sparse approximation of PDEs with stochastic inputs
Journal of Computational Physics
SIAM Journal on Scientific Computing
A First-Order Smoothed Penalty Method for Compressed Sensing
SIAM Journal on Optimization
Sparse methods for biomedical data
ACM SIGKDD Explorations Newsletter
Saliency-guided compressive sensing approach to efficient laser range measurement
Journal of Visual Communication and Image Representation
Computational Optimization and Applications
A Simple Compressive Sensing Algorithm for Parallel Many-Core Architectures
Journal of Signal Processing Systems
Hi-index | 0.25 |
In this paper we develop a robust uncertainty principle for finite signals in ${\Bbb C}^N$ which states that, for nearly all choices $T, \Omega\subset\{0,\ldots,N-1\}$ such that $|T| + |\Omega| \asymp (\log N)^{-1/2} \cdot N,$ there is no signal $f$ supported on $T$ whose discrete Fourier transform $\hat{f}$ is supported on $\Omega.$ In fact, we can make the above uncertainty principle quantitative in the sense that if $f$ is supported on $T,$ then only a small percentage of the energy (less than half, say) of $\hat{f}$ is concentrated on $\Omega.$ As an application of this robust uncertainty principle (QRUP), we consider the problem of decomposing a signal into a sparse superposition of spikes and complex sinusoids $f(s) = \sum_{t\in T}\alpha_1(t)\delta(s-t) + \sum_{\omega\in\Omega}\alpha_2(\omega)e^{i2\pi \omega s/N}/\sqrt{N}.$ We show that if a generic signal $f$ has a decomposition $(\alpha_1,\alpha_2)$ using spike and frequency locations in $T$ and $\Omega,$ respectively, and obeying $|T| + |\Omega| \leq {\rm Const}\cdot (\log N)^{-1/2}\cdot N,$ then $(\alpha_1, \alpha_2)$ is the unique sparsest possible decomposition (all other decompositions have more nonzero terms). In addition, if $|T| + |\Omega| \leq {\rm Const}\cdot (\log N)^{-1}\cdot N,$ then the sparsest $(\alpha_1,\alpha_2)$ can be found by solving a convex optimization problem. Underlying our results is a new probabilistic approach which insists on finding the correct uncertainty relation, or the optimally sparse solution for nearly all subsets but not necessarily all of them, and allows us to considerably sharpen previously known results [9], [10]. In fact, we show that the fraction of sets $(T, \Omega)$ for which the above properties do not hold can be upper bounded by quantities like $N^{-\alpha}$ for large values of $\alpha.$ The QRUP (and the application to finding sparse representations) can be extended to general pairs of orthogonal bases $\Phi_1,\Phi_2 \mbox{of} {\Bbb C}^N.$ For nearly all choices ${\Gamma_1},{\Gamma_2}\subset\{0,\ldots,N-1\}$ obeying $|{\Gamma_1}| + |{\Gamma_2}| \asymp \mu(\Phi_1,\Phi_2)^{-2} \cdot (\log N)^{-m},$ where $m\leq 6,$ there is no signal $f$ such that $\Phi_1 f$ is supported on ${\Gamma_1}$ and $\Phi_2 f$ is supported on ${\Gamma_2}$ where $\mu(\Phi_1,\Phi_2)$ is the mutual coherence between $\Phi_1$ and $\Phi_2.$