Related papers: Sparse non-negative super-resolution -- simplified…
We study the problem of super-resolution, where we recover the locations and weights of non-negative point sources from a few samples of their convolution with a Gaussian kernel. It has been recently shown that exact recovery is possible by…
It is well-known that point sources with sufficient mutual distance can be reconstructed exactly from finitely many Fourier measurements by solving a convex optimization problem with Tikhonov-regularization (this property is sometimes…
We propose a new approach to non-parametric density estimation that is based on regularizing a Sobolev norm of the density. This method is statistically consistent, and makes the inductive bias of the model clear and interpretable. While…
The problem of super-resolution is concerned with the reconstruction of temporally/spatially localized events (or spikes) from samples of their convolution with a low-pass filter. Distinct from prior works which exploit sparsity in…
We show that if a closed discrete subset $A \subseteq \mathbf{R}^d$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then uniqueness fails and one can prescribe arbitrary values for…
We study fully-discrete approximations and quadratures of infinite-variate functions in abstract Bochner spaces associated with a Hilbert space $X$ and an infinite-tensor-product Jacobi measure. For target infinite-variate functions taking…
The problem of super-resolution in general terms is to recuperate a finitely supported measure $\mu$ given finitely many of its coefficients $\hat{\mu}(k)$ with respect to some orthonormal system. The interesting case concerns situations,…
We use compressed sensing to demonstrate theoretically the reconstruction of sub-wavelength features from measured far-field, and provide experimental proof-of-concept. The methods can be applied to non-optical microscopes, provided the…
In this work we present a new algorithm for data deconvolution that allows the retrieval of the target function with super-resolution with a simple approach that after a precis e measurement of the instrument response function (IRF), the…
Atomic norm minimization is a convex optimization framework to recover point sources from a subset of their low-pass observations, or equivalently the underlying frequencies of a spectrally-sparse signal. When the amplitudes of the sources…
This paper provides a theoretical analysis of diffraction-limited superresolution, demonstrating that arbitrarily close point sources can be resolved in ideal situations. Precisely, we assume that the incoming signal is a linear combination…
The paper addresses the problem of sampling discretization of integral norms of elements of finite-dimensional subspaces satisfying some conditions. We prove sampling discretization results under two standard kinds of assumptions --…
Superresolution refers to the estimation of parameters of an image with an accuracy beyond standard classical techniques such as direct detection. In seminal work by Lu et al., a measurement to estimate the separation distance of two point…
Singular source terms expressed as weighted summations of Dirac-delta functions are regularized through approximation theory with convolution operators. We consider the numerical solution of scalar and one-dimensional hyperbolic…
The problem of imaging extended targets (sources or scatterers) is formulated in the framework of compressed sensing with emphasis on subwavelength resolution. The proposed formulation of the problems of inverse source/scattering is…
We consider the modulus of noncompact convexity $\Delta_{X,\phi}(\varepsilon)$ associated with the minimalizable measure of noncompactness $\phi$. We present some properties of this modulus, while the main result of this paper is showing…
It is a typical standard assumption in the density deconvolution problem that the characteristic function of the measurement error distribution is non-zero on the real line. While this condition is assumed in the majority of existing works…
Sparse arrays have emerged as a popular alternative to the conventional uniform linear array (ULA) due to the enhanced degrees of freedom (DOF) and superior resolution offered by them. In the passive setting, these advantages are realized…
Solutions of Rough Differential Equations (RDE) may be defined as paths whose increments are close to an approximation of the associated flow. They are constructed through a discrete scheme using a non-linear sewing lemma. In this article,…
We study the problem of super-resolving a superposition of point sources from noisy low-pass data with a cut-off frequency f. Solving a tractable convex program is shown to locate the elements of the support with high precision as long as…