NANAJan 12, 2018

Fast iterative solvers for an optimal transport problem

arXiv:1801.0417213 citationsh-index: 27
AI Analysis

This work provides computational tools for solving optimal transport problems in image processing, though the improvements are incremental.

The authors develop fast iterative solvers for an optimal transport problem in image metamorphosis, achieving efficient numerical solutions via Gauss-Newton schemes and preconditioners, with a radial basis function discretization reducing dimensionality.

Optimal transport problems pose many challenges when considering their numerical treatment. We investigate the solution of a PDE-constrained optimisation problem subject to a particular transport equation arising from the modelling of image metamorphosis. We present the nonlinear optimisation problem, and discuss the discretisation and treatment of the nonlinearity via a Gauss--Newton scheme. We then derive preconditioners that can be used to solve the linear systems at the heart of the (Gauss--)Newton method. With the optical flow in mind, we further propose the reduction of dimensionality by choosing a radial basis function discretisation that uses the centres of superpixels as the collocation points. Again, we derive suitable preconditioners that can be used for this formulation.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes