Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
From MaRDI portal
Publication:2941579
DOI10.1145/2746539.2746561zbMath1321.68421arXiv1408.1681OpenAlexW2060929722MaRDI QIDQ2941579
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1681
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)
Related Items (41)
Linear sampling method applied to non destructive testing of an elastic waveguide: theory, numerics and experiments ⋮ Stable super-resolution limit and smallest singular value of restricted Fourier matrices ⋮ Prony's method on the sphere ⋮ A mathematical theory of the computational resolution limit in one dimension ⋮ Pole recovery from noisy data on imaginary axis ⋮ Imaging an acoustic waveguide from surface data in the time domain ⋮ A note on spike localization for line spectrum estimation ⋮ Adaptive denoising of signals with local shift-invariant structure ⋮ Vandermonde matrices with nodes in the unit disk and the large sieve ⋮ A multivariate generalization of Prony's method ⋮ An Operator Theory for Analyzing the Resolution of Multi-illumination Imaging Modalities ⋮ IFF: A Superresolution Algorithm for Multiple Measurements ⋮ On the smallest singular value of multivariate Vandermonde matrices with clustered nodes ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ Short Communication: Weak Sparse Superresolution is Well-Conditioned ⋮ Dynamic super-resolution in particle tracking problems ⋮ Super-resolution of point sources via convex programming ⋮ The spectral properties of Vandermonde matrices with clustered nodes ⋮ Sample complexity of the distinct elements problem ⋮ Single-exponential bounds for the smallest singular value of Vandermonde matrices in the sub-Rayleigh regime ⋮ A mathematical theory of computational resolution limit in multi-dimensional spaces * ⋮ MultiDimensional Sparse Super-Resolution ⋮ Deterministic sparse FFT for \(M\)-sparse vectors ⋮ On the condition number of Vandermonde matrices with pairs of nearly-colliding nodes ⋮ Unnamed Item ⋮ Prony's method under an almost sharp multivariate Ingham inequality ⋮ Stability and super-resolution of generalized spike recovery ⋮ Deterministic sparse sublinear FFT with improved numerical stability ⋮ Multi-kernel unmixing and super-resolution using the modified matrix pencil method ⋮ Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction ⋮ Moment Ideals of Local Dirac Mixtures ⋮ Conditioning of Partial Nonuniform Fourier Matrices with Clustered Nodes ⋮ How to get high resolution results from sparse and coarsely sampled data ⋮ Super-resolution of positive sources on an arbitrarily fine grid ⋮ Bounds on the Singular Values of Matrices with Displacement Structure ⋮ A randomized multivariate matrix pencil method for superresolution microscopy ⋮ Bounding Zolotarev numbers using Faber rational functions ⋮ Quantization for spectral super-resolution ⋮ Spurious minimizers in non uniform Fourier sampling optimization ⋮ How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix? ⋮ Multivariate Vandermonde matrices with separated nodes on the unit circle are stable
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
