Exact support recovery for sparse spikes deconvolution
From MaRDI portal
Publication:887157
DOI10.1007/s10208-014-9228-6zbMath1327.65104arXiv1306.6909OpenAlexW2017718716MaRDI QIDQ887157
Publication date: 28 October 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6909
Sensitivity, stability, well-posedness (49K40) Spaces of measures (46E27) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items
Supermix: sparse regularization for mixtures, On the uniqueness of solutions for the basis pursuit in the continuum, Robust recovery of stream of pulses using convex optimization, Degrees of freedom for off-the-grid sparse estimation, Two-Layer Neural Networks with Values in a Banach Space, Spectral Decompositions Using One-Homogeneous Functionals, Sparse optimization on measures with over-parameterized gradient descent, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Point source super-resolution via non-convex \(L_1\) based methods, A note on convergence of solutions of total variation regularized linear inverse problems, Sparse non-negative super-resolution -- simplified and stabilised, Stable super-resolution limit and smallest singular value of restricted Fourier matrices, When does OMP achieve exact recovery with continuous dictionaries?, Approximate super-resolution of positive measures in all dimensions, On gridless sparse methods for multi-snapshot direction of arrival estimation, Statistical learning guarantees for compressive clustering and compressive mixture modeling, An off-the-grid approach to multi-compartment magnetic resonance fingerprinting, Prony's method on the sphere, Convex optimization in sums of Banach spaces, A mathematical theory of the computational resolution limit in one dimension, Manifold separation-based DOA estimation for nonlinear arrays via compressed super-resolution of positive sources, Sampling the Fourier Transform Along Radial Lines, Optimal dual certificates for noise robustness bounds in compressive sensing, Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization, A perfect reconstruction property for PDE-constrained total-variation minimization with application in Quantitative Susceptibility Mapping, Off-the-Grid Curve Reconstruction through Divergence Regularization: An Extreme Point Result, Dynamical programming for off-the-grid dynamic inverse problems, The geometry of off-the-grid compressed sensing, The MLE is a reliable source: sharp performance guarantees for localization problems, IFF: A Superresolution Algorithm for Multiple Measurements, An Epigraphical Approach to the Representer Theorem, On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds, A two-stage numerical approach for the sparse initial source identification of a diffusion–advection equation *, Dynamic super-resolution in particle tracking problems, Compressed sensing of low-rank plus sparse matrices, Adapting to unknown noise level in sparse deconvolution, Super-resolution of point sources via convex programming, Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain, Numerical analysis of sparse initial data identification for parabolic problems, A theory of super-resolution from short-time Fourier transform measurements, Joint denoising and distortion correction of atomic scale scanning transmission electron microscopy images, Sparse spikes super-resolution on thin grids II: the continuous basis pursuit, Geometric properties of solutions to the total variation denoising problem, Inverse potential problems for divergence of measures with total variation regularization, TV-based reconstruction of periodic functions, A Sampling Theorem for Deconvolution in Two Dimensions, On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1\)], A unifying representer theorem for inverse problems and machine learning, A fast homotopy algorithm for gridless sparse recovery, On the linear convergence rates of exchange and continuous methods for total variation minimization, A mathematical theory of computational resolution limit in multi-dimensional spaces *, MultiDimensional Sparse Super-Resolution, Support recovery for sparse super-resolution of positive measures, A projection method on measures sets, Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?, On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics, Super-resolution by means of Beurling minimal extrapolation, Testing Gaussian process with applications to super-resolution, Accuracy of reconstruction of spike-trains with two near-colliding nodes, Low Complexity Regularization of Linear Inverse Problems, Spike detection from inaccurate samplings, Nonlinear spectral decompositions by gradient flows of one-homogeneous functionals, Multi-kernel unmixing and super-resolution using the modified matrix pencil method, The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy, Conditioning of Partial Nonuniform Fourier Matrices with Clustered Nodes, Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision, On Representer Theorems and Convex Regularization, Sparsest piecewise-linear regression of one-dimensional data, An optimal transport approach for solving dynamic inverse problems in spaces of measures, Inverse point source location with the Helmholtz equation on a bounded domain, Multikernel Regression with Sparsity Constraint, Linear convergence of accelerated conditional gradient algorithms in spaces of measures, The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem, TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods, Quantization for spectral super-resolution, Non-uniform spline recovery from small degree polynomial approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact reconstruction using Beurling minimal extrapolation
- Super-resolution from noisy data
- Scale space and variational methods in computer vision. Second international conference, SSVM 2009, Voss, Norway, June 1--5, 2009. Proceedings
- Spectral compressive sensing
- Spike detection from inaccurate samplings
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Near Minimax Line Spectral Estimation
- Robust Sparse Analysis Regularization
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- On Sparse Representations in Arbitrary Redundant Bases
- Linear Inversion of Band-Limited Reflection Seismograms
- Superresolution via Sparsity Constraints
- Atomic Decomposition by Basis Pursuit
- Convergence rates of convex variational regularization
- Inverse problems in spaces of measures
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- Towards a Mathematical Theory of Super‐resolution