Super-resolution of point sources via convex programming
From MaRDI portal
Publication:4603727
DOI10.1093/imaiai/iaw005zbMath1386.94027arXiv1507.07034OpenAlexW2739492417MaRDI QIDQ4603727
Publication date: 19 February 2018
Published in: Information and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07034
convex optimizationgroup sparsitysparse recoverysuper-resolutiondual certificatesmultiple measurementsovercomplete dictionariesline-spectra estimation
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (30)
On the uniqueness of solutions for the basis pursuit in the continuum ⋮ Robust recovery of stream of pulses using convex optimization ⋮ Point source super-resolution via non-convex \(L_1\) based methods ⋮ Accuracy of noisy Spike-Train Reconstruction: a Singularity Theory point of view ⋮ Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients ⋮ When does OMP achieve exact recovery with continuous dictionaries? ⋮ Approximate super-resolution of positive measures in all dimensions ⋮ Multicompartment magnetic resonance fingerprinting ⋮ A note on spike localization for line spectrum estimation ⋮ Sampling the Fourier Transform Along Radial Lines ⋮ A diffusion + wavelet-window method for recovery of super-resolution point-masses with application to single-molecule microscopy and beyond ⋮ Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization ⋮ Adapting to unknown noise level in sparse deconvolution ⋮ Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain ⋮ A theory of super-resolution from short-time Fourier transform measurements ⋮ TV-based reconstruction of periodic functions ⋮ A Sampling Theorem for Deconvolution in Two Dimensions ⋮ A unifying representer theorem for inverse problems and machine learning ⋮ Stable separation and super-resolution of mixture models ⋮ Super-resolution by means of Beurling minimal extrapolation ⋮ Testing Gaussian process with applications to super-resolution ⋮ Super-Resolution of Positive Sources: The Discrete Setup ⋮ The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy ⋮ Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision ⋮ Super-resolution of positive sources on an arbitrarily fine grid ⋮ Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition ⋮ On Representer Theorems and Convex Regularization ⋮ Sparsest piecewise-linear regression of one-dimensional data ⋮ Multikernel Regression with Sparsity Constraint ⋮ Quantization for spectral super-resolution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Sharp recovery bounds for convex demixing, with applications
- Exact reconstruction using Beurling minimal extrapolation
- Super-resolution from noisy data
- Exact support recovery for sparse spikes deconvolution
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Exponentially accurate approximations to periodic Lipschitz functions based on Fourier series partial sums
- Compressed sensing and matrix completion with constant proportion of corruptions
- 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
- Exact matrix completion via convex optimization
- Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
- Near Minimax Line Spectral Estimation
- Robust principal component analysis?
- Performance of high resolution frequencies estimation methods compared to the Cramer-Rao bounds
- Rank-Sparsity Incoherence for Matrix Decomposition
- Algebraic Fourier reconstruction of piecewise smooth functions
- Statistical analysis of MUSIC and subspace rotation estimates of sinusoidal frequencies
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Spectral Analysis of Signals: The Missing Data Case
- Linear Inversion of Band-Limited Reflection Seismograms
- Signal enhancement-a composite property mapping algorithm
- Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
- Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- Atomic Norm Denoising With Applications to Line Spectral Estimation
- Accurate Reconstructions of Functions of Finite Regularity from Truncated Fourier Series Expansions
- Compressed Sensing Off the Grid
- Sampling signals with finite rate of innovation
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Towards a Mathematical Theory of Super‐resolution
- Model Selection and Estimation in Regression with Grouped Variables
- Inequalities of A. Markoff and S. Bernstein for polynomials and related functions
- Positive trigonometric polynomials and signal processing applications
- Compressed sensing
This page was built for publication: Super-resolution of point sources via convex programming
