Computation of "Best" Interpolants in the Lp Sense

We study a variant of the interpolation problem where the continuously defined solution is regularized by minimizing the L p -norm of its second-order derivative. For this continuous-domain problem, we propose an exact discretization scheme that restricts the search space to quadratic splines with k...

Full description

Saved in:
Bibliographic Details
Main Authors: Bohra, Pakshal, Unser, Michael
Format: Conference Proceeding
Language:English
Subjects:
Conferences
Interpolation
L p -norm
regularization
Search problems
Signal processing
Signal processing algorithms
Speech processing
splines
Splines (mathematics)
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study a variant of the interpolation problem where the continuously defined solution is regularized by minimizing the L p -norm of its second-order derivative. For this continuous-domain problem, we propose an exact discretization scheme that restricts the search space to quadratic splines with knots on an uniform grid. This leads to a discrete finite-dimensional problem that is computationally tractable. Another benefit of our spline search space is that, when the grid is sufficiently fine, it contains functions that are arbitrarily close to the solutions of the underlying unrestricted problem. We implement an iteratively reweighted algorithm with a grid-refinement strategy that computes the solution within a prescribed accuracy. Finally, we present experimental results that illustrate characteristics, such as sparsity, of the L p -regularized interpolants.
ISSN:2379-190X
DOI:10.1109/ICASSP40776.2020.9054162