Convolutional wasserstein distances: Efficient optimal transportation on geometric domains
This paper introduces a new class of algorithms for optimization problems involving optimal
transportation over geometric domains. Our main contribution is to show that optimal …
transportation over geometric domains. Our main contribution is to show that optimal …
Deep learning 3D shape surfaces using geometry images
Surfaces serve as a natural parametrization to 3D shapes. Learning surfaces using
convolutional neural networks (CNNs) is a challenging task. Current paradigms to tackle this …
convolutional neural networks (CNNs) is a challenging task. Current paradigms to tackle this …
A survey of optimal transport for computer graphics and computer vision
Optimal transport is a long‐standing theory that has been studied in depth from both
theoretical and numerical point of views. Starting from the 50s this theory has also found a …
theoretical and numerical point of views. Starting from the 50s this theory has also found a …
On computing mapping of 3d objects: A survey
X Li, SS Iyengar - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
We review the computation of 3D geometric data mapping, which establishes one-to-one
correspondence between or among spatial/spatiotemporal objects. Effective mapping …
correspondence between or among spatial/spatiotemporal objects. Effective mapping …
Optimal mass transport for shape matching and comparison
Surface based 3D shape analysis plays a fundamental role in computer vision and medical
imaging. This work proposes to use optimal mass transport map for shape matching and …
imaging. This work proposes to use optimal mass transport map for shape matching and …
Variational principles for Minkowski type problems, discrete optimal transport, and discrete Monge-Ampere equations
In this paper, we develop several related finite dimensional variational principles for discrete
optimal transport (DOT), Minkowski type problems for convex polytopes and discrete Monge …
optimal transport (DOT), Minkowski type problems for convex polytopes and discrete Monge …
Recent developments of surface parameterization methods using quasi-conformal geometry
Surface parameterization is of fundamental importance for many tasks in computer vision
and imaging. In recent years, computational quasi-conformal geometry has become an …
and imaging. In recent years, computational quasi-conformal geometry has become an …
Centroidal power diagrams with capacity constraints: Computation, applications, and extension
This article presents a new method to optimally partition a geometric domain with capacity
constraints on the partitioned regions. It is an important problem in many fields, ranging from …
constraints on the partitioned regions. It is an important problem in many fields, ranging from …
[HTML][HTML] The Sinkhorn algorithm, parabolic optimal transport and geometric Monge–Ampère equations
RJ Berman - Numerische Mathematik, 2020 - Springer
We show that the discrete Sinkhorn algorithm—as applied in the setting of Optimal Transport
on a compact manifold—converges to the solution of a fully non-linear parabolic PDE of …
on a compact manifold—converges to the solution of a fully non-linear parabolic PDE of …
Fast disk conformal parameterization of simply-connected open surfaces
Surface parameterizations have been widely used in computer graphics and geometry
processing. In particular, as simply-connected open surfaces are conformally equivalent to …
processing. In particular, as simply-connected open surfaces are conformally equivalent to …