Non-uniform spline recovery from small degree polynomial approximation

DOI10.1016/J.JMAA.2015.05.034MaRDI QIDQ2352871zbMATH OpenOpenAlexFDO

Authors Yohann De Castro, Guillaume Mijoule

Publication date 6 July 2015

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.5662

zbMATH Keywords

\(\ell_1\)-minimizationalgebraic polynomialsLASSOnon-uniform splinessuper-resolution

Mathematics Subject Classification ID

Spline approximation (41A15) Numerical computation using splines (65D07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We investigate the sparse spikes deconvolution problem onto spaces of algebraic polynomials. Our framework encompasses the measure reconstruction problem from a combination of noiseless and noisy moment measurements. We study a TV-norm regularization procedure to localize the support and estimate the weights of a target discrete measure in this frame. Furthermore, we derive quantitative bounds on the support recovery and the amplitudes errors under a Chebyshev-type minimal separation condition on its support. Incidentally, we study the localization of the knots of non-uniform splines when a Gaussian perturbation of their inner-products with a known polynomial basis is observed (i.e. a small degree polynomial approximation is known) and the boundary conditions are known. We prove that the knots can be recovered in a grid-free manner using semidefinite programming.

Recommendations

• Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
• Splines in higher order TV regularization
• Exact support recovery for sparse spikes deconvolution
• Splines are universal solutions of linear inverse problems with generalized TV regularization
• TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods

Cites work

• A general expression for the distribution of the maximum of a Gaussian field and the approximation of the tail
• Chebyshev Polynomials and Markov-Bernstein Type Inequalities for Rational Spaces
• Convergence rates of convex variational regularization
• Exact reconstruction using Beurling minimal extrapolation
• Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
• Exact support recovery for sparse spikes deconvolution
• scientific article; zbMATH DE number 3561857 (Why is no real title available?)
• Inverse problems in spaces of measures
• Positive trigonometric polynomials and signal processing applications
• Spike detection from inaccurate samplings
• Super-resolution from noisy data
• Superresolution via Sparsity Constraints
• Towards a Mathematical Theory of Super‐resolution

Cited in

(5)

• Reconstruction of splines from nonuniform samples
• Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
• Robust recovery of stream of pulses using convex optimization
• Adapting to unknown noise level in sparse deconvolution
• Super-resolution of point sources via convex programming

This page was built for publication: Non-uniform spline recovery from small degree polynomial approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352871)