The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
Open accessAbstract
AbstractIn 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.$
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty - I
Slepian, D., & Pollak, H. O. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03976.x · Cited by 2,492
Landau, H. J., & Pollak, H. O. (1962) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1962.tb03279.x · Cited by 839
Cited by
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Self-citationDecoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Self-citationNear-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Self-citationHalko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Metadata
- Authors
- Candes, E. J., & Romberg, J.
- Venue
- Foundations of Computational Mathematics
- Published
- 2005-12-09
- Volume
- 6
- Issue
- 2
- Pages
- 227-254
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2160396672
- Cited by
- 504
- References
- 3
- FWCI
- 25.42
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions. https://app.cochat.ai/papers/10.1007/s10208-004-0162-x
- The paper
- Candes, E. J., & Romberg, J. (2006). Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-004-0162-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.