transport

From MaRDI portal
Transport



swMATH17086CRANtransportMaRDI QIDQ28947FDOQ28947

Computation of Optimal Transport Plans and Wasserstein Distances

Nicolas Bonneel, Björn Bähre, Bernhard Schmitzer, Florian Heinemann, Valentin Hartmann, Dominic Schuhmacher, Jörn Schrieber, Carsten Gottschlich

Last update: 18 February 2024

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 0.13-0, 0.14-1, 0.6-1, 0.6-2, 0.6-3, 0.7-0, 0.7-3, 0.8-1, 0.8-2, 0.9-3, 0.9-4, 0.10-0, 0.11-0, 0.11-1, 0.11-2, 0.12-0, 0.12-1, 0.12-2, 0.12-4, 0.14-4, 0.14-6, 0.14-7

Official website: https://cran.r-project.org/web/packages/transport/index.html

Source code repository: https://github.com/cran/transport

Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet–Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.




Cited In (29)


This page was built for software: transport