A mathematical theory of computational resolution limit in multi-dimensional spaces

DOI10.1088/1361-6420/AC245BMaRDI QIDQ5157864zbMATH OpenOpenAlexFDO

Authors

Publication date 20 October 2021

Published in Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

resolution limitsuper-resolutiontransition phenomenon

Mathematics Subject Classification ID

Convergence and absolute convergence of Fourier and trigonometric series (42A20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: 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 fundamental limit on the separation distance between point sources that can be resolved. This is the so-called resolution limit problem. Characterization of this resolution limit is still a long-standing puzzle despite the prevalent use of the classic Rayleigh limit. It is well-known that Rayleigh limit is heuristic and its drawbacks become prominent when dealing with data that is subjected to delicate processing, as is what modern computational imaging methods do. Therefore, more precise characterization of the resolution limit becomes increasingly necessary with the development of data processing methods. For this purpose, we developed a theory of "computational resolution limit" for both number detection and support recovery in one dimension in [arXiv:2003.02917[cs.IT], arXiv:1912.05430[eess.IV]]. In this paper, we extend the one-dimensional theory to multi-dimensions. More precisely, we define and quantitatively characterize the "computational resolution limit" for the number detection and support recovery problems in a general k-dimensional space. Our results indicate that there exists a phase transition phenomenon regarding to the super-resolution factor and the signal-to-noise ratio in each of the two recovery problems. Our main results are derived using a subspace projection strategy. Finally, to verify the theory, we proposed deterministic subspace projection based algorithms for the number detection and support recovery problems in dimension two and three. The numerical results confirm the phase transition phenomenon predicted by the theory.

Recommendations

• A mathematical theory of the computational resolution limit in one dimension
• Towards a Mathematical Theory of Super‐resolution
• Super-resolution from noisy data
• Super-resolution of positive sources: the discrete setup
• Multivariate super-resolution without separation

Cites work

• A Theory of Computational Resolution Limit for Line Spectral Estimation
• A Tree Structure One-Dimensional Based Algorithm for Estimating the Two-Dimensional Direction of Arrivals and Its Performance Analysis
• Computationally Efficient Subspace-Based Method for Two-Dimensional Direction Estimation With L-Shaped Array
• Conditioning of partial nonuniform Fourier matrices with clustered nodes
• Estimating the dimension of a model
• Exact support recovery for sparse spikes deconvolution
• Improved Source Number Detection and Direction Estimation With Nested Arrays and ULAs Using Jackknifing
• Joint 2-D DOA Estimation via Sparse L-shaped Array
• Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
• Modeling by shortest data description
• MultiDimensional Sparse Super-Resolution
• MUSIC for Multidimensional Spectral Estimation: Stability and Super-Resolution
• MUSIC for single-snapshot spectral estimation: stability and super-resolution
• MUSIC, maximum likelihood, and Cramer-Rao bound
• Near Minimax Line Spectral Estimation
• On the resolvability of sinusoids with nearby frequencies in the presence of noise
• On the Stable Resolution Limit of Total Variation Regularization for Spike Deconvolution
• Stable super-resolution limit and smallest singular value of restricted Fourier matrices
• Super-resolution of near-colliding point sources
• Super-resolution of positive sources: the discrete setup
• Super-resolution, extremal functions and the condition number of Vandermonde matrices
• Superresolution via Sparsity Constraints
• Support recovery for sparse super-resolution of positive measures
• TESTS OF SIGNIFICANCE FOR THE LATENT ROOTS OF COVARIANCE AND CORRELATION MATRICES
• The detection and resolution of optical signals
• Towards a Mathematical Theory of Super‐resolution

Cited in

(14)

• Super-resolution of positive sources on an arbitrarily fine grid
• A mathematical theory of the computational resolution limit in one dimension
• Dynamic super-resolution in particle tracking problems
• scientific article; zbMATH DE number 6287197 (Why is no real title available?)
• Algorithmic foundations for the diffraction limit
• An Operator Theory for Analyzing the Resolution of Multi-illumination Imaging Modalities
• Short Communication: Weak Sparse Superresolution is Well-Conditioned
• A mathematical theory of super-resolution and two-point resolution
• Improved resolution estimate for the two-dimensional super-resolution and a new algorithm for direction of arrival estimation with uniform rectangular array
• Mathematical foundation of sparsity-based multi-snapshot spectral estimation
• Nonharmonic multivariate Fourier transforms and matrices: condition numbers and hyperplane geometry
• Spectral properties of infinitely smooth kernel matrices in the single cluster limit, with applications to multivariate super-resolution
• Effective regions and kernels in continuous sparse regularization, with application to sketched mixtures
• Towards a theory of stable super-resolution: model-based formulation and stability analysis

This page was built for publication: A mathematical theory of computational resolution limit in multi-dimensional spaces

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