A sampling theorem for deconvolution in two dimensions
From MaRDI portal
convex optimizationdeconvolutiondual certificateGaussian convolutionsampling theorysparsitysuper-resolution
Duality theory (optimization) (49N15) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Abstract: This work studies the problem of estimating a two-dimensional superposition of point sources or spikes from samples of their convolution with a Gaussian kernel. Our results show that minimizing a continuous counterpart of the norm exactly recovers the true spikes if they are sufficiently separated, and the samples are sufficiently dense. In addition, we provide numerical evidence that our results extend to non-Gaussian kernels relevant to microscopy and telescopy.
Recommendations
Cites work
- Compressed sensing
- Compressed Sensing Off the Grid
- Compressive sensing by random convolution
- Decoding by Linear Programming
- Deconvolution of point sources: a sampling theorem and robustness guarantees
- Demixing sines and spikes: Robust spectral super-resolution in the presence of outliers
- Exact matrix completion via convex optimization
- Exact reconstruction using Beurling minimal extrapolation
- Exact Sampling Results for Some Classes of Parametric Nonbandlimited 2-D Signals
- Exact support recovery for sparse spikes deconvolution
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- Linear Inversion of Band-Limited Reflection Seismograms
- MultiDimensional Sparse Super-Resolution
- Phase retrieval via matrix completion
- Robust recovery of stream of pulses using convex optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
- Sampling Schemes for Multidimensional Signals With Finite Rate of Innovation
- Sampling signals with finite rate of innovation
- Sparse Recovery Beyond Compressed Sensing: Separable Nonlinear Inverse Problems
- Stable Support Recovery of Stream of Pulses With Application to Ultrasound Imaging
- Super-resolution from noisy data
- Super-resolution of point sources via convex programming
- Superresolution without separation
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Towards a Mathematical Theory of Super‐resolution
- Towards Generalized FRI Sampling With an Application to Source Resolution in Radioastronomy
Cited in
(8)- Data-dependent sampling of two-dimensional signals
- Blind three dimensional deconvolution via convex optimization
- Testing Gaussian process with applications to super-resolution
- A mathematical theory of the computational resolution limit in one dimension
- Sampling theorems for two-dimensional isotropic random fields
- Sampling the Fourier transform along radial lines
- Deconvolution of point sources: a sampling theorem and robustness guarantees
- The Second Deconvolution Theorem
This page was built for publication: A sampling theorem for deconvolution in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143314)
