Stable super-resolution of images: theoretical study
From MaRDI portal
(Redirected from Publication:5006485)
Abstract: We study the ubiquitous super-resolution problem, in which one aims at localizing positive point sources in an image, blurred by the point spread function of the imaging device. To recover the point sources, we propose to solve a convex feasibility program, which simply finds a nonnegative Borel measure that agrees with the observations collected by the imaging device. In the absence of imaging noise, we show that solving this convex program uniquely retrieves the point sources, provided that the imaging device collects enough observations. This result holds true if the point spread function of the imaging device can be decomposed into horizontal and vertical components, and if the translations of these components form a Chebyshev system, i.e., a system of continuous functions that loosely behave like algebraic polynomials. Building upon recent results for one-dimensional signals [1], we prove that this super-resolution algorithm is stable, in the generalized Wasserstein metric, to model mismatch (i.e., when the image is not sparse) and to additive imaging noise. In particular, the recovery error depends on the noise level and how well the image can be approximated with well-separated point sources. As an example, we verify these claims for the important case of a Gaussian point spread function. The proofs rely on the construction of novel interpolating polynomials---which are the main technical contribution of this paper---and partially resolve the question raised in [2] about the extension of the standard machinery to higher dimensions.
Recommendations
Cited in
(22)- A theory of super-resolution from short-time Fourier transform measurements
- Stable separation and super-resolution of mixture models
- Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients
- Super-resolution by means of Beurling minimal extrapolation
- Exact localization and superresolution with noisy data and random illumination
- scientific article; zbMATH DE number 5540288 (Why is no real title available?)
- Is the World Linear?
- On double-resolution imaging and discrete tomography
- Super-resolution of point sources via convex programming
- Super-resolution from noisy data
- A characterization of the non-degenerate source condition in super-resolution
- On the uniqueness of solutions for the basis pursuit in the continuum
- A sampling theorem for deconvolution in two dimensions
- The problem of super resolution with Gaussian low pass filter
- Superresolution without separation
- A Convex Approach to Superresolution and Regularization of Lines in Images
- SPARCOM: sparsity based super-resolution correlation microscopy
- Towards a Mathematical Theory of Super‐resolution
- IFF: A Superresolution Algorithm for Multiple Measurements
- Multivariate super-resolution without separation
- Blind super-resolution of point sources via fast iterative hard thresholding
- Sampling theory for super-resolution with implicit neural representations
This page was built for publication: Stable super-resolution of images: theoretical study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006485)
