Related papers: Super-resolution limit of the ESPRIT algorithm
We study one-shot detection under isotropic multivariate Cauchy noise using finite constellations, with emphasis on the geometric mechanisms governing symbol-level reliability. Under isotropic Cauchy noise, the maximum-likelihood rule…
Fluorescence microscopy is essential in biological and medical research, providing critical insights into cellular structures. However, limited by optical diffraction and background noise, a substantial amount of hidden information is still…
We study the problem of super-resolution of a linear combination of Dirac distributions and their derivatives on a one-dimensional circle from noisy Fourier measurements. Following numerous recent works on the subject, we consider the…
Image deblurring is a notoriously challenging ill-posed inverse problem. In recent years, a wide variety of approaches have been proposed based upon regularization at the level of the image or on techniques from machine learning. We propose…
The Procrustes matching (PM) problem is the problem of finding the optimal rigid motion and labeling of two point sets so that they are as close as possible. Both rigid and non-rigid shape matching problems can be formulated as PM problems.…
Estimating the angular separation between two incoherent thermal sources is a challenging task for direct imaging, especially when it is smaller than or comparable to the Rayleigh length. In addition, the task of discriminating whether…
This paper investigates the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for solving monotone variational inequality problems. The exact worst case convergence rate is computed using the performance…
Exceptional points (EPs) have been suggested for ultra-sensitive sensing because the eigenfrequency splitting grows as the nth-root of a perturbation, suggesting divergent responsivity. In ideal linear devices, however, this responsivity…
Superresolution theory and techniques seek to recover signals from samples in the presence of blur and noise. Discrete image registration can be an approach to fuse information from different sets of samples of the same signal. Quantization…
We realize a scanning probe microscope using single trapped $^{87}$Rb atoms to measure optical fields with subwavelength spatial resolution. Our microscope operates by detecting fluorescence from a single atom driven by near-resonant light…
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 study finite element approximations of second-order elliptic problems with measure-valued right-hand sides supported on lower-dimensional sets. The exact solution generally lacks $H^1$-regularity due to the source singularity, which…
This paper proposes an estimation framework to assess the performance of sorting over perturbed/noisy data. In particular, the recovering accuracy is measured in terms of Minimum Mean Square Error (MMSE) between the values of the sorting…
Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under…
Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…
The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. However, compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent,…
In this paper, we aim to reconstruct an n-dimensional real vector from m phaseless measurements corrupted by an additive noise. We extend the noiseless framework developed in [15], based on mirror descent (or Bregman gradient descent), to…
Previous methods decompose the blind super-resolution (SR) problem into two sequential steps: \textit{i}) estimating the blur kernel from given low-resolution (LR) image and \textit{ii}) restoring the SR image based on the estimated kernel.…
This paper proves that the Epistemic Support-Point Filter (ESPF) is the unique optimal recursive estimator within the class of epistemically admissible evidence-only filters. Where Bayesian filters minimize mean squared error and are driven…
We consider the sparse moment problem of learning a $k$-spike mixture in high-dimensional space from its noisy moment information in any dimension. We measure the accuracy of the learned mixtures using transportation distance. Previous…