The optimal mass transport problem is a geometric framework for how to transport masses in an optimal way. Historically it has had large impact in economic theory and operations research, and recently it has also gained significant interest in application areas such as signal processing, image processing, and machine learning.
The optimal mass transport problem can be formulated as a linear programming problem, however when computing the distance between two images the size of this linear program becomes prohibitively large. A recently development to address this builds on using an entropic barrier term and solving the resulting optimization problem using so called Sinkhorn iterations. This allows for an approximate solution of large optimal mass transport problems. In this work we show how these results can be used and extended in order to use optimal mass transport for solving inverse problems in, e.g., computerized tomography.
Axel Ringh received a M.Sc. degree in engineering physics from KTH Royal Institute of Technology, Stockholm, Sweden, in 2014. During his studies he spent one year on exchange at́ École Polytechnique Fédéral de Lausanne, Lausanne, Switzerland, and wrote his master thesis at Shanghai Jiao Tong University, Shanghai, China. Since 2014 he is a Ph.D. student at the Division of Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology. His research interest include moment problems, inverse problems in imaging, optimal mass transport, methods for convex optimization, and machine learning.