Super-resolution from noisy data
From MaRDI portal
Publication:485201
DOI10.1007/S00041-013-9292-3zbMATH Open1312.94015arXiv1211.0290OpenAlexW2119499160MaRDI QIDQ485201FDOQ485201
Carlos Fernandez-Granda, Emmanuel J. Candès
Publication date: 9 January 2015
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Abstract: This paper studies the recovery of a superposition of point sources from noisy bandlimited data. In the fewest possible words, we only have information about the spectrum of an object in a low-frequency band bounded by a certain cut-off frequency and seek to obtain a higher resolution estimate by extrapolating the spectrum up to a higher frequency. We show that as long as the sources are separated by twice the inverse of the cut-off frequency, solving a simple convex program produces a stable estimate in the sense that the approximation error between the higher-resolution reconstruction and the truth is proportional to the noise level times the square of the super-resolution factor (SRF), which is the ratio between the desired high frequency and the cut-off frequency of the data.
Full work available at URL: https://arxiv.org/abs/1211.0290
sparsitydeconvolutionbasis mismatchline spectra estimationstable signal recoverysuper-resolution factor
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Semidefinite programming (90C22) Trigonometric interpolation (42A15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coherence pattern-guided compressive sensing with unresolved grids
- Adaptive estimation of a quadratic functional by model selection.
- Spectral compressive sensing
- Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
- Superresolution via Sparsity Constraints
- Towards a Mathematical Theory of Super‐resolution
- Sensitivity to Basis Mismatch in Compressed Sensing
- Atomic Norm Denoising With Applications to Line Spectral Estimation
- Compressed Sensing Off the Grid
- Positive trigonometric polynomials and signal processing applications
- Compressed Sensing of Complex Sinusoids: An Approach Based on Dictionary Refinement
- Statistical analysis of two nonlinear least-squares estimators of sine- wave parameters in the colored-noise case
- Performance of high resolution frequencies estimation methods compared to the Cramer-Rao bounds
- The MUSIC algorithm for sparse objects: a compressed sensing analysis
- Statistical analysis of MUSIC and subspace rotation estimates of sinusoidal frequencies
- Sparse Estimation of Spectral Lines: Grid Selection Problems and Their Solutions
- On the Accuracy of Solving Confluent Prony Systems
- The detection and resolution of optical signals
- On the resolvability of sinusoids with nearby frequencies in the presence of noise
Cited In (88)
- Sparsest piecewise-linear regression of one-dimensional data
- Super-resolution by means of Beurling minimal extrapolation
- Image restoration: structured low rank matrix framework for piecewise smooth functions and beyond
- TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods
- Stable separation and super-resolution of mixture models
- Stable soft extrapolation of entire functions
- Adapting to unknown noise level in sparse deconvolution
- Quantization for spectral super-resolution
- Stable super-resolution limit and smallest singular value of restricted Fourier matrices
- Super-resolution of positive sources: the discrete setup
- A multivariate generalization of Prony's method
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- Super-resolution of point sources via convex programming
- Data-driven atomic decomposition via frequency extraction of intrinsic mode functions
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Compressive Sensing with Redundant Dictionaries and Structured Measurements
- Sparse continuous-field and super-resolution method for direction-of-arrival estimation
- On the uniqueness of solutions for the basis pursuit in the continuum
- Stability and super-resolution of generalized spike recovery
- A mathematical theory of super-resolution by using a system of sub-wavelength Helmholtz resonators
- Robust recovery of stream of pulses using convex optimization
- Degrees of freedom for off-the-grid sparse estimation
- Adventures in Compressive Sensing Based MIMO Radar
- Dynamic Spike Superresolution and Applications to Ultrafast Ultrasound Imaging
- Global testing against sparse alternatives in time-frequency analysis
- Propagation and recovery of singularities in the inverse conductivity problem
- Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
- Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision
- MultiDimensional Sparse Super-Resolution
- Exact support recovery for sparse spikes deconvolution
- Uniqueness theory for model sets, and spectral superresolution
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- Super-resolution of positive sources on an arbitrarily fine grid
- Prony's method under an almost sharp multivariate Ingham inequality
- Optimal dual certificates for noise robustness bounds in compressive sensing
- A Sampling Theorem for Deconvolution in Two Dimensions
- Point source super-resolution via non-convex \(L_1\) based methods
- Conditioning of Partial Nonuniform Fourier Matrices with Clustered Nodes
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Multikernel Regression with Sparsity Constraint
- Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- What is resolution? A statistical minimax testing perspective on superresolution microscopy
- Convex optimization in sums of Banach spaces
- TV-based reconstruction of periodic functions
- Sampling the Fourier Transform Along Radial Lines
- Support recovery for sparse super-resolution of positive measures
- Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization
- Accuracy of noisy Spike-Train Reconstruction: a Singularity Theory point of view
- Prony's method on the sphere
- Accuracy of reconstruction of spike-trains with two near-colliding nodes
- A mathematical theory of the computational resolution limit in one dimension
- The geometry of off-the-grid compressed sensing
- Inverse point source location with the Helmholtz equation on a bounded domain
- Sparse non-negative super-resolution -- simplified and stabilised
- Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods
- Modern regularization methods for inverse problems
- Non-uniform spline recovery from small degree polynomial approximation
- Off-the-Grid Recovery of Piecewise Constant Images from Few Fourier Samples
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
- Spike detection from inaccurate samplings
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
- The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy
- Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
- Single-exponential bounds for the smallest singular value of Vandermonde matrices in the sub-Rayleigh regime
- A unifying representer theorem for inverse problems and machine learning
- Finite Dimensional Dynamical Sampling: An Overview
- Minimizing L 1 over L 2 norms on the gradient
- Solving inverse problems of obtaining super-resolution using neural networks
- An Operator Theory for Analyzing the Resolution of Multi-illumination Imaging Modalities
- IFF: A Superresolution Algorithm for Multiple Measurements
- Super-resolution meets machine learning: approximation of measures
- On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds
- Predictive algorithms in dynamical sampling for burst-like forcing terms
- Off-the-grid prediction and testing for linear combination of translated features
- A note on spike localization for line spectrum estimation
- Poissonian image restoration via the \(L_1/L_2\)-based minimization
- New low-rank optimization model and algorithms for spectral compressed sensing
- Localization of point scatterers via sparse optimization on measures
- Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary
- A diffusion + wavelet-window method for recovery of super-resolution point-masses with application to single-molecule microscopy and beyond
- Wide-Band Butterfly Network: Stable and Efficient Inversion Via Multi-Frequency Neural Networks
- Sparse recovery: the square of \(\ell_1/\ell_2\) norms
- Separation-free spectral super-resolution via convex optimization
- On the Role of Total Variation in Compressed Sensing
- Sigma Delta Quantization for Images
- Dimension reduction, exact recovery, and error estimates for sparse reconstruction in phase space
Uses Software
This page was built for publication: Super-resolution from noisy data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485201)
