Support recovery for sparse super-resolution of positive measures

DOI10.1007/S00041-016-9502-XMaRDI QIDQ682872zbMATH OpenOpenAlexFDO

Authors Quentin Denoyelle, Vincent Duval, Gabriel Peyré

Publication date 5 February 2018

Published in The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.08264, https://basepub.dauphine.fr/handle/123456789/17014

zbMATH Keywords

Lassoconvex optimizationsparsitydeconvolutionrandom measuressuper-resolutionBlasso

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for inverse problems for integral equations (65R32)

Abstract: We study sparse spikes deconvolution over the space of Radon measures on $mathbbR$ or $mathbbT$ when the input measure is a finite sum of positive Dirac masses using the BLASSO convex program. We focus on the recovery properties of the support and the amplitudes of the initial measure in the presence of noise as a function of the minimum separation $t$ of the input measure (the minimum distance between two spikes). We show that when $w/lambda$, $w/t^{2N-1}$ and $lambda/t^{2N-1}$ are small enough (where $lambda$ is the regularization parameter, $w$ the noise and $N$ the number of spikes), which corresponds roughly to a sufficient signal-to-noise ratio and a noise level small enough with respect to the minimum separation, there exists a unique solution to the BLASSO program with exactly the same number of spikes as the original measure. We show that the amplitudes and positions of the spikes of the solution both converge toward those of the input measure when the noise and the regularization parameter drops to zero faster than $t^{2N-1}$.

Recommendations

• MultiDimensional Sparse Super-Resolution
• Exact support recovery for sparse spikes deconvolution
• Sparse non-negative super-resolution -- simplified and stabilised
• Towards a Mathematical Theory of Super‐resolution
• Super-resolution from noisy data

Cites work

• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Atomic Decomposition by Basis Pursuit
• Cadzow denoising upgraded: a new projection method for the recovery of Dirac pulses from noisy linear measurements
• Exact reconstruction using Beurling minimal extrapolation
• Exact support recovery for sparse spikes deconvolution
• Inverse problems in spaces of measures
• Linear Inversion of Band-Limited Reflection Seismograms
• MUSIC for single-snapshot spectral estimation: stability and super-resolution
• Spike detection from inaccurate samplings
• Super-resolution from noisy data
• Super-resolution of positive sources: the discrete setup
• Superresolution via Sparsity Constraints
• Towards a Mathematical Theory of Super‐resolution

Cited in

(36)

• Supermix: sparse regularization for mixtures
• Sparsest piecewise-linear regression of one-dimensional data
• Multikernel regression with sparsity constraint
• Stable super-resolution limit and smallest singular value of restricted Fourier matrices
• The MLE is a reliable source: sharp performance guarantees for localization problems
• Splines are universal solutions of linear inverse problems with generalized TV regularization
• Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
• The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
• A note on spike localization for line spectrum estimation
• Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision
• Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
• MultiDimensional Sparse Super-Resolution
• Linear inverse problems with nonnegativity constraints: singularity of optimisers
• Super-resolution of positive sources on an arbitrarily fine grid
• Localization of point scatterers via sparse optimization on measures
• Tomographic inverse problems: mathematical challenges and novel applications. Abstracts from the workshop held April 30 -- May 5, 2023
• When does OMP achieve exact recovery with continuous dictionaries?
• Point source super-resolution via non-convex \(L_1\) based methods
• A mathematical theory of super-resolution and two-point resolution
• A mathematical theory of computational resolution limit in multi-dimensional spaces
• Approximate super-resolution of positive measures in all dimensions
• Convex optimization in sums of Banach spaces
• TV-based reconstruction of periodic functions
• Exact recovery of the support of piecewise constant images via total variation regularization
• Improved resolution estimate for the two-dimensional super-resolution and a new algorithm for direction of arrival estimation with uniform rectangular array
• Approximation and interpolation of singular measures by trigonometric polynomials
• The geometry of off-the-grid compressed sensing
• Mathematical foundation of sparsity-based multi-snapshot spectral estimation
• Dynamic spike superresolution and applications to ultrafast ultrasound imaging
• Sparse non-negative super-resolution -- simplified and stabilised
• Dynamic super-resolution in particle tracking problems
• Variational regularization in inverse problems and machine learning
• Modern regularization methods for inverse problems
• Spike detection from inaccurate samplings
• A unifying representer theorem for inverse problems and machine learning
• Dimension reduction, exact recovery, and error estimates for sparse reconstruction in phase space

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: Support recovery for sparse super-resolution of positive measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682872)