TY - JOUR
T1 - Projected Gradient Method Combined with Homotopy Techniques for Volume-Measure-Preserving Optimal Mass Transportation Problems
AU - Yueh, Mei Heng
AU - Huang, Tsung Ming
AU - Li, Tiexiang
AU - Lin, Wen Wei
AU - Yau, Shing Tung
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2021/9
Y1 - 2021/9
N2 - Optimal mass transportation has been widely applied in various fields, such as data compression, generative adversarial networks, and image processing. In this paper, we adopt the projected gradient method, combined with the homotopy technique, to find a minimal volume-measure-preserving solution for a 3-manifold optimal mass transportation problem. The proposed projected gradient method is shown to be sublinearly convergent at a rate of O(1/k). Several numerical experiments indicate that our algorithms can significantly reduce transportation costs. Some applications of the optimal mass transportation maps—to deformations and canonical normalizations between brains and solid balls—are demonstrated to show the robustness of our proposed algorithms.
AB - Optimal mass transportation has been widely applied in various fields, such as data compression, generative adversarial networks, and image processing. In this paper, we adopt the projected gradient method, combined with the homotopy technique, to find a minimal volume-measure-preserving solution for a 3-manifold optimal mass transportation problem. The proposed projected gradient method is shown to be sublinearly convergent at a rate of O(1/k). Several numerical experiments indicate that our algorithms can significantly reduce transportation costs. Some applications of the optimal mass transportation maps—to deformations and canonical normalizations between brains and solid balls—are demonstrated to show the robustness of our proposed algorithms.
KW - Optimal mass transportation
KW - Simply connected 3-Manifold
KW - Volume-measure-preserving
UR - http://www.scopus.com/inward/record.url?scp=85111360517&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85111360517&partnerID=8YFLogxK
U2 - 10.1007/s10915-021-01583-z
DO - 10.1007/s10915-021-01583-z
M3 - Article
AN - SCOPUS:85111360517
SN - 0885-7474
VL - 88
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 3
M1 - 64
ER -