arXiv subjects

Vincent Guillemet

Publications and source records attributed to Vincent Guillemet.

4 recordsLinked to original sources

arXiv2025

Variational Tensor-Product Splines

Multidimensional continuous-domain inverse problems are often solved by the minimization of a loss functional, formed as the sum of a data fidelity and a regularization. In this work, we present a new construction where the regularization is itself built as the sum of two terms: i) the M norm of the regularizing operator L1 b L2, with L1 and L2 being two one-dimensional differential operators; ii) a bounded-variation norm that regularizes on the infinite-dimensional nullspace of L1 b L2. In this construction, we show that the extreme points of the solution set are the tensor product of one-dimensional splines, with a number of atoms upper-bounded in term of the number of data points. Further, when the data of the inverse problem is localized, we reveal that the term ii) must take the form of a sum of bounded-variation norms, precomposed with partial derivative of different orders.

math.NA↗

arXiv2025

Sampling in BV-Type Spaces

The sampling of functions of bounded variation (BV) is a long-standing problem in op- timization. The ability to sample such functions has relevance in the field of variational inverse problems, where the standard theory fails to guarantee the mere existence of solutions when the loss functional involves samples of BV functions. In this paper, we prove the continuity of sampling functionals and show that the differential operator D admits a unique local inverse. This canonical inversion enables us to formulate an existence theorem for a class of regularized optimization problems that incorporate samples of BV functions. Finally, we characterize the solution set in terms of its extreme points.

math.OC↗

arXiv2025

Mixed-Derivative Total Variation

The formulation of norms on continuous-domain Banach spaces with exact pixel-based discretization is advantageous for solving inverse problems (IPs). In this paper, we investigate a new regularization that is a convex combination of a TV term and the $\M(\R^2)$ norm of mixed derivatives. We show that the extreme points of the corresponding unit ball are indicator functions of polygons whose edges are aligned with either the $x_1$- or $x_2$-axis. We then apply this result to construct a new regularization for IPs, which can be discretized exactly by tensor products of first-order B-splines, or equivalently, pixels. Furthermore, we exactly discretize the loss of the denoising problem on its canonical pixel basis and prove that it admits a unique solution, which is also a solution to the underlying continuous-domain IP.

math.NA↗

arXiv2025

Adaptive Vector-Valued Splines for the Resolution of Inverse Problems

We introduce a general framework for the reconstruction of vector-valued functions from finite and possibly noisy data, acquired through a known measurement operator. The reconstruction is done by the minimization of a loss functional formed as the sum of a convex data fidelity functional and a total-variation-based regularizer involving a suitable matrix L of differential operators. Here, the total variation is a norm on the space of vector measures. These are split into two categories: inner, and outer norms. The minimization is performed over an infinite-dimensional Banach search space. When the measurement operator is weakstar-continuous over the search space, our main result is that the solution set of the loss functional is the closed convex hull of adaptive L-splines, with fewer knots than the number of measurements. We reveal the effect of the total-variation norms on the structure of the solutions and show that inner norms yield sparser solutions. We also provide an explicit description of the class of admissible measurement operators.

math.OC↗