Multivariate super-resolution without separation

DOI10.1093/IMAIAI/IAAD024zbMATH Open1518.94011arXiv2210.09979OpenAlexW4382811464MaRDI QIDQ6164744FDOQ6164744

Authors: Bakytzhan Kurmanbek, Elina Robeva 

Publication date: 28 July 2023

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Abstract: In this paper we study the high-dimensional super-resolution imaging problem. Here we are given an image of a number of point sources of light whose locations and intensities are unknown. The image is pixelized and is blurred by a known point-spread function arising from the imaging device. We encode the unknown point sources and their intensities via a nonnegative measure and we propose a convex optimization program to find it. Assuming the device's point-spread function is component-wise decomposable, we show that the optimal solution is the true measure in the noiseless case, and it approximates the true measure well in the noisy case with respect to the generalized Wasserstein distance. Our main assumption is that the components of the point-spread function form a Tchebychev system ($T$-system) in the noiseless case and a $T^{*}$-system in the noisy case, mild conditions that are satisfied by Gaussian point-spread functions. Our work is a generalization to all dimensions of the work (Eftekhari, Bendory, & Tang, 2021) where the same analysis is carried out in 2 dimensions. We resolve an open problem posed in (Schiebinger, Robeva, & Recht, 2018) in the case when the point-spread function decomposes.

Full work available at URL: https://arxiv.org/abs/2210.09979

Recommendations

• Stable super-resolution of images: theoretical study
• Towards a Mathematical Theory of Super‐resolution
• Super-resolution of positive sources: the discrete setup
• Super-resolution from noisy data
• MultiDimensional Sparse Super-Resolution

zbMATH Keywords

exact solutionssuper-resolutionTchebychev systemsbounds for a recovery errorgeneralized-Wasserstein distance

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Cited In (11)

• Stable separation and super-resolution of mixture models
• An Operator Theory for Analyzing the Resolution of Multi-illumination Imaging Modalities
• Super-resolution meets machine learning: approximation of measures
• Multi-kernel unmixing and super-resolution using the modified matrix pencil method
• Super-Resolution Without Explicit Subpixel Motion Estimation
• On super-resolution imaging as a multiparameter estimation problem
• MultiDimensional Sparse Super-Resolution
• Stable super-resolution of images: theoretical study
• A mathematical theory of computational resolution limit in multi-dimensional spaces
• Nonconvex optimization for 3-dimensional point source localization using a rotating point spread function
• Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging

This page was built for publication: Multivariate super-resolution without separation

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