On the Stable Resolution Limit of Total Variation Regularization for Spike Deconvolution

10/03/2019
by   Maxime Ferreira Da Costa, et al.
0

The stability of spike deconvolution, which aims at recovering point sources from their convolution with a point spread function (PSF), is known to be related to the separation between those sources. When the observations are noisy, it is critical to ensure support stability, where the deconvolution does not lead to spurious, or oppositely, missing estimates of the point sources. In this paper, we study the resolution limit of stably recovering the support of two closely located point sources using the Beurling-LASSO estimator, which is a convex optimization approach based on total variation regularization. We establish a sufficient separation criteria between the sources, depending only on the PSF, above which the Beurling-LASSO estimator is guaranteed to return a stable estimate of the point sources, with the same number of estimated elements as of the ground truth. Our result highlights the impact of PSF on the resolution limit in the noisy setting, which was not evident in previous studies of the noiseless setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2022

Local Geometry of Nonconvex Spike Deconvolution from Low-Pass Measurements

Spike deconvolution is the problem of recovering the point sources from ...
research
05/08/2018

Superresolution method for data deconvolution by superposition of point sources

In this work we present a new algorithm for data deconvolution that allo...
research
10/18/2022

Multivariate Super-Resolution without Separation

In this paper we study the high-dimensional super-resolution imaging pro...
research
03/16/2015

Phase and TV Based Convex Sets for Blind Deconvolution of Microscopic Images

In this article, two closed and convex sets for blind deconvolution prob...
research
04/16/2020

Algorithmic Foundations for the Diffraction Limit

For more than a century and a half it has been widely-believed (but was ...
research
01/15/2018

A Tight Converse to the Spectral Resolution Limit via Convex Programming

It is now well understood that convex programming can be used to estimat...
research
02/16/2022

Formulating Beurling LASSO for Source Separation via Proximal Gradient Iteration

Beurling LASSO generalizes the LASSO problem to finite Radon measures re...

Please sign up or login with your details

Forgot password? Click here to reset