Sliced optimal transport reduces optimal transport on multi-dimensional domains to transport on the line. More precisely, sliced optimal transport is the concatenation of the well-known Radon transform and the cumulative density transform, which analytically yields the solutions of the reduced transport problems. Inspired by this concept, we propose two adaptions for optimal transport on the 2-sphere. Firstly, as counterpart to the Radon transform, we introduce the vertical slice transform, which integrates along all circles orthogonal to a given direction. Secondly, we introduce the weighted semicircle transform, which integrates along all half great circles. Both transforms are generalized to arbitrary measures on the sphere. While the vertical slice transform can be combined with optimal transport on the interval and leads to a sliced Wasserstein distance restricted to even probability measures, the semicircle transform is related to optimal transport on the circle and results in a different sliced Wasserstein distance for arbitrary probability measures. The applicability of both novel sliced optimal transport concepts on the sphere is demonstrated by proof-of-concept examples dealing with the interpolation and classification of spherical probability measures. The numerical implementation relies on the singular value decompositions of both transforms and fast Fourier techniques. For the inversion with respect to probability measures, we propose the minimization of an entropy-regularized Kullback--Leibler divergence, which can be numerically realized using a primal-dual proximal splitting algorithm.
翻译:切片最优输运将多维域上的最优输运简化为在一维空间上的输运。更确切地说,切片最优输运是常见的 Radon 变换和累积密度变换的级联,从而解决了简化的输运问题。受此概念的启发,我们提出了两种方法来求解球面上的最优输运。首先,作为 Radon 变换的对应物,我们引入了垂直切片变换,它沿着与给定方向垂直的所有圆进行积分。其次,我们引入了带权半圆变换,它沿着所有半大圆进行积分。这些变换都可以泛化为球面上的任意测量。虽然垂直切片变换可与区间上的最优输运相结合,并导致限于偶数概率测度的切片 Wasserstein 距离,但半圆变换与圆上的最优输运相关,并针对任意概率测度产生了不同的切片 Wasserstein 距离。通过涉及球面概率测度的插值和分类的概念验证示例,说明了这两个新颖的球面上的切片最优输运概念的适用性。数值实现依赖于这两种变换的奇异值分解和快速傅里叶变换技术。针对概率测度反演,我们提出了最小化经熵正则化的 Kullback-Leibler 分歧以及使用原始-对偶近端分裂算法进行数值实现的方法。