The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Towards a Mathematical Theory of Super‐resolution
Open accessAbstract
This paper develops a mathematical theory of super‐resolution. Broadly speaking, super‐resolution is the problem of recovering the fine details of an object—the high end of its spectrum—from coarse scale information only—from samples at the low end of the spectrum. Suppose we have many point sources at unknown locations in [0,1] and with unknown complex‐valued amplitudes. We only observe Fourier samples of this object up to a frequency cutoff fc. We show that one can super‐resolve these point sources with infinite precision—i.e., recover the exact locations and amplitudes—by solving a simple convex optimization problem, which can essentially be reformulated as a semidefinite program. This holds provided that the distance between sources is at least 2/fc. This result extends to higher dimensions and other models. In one dimension, for instance, it is possible to recover a piecewise smooth function by resolving the discontinuity points with infinite precision as well. We also show that the theory and methods are robust to noise. In particular, in the discrete setting we develop some theoretical results explaining how the accuracy of the super‐resolved signal is expected to degrade when both the noise level and the super‐resolution factor vary. © 2014 Wiley Periodicals, Inc.
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
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Super-resolution image reconstruction: a technical overview
Park, S. C., Park, M. K., & Kang, M. G. (2003) · IEEE Signal Processing Magazine · doi:10.1109/msp.2003.1203207 · Cited by 3,282
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
Slepian, D. (1978) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1978.tb02104.x · Cited by 1,741
The Schur Complement and Its Applications
(2005) · Numerical Methods and Algorithms · doi:10.1007/b105056 · Cited by 1,615
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Numerical recipes in C (2nd ed.): the art of scientific computing
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1992) · Cambridge University Press eBooks · Cited by 1,156
Uncertainty Principles and Signal Recovery
Donoho, D. L., & Stark, P. B. (1989) · SIAM Journal on Applied Mathematics · doi:10.1137/0149053 · Cited by 1,054
Robust Modeling With Erratic Data
Claerbout, J. F., & Muir, F. (1973) · Geophysics · doi:10.1190/1.1440378 · Cited by 833
Linear Inversion of Band-Limited Reflection Seismograms
Santosa, F., & Symes, W. W. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907087 · Cited by 713
Sparse nonnegative solution of underdetermined linear equations by linear programming
Donoho, D. L., & Tanner, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0502269102 · Cited by 577
Super-Resolution in Medical Imaging
Greenspan, H. (2008) · The Computer Journal · doi:10.1093/comjnl/bxm075 · Cited by 564
Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
Dragotti, P. L., Vetterli, M., & Blu, T. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.890907 · Cited by 428
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Superresolution via Sparsity Constraints
Donoho, D. L. (1992) · SIAM Journal on Mathematical Analysis · doi:10.1137/0523074 · Cited by 298
Levy, S., & Fullagar, P. K. (1981) · Geophysics · doi:10.1190/1.1441261 · Cited by 258
Positive Trigonometric Polynomials and Signal Processing Applications
Dumitrescu, B. (2017) · Signals and Communication Technology · doi:10.1007/978-3-319-53688-0 · Cited by 206
Super-resolution in PET imaging
Kennedy, J. A., Israel, O., Frenkel, A., Bar-Shalom, R., & Azhari, H. (2006) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2005.861705 · Cited by 188
Inverse problems in spaces of measures
Bredies, K., & Pikkarainen, H. K. (2013) · ESAIM: Control, Optimisation and Calculus of Variations · doi:10.1051/cocv/2011205 · Cited by 182
On super-resolution in astronomical imaging
Puschmann, K. G., & Kneer, F. (2005) · Astronomy and Astrophysics · doi:10.1051/0004-6361:20042320 · Cited by 96
A numerical exploration of compressed sampling recovery
Dossal, C., Gabriel Peyré, A., & Fadili, J. M. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.11.022 · Cited by 44
Cited by
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
Atomic Norm Denoising With Applications to Line Spectral Estimation
Bhaskar, B. N., Tang, G., & Recht, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2273443 · Cited by 579
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Super-Resolution from Noisy Data
Candès, E. J., & Fernandez-Granda, C. (2013) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-013-9292-3 · Cited by 392
Self-citationDirect Localization for Massive MIMO
Garcia, N., Wymeersch, H., Larsson, E. G., Haimovich, A. M., & Coulon, M. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2666779 · Cited by 379
Metadata
- Authors
- Candès, E. J., & Fernandez‐Granda, C.
- Venue
- Communications on Pure and Applied Mathematics
- Publisher
- Wiley
- Published
- 2013-04-29
- Volume
- 67
- Issue
- 6
- Pages
- 906-956
- ISSN
- 0010-3640 (ISSN-L)
- 1097-0312
- OpenAlex
- W2078524554
- Cited by
- 1,169
- References
- 25
- FWCI
- 101.19
- 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
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.