The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Exact Support Recovery for Sparse Spikes Deconvolution
Open accessAbstract
This paper studies sparse spikes deconvolution over the space of measures. We focus on the recovery properties of the support of the measure (i.e., the location of the Dirac masses) using total variation of measures (TV) regularization. This regularization is the natural extension of the ℓ1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell ^1$$\end{document} norm of vectors to the setting of measures. We show that support identification is governed by a specific solution of the dual problem (a so-called dual certificate) having minimum L2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^2$$\end{document} norm. Our main result shows that if this certificate is non-degenerate (see the definition below), when the signal-to-noise ratio is large enough TV regularization recovers the exact same number of Diracs. We show that both the locations and the amplitudes of these Diracs converge toward those of the input measure when the noise drops to zero. Moreover, the non-degeneracy of this certificate can be checked by computing a so-called vanishing derivative pre-certificate. This proxy can be computed in closed form by solving a linear system. Lastly, we draw connections between the support of the recovered measure on a continuous domain and on a discretized grid. We show that when the signal-to-noise level is large enough, and provided the aforementioned dual certificate is non-degenerate, the solution of the discretized problem is supported on pairs of Diracs which are neighbors of the Diracs of the input measure. This gives a precise description of the convergence of the solution of the discretized problem toward the solution of the continuous grid-free problem, as the grid size tends to zero.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Convex Analysis and Variational Problems
(1976) · Studies in Mathematics and Its Applications · doi:10.1016/c2009-0-19672-1 · Cited by 3,806
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
Analyse fonctionnelle : Théorie et applications
Brézis, H. (1999) · Cited by 1,180
Towards a Mathematical Theory of Super‐resolution
Candès, E. J., & Fernandez‐Granda, C. (2014) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21455 · Cited by 1,169
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
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
On Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Sparse Sampling of Signal Innovations
Blu, T., Dragotti, P.-L., Vetterli, M., Marziliano, P., & Coulot, L. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914998 · Cited by 427
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
Convergence rates of convex variational regularization
Burger, M., & Osher, S. (2004) · Inverse Problems · doi:10.1088/0266-5611/20/5/005 · Cited by 326
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
Mathematical concepts of optical superresolution
Lindberg, J. (2012) · Journal of Optics · doi:10.1088/2040-8978/14/8/083001 · Cited by 201
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
Robust Sparse Analysis Regularization
Vaiter, S., Gabriel Peyré, A., Dossal, C., & Fadili, J. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2233859 · Cited by 112
Necessary and sufficient conditions for linear convergence of ℓ1-regularization
Grasmaier, M., Haltmeier, M., & Scherzer, O. (2011) · Max Planck Institute for Plasma Physics · doi:10.1002/cpa.20350/pdf · Cited by 61
Cited by
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Metadata
- Authors
- Duval, V., & Peyré, G.
- Venue
- Foundations of Computational Mathematics
- Published
- 2014-10-09
- Volume
- 15
- Issue
- 5
- Pages
- 1315-1355
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2017718716
- Cited by
- 300
- References
- 20
- FWCI
- 21.81
- 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.