Sparsity for dynamic inverse problems on Wasserstein curves with bounded variation

Abstract

We investigate a dynamic inverse problem using a regularization which implements the so-called Wasserstein-$1$ distance. It naturally extends well-known static problems such as lasso or total variation regularized problems to a (temporally) dynamic setting. Further, the decision variables, realized as BV curves, are allowed to exhibit discontinuities, in contrast to the design variables in classical optimal transport based regularization techniques. We prove the existence and a characterization of a sparse solution. Further, we use an adaption of the fully-corrective generalized conditional gradient method to experimentally justify that the determination of BV curves in the Wasserstein-$1$ space is numerically implementable.

References in corpus (12)

• Sparsity of solutions for variational inverse problems with finite-dimensional data
• Long-term planning versus short-term planning in the asymptotical location problem
• Dynamic Cell Imaging in PET with Optimal Transport Regularization
• A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
• An optimal transport approach for solving dynamic inverse problems in spaces of measures
• Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
• A superposition principle for the inhomogeneous continuity equation with Hellinger-Kantorovich-regular coefficients
• A multi-material transport problem with arbitrary marginals
• Formulation of branched transport as geometry optimization
• Proximal methods for point source localisation
• Absolutely continuous and BV-curves in 1-Wasserstein spaces
• Formulas for the $h$-mass on $1$-currents with coefficients in ${\mathbb{R}}^m$