Super-resolution of point sources via convex programming
From MaRDI portal
Publication:4603727
DOI10.1093/IMAIAI/IAW005zbMATH Open1386.94027arXiv1507.07034OpenAlexW2739492417MaRDI QIDQ4603727FDOQ4603727
Authors: Carlos Fernandez-Granda 
Publication date: 19 February 2018
Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)
Abstract: We consider the problem of recovering a signal consisting of a superposition of point sources from low-resolution data with a cut-off frequency f. If the distance between the sources is under 1/f, this problem is not well posed in the sense that the low-pass data corresponding to two different signals may be practically the same. We show that minimizing a continuous version of the l1 norm achieves exact recovery as long as the sources are separated by at least 1.26/f. The proof is based on the construction of a dual certificate for the optimization problem, which can be used to establish that the procedure is stable to noise. Finally, we illustrate the flexibility of our optimization-based framework by describing extensions to the demixing of sines and spikes and to the estimation of point sources that share a common support.
Full work available at URL: https://arxiv.org/abs/1507.07034
Recommendations
convex optimizationsparse recoverysuper-resolutiongroup sparsitydual certificatesmultiple measurementsovercomplete dictionariesline-spectra estimation
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Nonlinear total variation based noise removal algorithms
- Title not available (Why is that?)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Title not available (Why is that?)
- Model Selection and Estimation in Regression with Grouped Variables
- Robust principal component analysis?
- Exact matrix completion via convex optimization
- Decoding by Linear Programming
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Title not available (Why is that?)
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
- Compressed sensing and matrix completion with constant proportion of corruptions
- Near Minimax Line Spectral Estimation
- Signal enhancement-a composite property mapping algorithm
- Super-resolution from noisy data
- Towards a Mathematical Theory of Super‐resolution
- Non-uniform spline recovery from small degree polynomial approximation
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
- Spike detection from inaccurate samplings
- Spectral analysis of signals. The missing data case.
- Exact reconstruction using Beurling minimal extrapolation
- Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
- Atomic Norm Denoising With Applications to Line Spectral Estimation
- Compressed Sensing Off the Grid
- Sampling signals with finite rate of innovation
- Positive trigonometric polynomials and signal processing applications
- Exact support recovery for sparse spikes deconvolution
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- Linear Inversion of Band-Limited Reflection Seismograms
- Sharp recovery bounds for convex demixing, with applications
- Accurate Reconstructions of Functions of Finite Regularity from Truncated Fourier Series Expansions
- Algebraic Fourier reconstruction of piecewise smooth functions
- Performance of high resolution frequencies estimation methods compared to the Cramer-Rao bounds
- Statistical analysis of MUSIC and subspace rotation estimates of sinusoidal frequencies
- Inequalities of A. Markoff and S. Bernstein for polynomials and related functions
- Exponentially accurate approximations to periodic Lipschitz functions based on Fourier series partial sums
- Super-resolution, extremal functions and the condition number of Vandermonde matrices
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
Cited In (48)
- A Convex Approach to Superresolution and Regularization of Lines in Images
- Multikernel regression with sparsity constraint
- Sparsest piecewise-linear regression of one-dimensional data
- Super-resolution by means of Beurling minimal extrapolation
- Sharp recovery bounds for convex demixing, with applications
- Stable separation and super-resolution of mixture models
- Adapting to unknown noise level in sparse deconvolution
- IFF: A Superresolution Algorithm for Multiple Measurements
- Quantization for spectral super-resolution
- Super-resolution of positive sources: the discrete setup
- Sampling the Fourier transform along radial lines
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- The problem of super resolution with Gaussian low pass filter
- Accuracy of noisy spike-train reconstruction: a singularity theory point of view
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Super-resolution from noisy data
- Deconvolution of point sources: a sampling theorem and robustness guarantees
- On the uniqueness of solutions for the basis pursuit in the continuum
- Stability and super-resolution of generalized spike recovery
- Superresolution without separation
- Robust recovery of stream of pulses using convex optimization
- A note on spike localization for line spectrum estimation
- Exact reconstruction and reconstruction from noisy data with anisotropic total variation
- On representer theorems and convex regularization
- Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision
- Super-resolution of positive sources on an arbitrarily fine grid
- Stable super-resolution of images: theoretical study
- Multichannel frequency estimation with constant amplitude via convex structured low-rank approximation
- Super-resolution, extremal functions and the condition number of Vandermonde matrices
- When does OMP achieve exact recovery with continuous dictionaries?
- Semidefinite representations of gauge functions for structured low-rank matrix decomposition
- Point source super-resolution via non-convex \(L_1\) based methods
- Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients
- Testing Gaussian process with applications to super-resolution
- Approximate super-resolution of positive measures in all dimensions
- Robust support function machines for set-valued data classification
- TV-based reconstruction of periodic functions
- A diffusion + wavelet-window method for recovery of super-resolution point-masses with application to single-molecule microscopy and beyond
- A mathematical theory of the computational resolution limit in one dimension
- Separation-free spectral super-resolution via convex optimization
- Nonconvex optimization for 3-dimensional point source localization using a rotating point spread function
- Blind three dimensional deconvolution via convex optimization
- Exact localization and superresolution with noisy data and random illumination
- A theory of super-resolution from short-time Fourier transform measurements
- Multicompartment magnetic resonance fingerprinting
- A sampling theorem for deconvolution in two dimensions
- Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain
- A unifying representer theorem for inverse problems and machine learning
This page was built for publication: Super-resolution of point sources via convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603727)
