Towards a Mathematical Theory of Super-Resolution

This paper develops a mathematical theory of super-resolution. Broadly speaking, superresolution is the problem of recovering the ne 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 until a frequency cut-o fc. We show that one can super-resolve these point sources with innite precision|i.e. recover the exact locations and amplitudes|by solving a simple convex optimization problem, which can essentially be reformulated as a semidenite 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 innite 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.

[1]  D. Donoho Superresolution via sparsity constraints , 1992 .

[2]  Fuzhen Zhang The Schur complement and its applications , 2005 .

[3]  Gongguo Tang,et al.  Atomic Norm Denoising With Applications to Line Spectral Estimation , 2012, IEEE Transactions on Signal Processing.

[4]  Moon Gi Kang,et al.  Super-resolution image reconstruction: a technical overview , 2003, IEEE Signal Process. Mag..

[5]  Thierry Blu,et al.  Extrapolation and Interpolation) , 2022 .

[6]  C W McCutchen,et al.  Superresolution in microscopy and the Abbe resolution limit. , 1967, Journal of the Optical Society of America.

[7]  T. Moser,et al.  Diffraction imaging by focusing‐defocusing: An outlook on seismic superresolution , 2004 .

[8]  G. Peyré,et al.  A numerical exploration of compressed sampling recovery , 2010 .

[9]  B. Dumitrescu Positive Trigonometric Polynomials and Signal Processing Applications , 2007 .

[10]  D. Slepian Prolate spheroidal wave functions, fourier analysis, and uncertainty — V: the discrete case , 1978, The Bell System Technical Journal.

[11]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Vivek K. Goyal,et al.  Estimating Signals With Finite Rate of Innovation From Noisy Samples: A Stochastic Algorithm , 2007, IEEE Transactions on Signal Processing.

[13]  Nana S. Banerjee,et al.  Exponentially Accurate Approximations to Periodic Lipschitz Functions Based on Fourier Series Partial Sums , 1998, J. Sci. Comput..

[14]  Hayit Greenspan,et al.  Super-Resolution in Medical Imaging , 2009, Comput. J..

[15]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[16]  Wenjing Liao,et al.  Coherence Pattern-Guided Compressive Sensing with Unresolved Grids , 2011, SIAM J. Imaging Sci..

[17]  Knut S. Eckhoff Accurate reconstructions of functions of finite regularity from truncated Fourier series expansions , 1995 .

[18]  J. Claerbout,et al.  Robust Modeling With Erratic Data , 1973 .

[19]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

[20]  K. Puschmann,et al.  On super-resolution in astronomical imaging , 2005 .

[21]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[22]  William H. Press,et al.  Numerical recipes in C , 2002 .

[23]  R. Rockafellar Conjugate Duality and Optimization , 1987 .

[24]  S. Levy,et al.  Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolution , 1981 .

[25]  W. Rudin Real and complex analysis , 1968 .

[26]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[27]  William H. Press,et al.  Numerical recipes in C (2nd ed.): the art of scientific computing , 1992 .

[28]  Dmitry Batenkov,et al.  Algebraic Fourier reconstruction of piecewise smooth functions , 2010, Math. Comput..

[29]  Charles Dossal Estimation de fonctions géométriques et déconvolution , 2005 .

[30]  Haim Azhari,et al.  Super-resolution in PET imaging , 2006, IEEE Transactions on Medical Imaging.

[31]  Joel A. Tropp,et al.  Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

[32]  Etienne Barnard,et al.  Two-dimensional superresolution radar imaging using the MUSIC algorithm , 1994 .

[33]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[34]  Eric Betzig,et al.  Super-Resolution Imaging Spectroscopy , 1994 .

[35]  K. Bredies,et al.  Inverse problems in spaces of measures , 2013 .

[36]  Yohann de Castro,et al.  Exact Reconstruction using Beurling Minimal Extrapolation , 2011, 1103.4951.

[37]  Marco F. Duarte,et al.  Spectral compressive sensing , 2013 .