English
Related papers

Related papers: Super-resolution limit of the ESPRIT algorithm

200 papers

In this work, super-resolution by 4 compressive sensing methods (OMP, BP, BLOOMP, BP-BLOT) with highly coherent partial Fourier measurements is comparatively studied. An alternative metric more suitable for gauging the quality of spike…

Information Theory · Computer Science 2012-11-27 A. Fannjiang , W. Liao

Spatial smoothing is a widely used preprocessing scheme to improve the performance of high-resolution parameter estimation algorithms in case of coherent signals or if only a small number of snapshots is available. In this paper, we present…

Information Theory · Computer Science 2017-04-05 Jens Steinwandt , Florian Roemer , Martin Haardt , Giovanni Del Galdo

We show that the method of distributed noise-shaping beta-quantization offers superior performance for the problem of spectral super-resolution with quantization whenever there is redundancy in the number of measurements. More precisely, we…

Information Theory · Computer Science 2022-03-02 C. Sinan Güntürk , Weilin Li

This paper studies the recovery of a superposition of point sources from noisy bandlimited data. In the fewest possible words, we only have information about the spectrum of an object in a low-frequency band bounded by a certain cut-off…

Information Theory · Computer Science 2013-07-11 Emmanuel Candes , Carlos Fernandez-Granda

Resolving a linear combination of point sources from their band-limited Fourier data is a fundamental problem in imaging and signal processing. With the incomplete Fourier data and the inevitable noise in the measurement, there is a…

Image and Video Processing · Electrical Eng. & Systems 2021-10-27 Ping Liu , Hai Zhang

We consider imaging of two partially coherent sources and derive the ultimate quantum limits for estimating the separation, location, relative intensity, and coherence factor. We show that super-resolution in the separation is achievable…

Quantum Physics · Physics 2026-05-20 Joaquín López-Suárez , Michalis Skotiniotis

The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…

Machine Learning · Statistics 2016-06-24 Lalit Jain , Kevin Jamieson , Robert Nowak

Spike deconvolution is the problem of recovering point sources from their convolution with a known point spread function, playing a fundamental role in many sensing and imaging applications. This paper proposes a novel approach combining…

Signal Processing · Electrical Eng. & Systems 2025-02-13 Joseph Gabet , Meghna Kalra , Maxime Ferreira Da Costa , Kiryung Lee

Given a reaction-diffusion equation with unknown right-hand side, we consider a nonlinear inverse problem of estimating the associated leading eigenvalues and initial condition modes from a finite number of non-local noisy measurements. We…

Optimization and Control · Mathematics 2026-01-08 Rami Katz , Giulia Giordano , Dmitry Batenkov

Achieving resolution in the sub-Rayleigh regime (superresolution) is one of the rapidly developing topics in quantum optics and metrology. Recently, it was shown that perfect measurement based on spatial mode demultiplexing (SPADE) in…

Quantum Physics · Physics 2025-04-01 Konrad Schlichtholz , Łukasz Rudnicki

Non-stationary blind super-resolution is an extension of the traditional super-resolution problem, which deals with the problem of recovering fine details from coarse measurements. The non-stationary blind super-resolution problem appears…

Information Theory · Computer Science 2019-10-09 Shuang Li , Michael B. Wakin , Gongguo Tang

We consider the problem of reconstructing one-dimensional point sources from their Fourier measurements in a bounded interval $[-\Omega, \Omega]$. This problem is known to be challenging in the regime where the spacing of the sources is…

Signal Processing · Electrical Eng. & Systems 2024-06-11 Zetao Fei , Hai Zhang

We consider the problem of localizing the source using range and range-difference measurements. Both the problems are non-convex and non-smooth and are challenging to solve. In this paper, we develop an iterative algorithm - Source…

Signal Processing · Electrical Eng. & Systems 2020-02-10 R. Jyothi , P. Babu

For more than a century, the diffraction limit has defined the resolution achievable by passive optical imaging systems. Although some resolution improvement can be gained through classical data processing of the image, it is limited by the…

Quantum Physics · Physics 2026-05-12 A. I. Lvovsky , Michael R. Grace , Saikat Guha , Mankei Tsang , Gerardo Adesso , Nicolas Treps

Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set…

Computer Vision and Pattern Recognition · Computer Science 2007-05-23 Vicky Choi , Navin Goyal

In this paper, we analyze the convergence %semi-convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of…

Numerical Analysis · Mathematics 2022-02-11 Mahdi Mirzapour , Andrzej Cegielski , Tommy Elfving

Fourier ptychographic microscopy is a computational imaging technique that provides quantitative phase information and high resolution over a large field-of-view. Although the technique presents numerous advantages over conventional…

Optics · Physics 2021-09-16 Eric Li , Stuart Sherwin , Gautam Gunjala , Laura Waller

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…

Optimization and Control · Mathematics 2015-08-14 Geoffrey Schiebinger , Elina Robeva , Benjamin Recht

This paper studies the problem of recovering a discrete complex measure on the torus from a finite number of corrupted Fourier samples. We assume the support of the unknown discrete measure satisfies a minimum separation condition and we…

Information Theory · Computer Science 2017-02-13 Weilin Li

In this work, we study the performance of sub-gradient method (SubGM) on a natural nonconvex and nonsmooth formulation of low-rank matrix recovery with $\ell_1$-loss, where the goal is to recover a low-rank matrix from a limited number of…

Machine Learning · Computer Science 2022-02-18 Jianhao Ma , Salar Fattahi