A Theory of Computational Resolution Limit for Line Spectral Estimation
From MaRDI portal
Abstract: Line spectral estimation is a classical signal processing problem that aims to estimate the line spectra from their signal which is contaminated by deterministic or random noise. Despite a large body of research on this subject, the theoretical understanding of this problem is still elusive. In this paper, we introduce and quantitatively characterize the two resolution limits for the line spectral estimation problem under deterministic noise: one is the minimum separation distance between the line spectra that is required for exact detection of their number, and the other is the minimum separation distance between the line spectra that is required for a stable recovery of their supports. The quantitative results imply a phase transition phenomenon in each of the two recovery problems, and also the subtle difference between the two. We further propose a sweeping singular-value-thresholding algorithm for the number detection problem and conduct numerical experiments. The numerical results confirm the phase transition phenomenon in the number detection problem.
Cited in
(13)- A mathematical theory of the computational resolution limit in one dimension
- Dynamic super-resolution in particle tracking problems
- A mathematical theory of computational resolution limit in multi-dimensional spaces
- Generalized Line Spectral Estimation via Convex Optimization
- Super-resolution of generalized spikes and spectra of confluent Vandermonde matrices
- An Operator Theory for Analyzing the Resolution of Multi-illumination Imaging Modalities
- IFF: A Superresolution Algorithm for Multiple Measurements
- 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
- SCAN-MUSIC: an efficient super-resolution algorithm for large-scale single snapshot line spectral estimation
- Adaptive spectral community detection in temporal networks: a modularity optimization framework with memory and smoothing
- Towards a theory of stable super-resolution: model-based formulation and stability analysis
This page was built for publication: A Theory of Computational Resolution Limit for Line Spectral Estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001828)
