Superresolution via Sparsity Constraints

From MaRDI portal
Revision as of 02:00, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4020417

DOI10.1137/0523074zbMath0769.42007OpenAlexW2018778093MaRDI QIDQ4020417

David L. Donoho

Publication date: 16 January 1993

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0523074





Related Items (76)

Data-driven atomic decomposition via frequency extraction of intrinsic mode functionsThe maximum entropy method on the mean: Applications to linear programming and superresolutionWide-Band Butterfly Network: Stable and Efficient Inversion Via Multi-Frequency Neural NetworksGlobal testing against sparse alternatives in time-frequency analysisBayesian methods and maximum entropy for ill-posed inverse problemsPoint source super-resolution via non-convex \(L_1\) based methodsAccuracy of noisy Spike-Train Reconstruction: a Singularity Theory point of viewThe Noise Collector for sparse recovery in high dimensionsSolving Fredholm equations by maximum entropy on the mean. Application to superresolutionMinimizing L 1 over L 2 norms on the gradientSuper-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficientsSparse non-negative super-resolution -- simplified and stabilisedStable super-resolution limit and smallest singular value of restricted Fourier matricesApproximate super-resolution of positive measures in all dimensionsA mathematical theory of the computational resolution limit in one dimensionExact support recovery for sparse spikes deconvolutionLocal and Global Geometry of Prony Systems and Fourier Reconstruction of Piecewise-Smooth FunctionsSuper-resolution of generalized spikes and spectra of confluent Vandermonde matricesDifference-of-Convex Learning: Directional Stationarity, Optimality, and SparsityA note on spike localization for line spectrum estimationA diffusion + wavelet-window method for recovery of super-resolution point-masses with application to single-molecule microscopy and beyondBeurling-type density criteria for system identificationSpatially distributed sampling and reconstructionOrder of uniform approximation by polynomial interpolation in the complex plane and beyondNeuroelectric source localization by random spatial samplingIFF: A Superresolution Algorithm for Multiple MeasurementsMUSIC for single-snapshot spectral estimation: stability and super-resolutionOn the smallest singular value of multivariate Vandermonde matrices with clustered nodesDynamic super-resolution in particle tracking problemsSuper-resolution radarA theory of super-resolution from short-time Fourier transform measurementsGeometry of error amplification in solving the Prony system with near-colliding nodesThe spectral properties of Vandermonde matrices with clustered nodesSuper-resolution from noisy dataIterative thresholding algorithmsSingle-exponential bounds for the smallest singular value of Vandermonde matrices in the sub-Rayleigh regimeStable soft extrapolation of entire functionsA mathematical theory of computational resolution limit in multi-dimensional spaces *MultiDimensional Sparse Super-ResolutionSupport recovery for sparse super-resolution of positive measuresAnalysis of a two-layer neural network via displacement convexityON THE UNIVERSALITY OF THE DISTRIBUTION OF THE GENERALIZED EIGENVALUES OF A PENCIL OF HANKEL RANDOM MATRICESTowards a Mathematical Theory of Super‐resolutionKernel density estimation via diffusion and the complex exponentials approximation problemNonlinear approximation theory on compact groupsAn Iterative Algorithm with Joint Sparsity Constraints for Magnetic TomographyOn the condition number of Vandermonde matrices with pairs of nearly-colliding nodesAn inversion method based on random sampling for real-time MEG neuroimagingEigenmatrix for unstructured sparse recoveryStability and super-resolution of generalized spike recoveryAccuracy of reconstruction of spike-trains with two near-colliding nodesSuper-Resolution of Positive Sources: The Discrete SetupOn the accuracy of Prony's method for recovery of exponential sums with closely spaced exponentsA perturbative analysis for noisy spectral estimationA new transform for solving the noisy complex exponentials approximation problemSpike detection from inaccurate samplingsAccelerated projected gradient method for linear inverse problems with sparsity constraintsBayesian regularization: from Tikhonov to horseshoeThe sliding Frank–Wolfe algorithm and its application to super-resolution microscopySuperresolution with the zero-phase imaging conditionA mathematical theory of super-resolution and two-point resolutionImproved resolution estimate for the two-dimensional super-resolution and a new algorithm for direction of arrival estimation with uniform rectangular arrayMathematical foundation of sparsity-based multi-snapshot spectral estimationConditioning of Partial Nonuniform Fourier Matrices with Clustered NodesImaging with highly incomplete and corrupted dataWhat is resolution? A statistical minimax testing perspective on superresolution microscopySuper-resolution of positive sources on an arbitrarily fine gridModern regularization methods for inverse problemsCompressive sensing for subsurface imaging using ground penetrating radarSparsest piecewise-linear regression of one-dimensional dataA Three-Operator Splitting Algorithm for Nonconvex Sparsity RegularizationMinimization of $\ell_{1-2}$ for Compressed SensingSuper-resolution meets machine learning: approximation of measuresQuantization for spectral super-resolutionHow Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix?Non-uniform spline recovery from small degree polynomial approximation







This page was built for publication: Superresolution via Sparsity Constraints