Initialization Procedures for Discrete and Semi-Discrete Optimal Transport

We propose three different methods to initialize optimal transport algorithms in both the discrete and semi-discrete settings. After introducing the optimal transport problem, we start by explaining why finding "good" (in a certain sense) initial weights is an important problem in computational optimal transport. We then describe three novel procedures to find such weights. Proofs of correctness are also given. We finally show on many numerical examples how choosing these weights improves the running times of optimal transport algorithms. We also describe some applications in various fields such as non-imaging optics; matching between a point cloud and a triangulated surface; seismic imaging. (C) 2019 Elsevier Ltd. All rights reserved.