TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods

DOI10.1016/J.CAM.2022.114937MaRDI QIDQ2104103zbMATHOpenAlexFDO

Authors Thomas Debarre, Quentin Denoyelle, Julien Fageot

Publication date 9 December 2022

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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

optimization splines inverse problems Fourier analysis generalized total-variation regularization grid-based algorithms

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Spline approximation (41A15) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Classical almost periodic functions, mean periodic functions (42A75)

Abstract: We study the problem of recovering piecewise-polynomial periodic functions from their low-frequency information. This means that we only have access to possibly corrupted versions of the Fourier samples of the ground truth up to a maximum cutoff frequency

K_{c}

. The reconstruction task is specified as an optimization problem with total-variation (TV) regularization (in the sense of measures) involving the

M

-th order derivative regularization operator

m a t h r m L = m a t h r m D^{M}

. The order

M g e q 1

determines the degree of the reconstructed piecewise polynomial spline, whereas the TV regularization norm, which is known to promote sparsity, guarantees a small number of pieces. We show that the solution of our optimization problem is always unique, which, to the best of our knowledge, is a first for TV-based problems. Moreover, we show that this solution is a periodic spline matched to the regularization operator

m a t h r m L

whose number of knots is upper-bounded by

2 K_{c}

. We then consider the grid-based discretization of our optimization problem in the space of uniform

m a t h r m L

-splines. On the theoretical side, we show that any sequence of solutions of the discretized problem converges uniformly to the unique solution of the gridless problem as the grid size vanishes. Finally, on the algorithmic side, we propose a B-spline-based algorithm to solve the grid-based problem, and we demonstrate its numerical feasibility experimentally. On both of these aspects, we leverage the uniqueness of the solution of the original problem.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods

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