transport (Q28947)

From MaRDI portal
Computation of Optimal Transport Plans and Wasserstein Distances
Language Label Description Also known as
English
transport
Computation of Optimal Transport Plans and Wasserstein Distances

    Statements

    0 references
    0 references
    0.13-0
    30 October 2022
    0 references
    0.14-1
    21 May 2023
    0 references
    0.6-1
    31 May 2014
    0 references
    0.6-2
    22 June 2014
    0 references
    0.6-3
    16 October 2014
    0 references
    0.7-0
    22 October 2015
    0 references
    0.7-3
    25 February 2016
    0 references
    0.8-1
    8 December 2016
    0 references
    0.8-2
    9 March 2017
    0 references
    0.9-3
    30 September 2017
    0 references
    0.9-4
    3 October 2017
    0 references
    0.10-0
    2 January 2019
    0 references
    0.11-0
    4 February 2019
    0 references
    0.11-1
    17 April 2019
    0 references
    0.11-2
    6 July 2019
    0 references
    0.12-0
    6 August 2019
    0 references
    0.12-1
    19 August 2019
    0 references
    0.12-2
    11 March 2020
    0 references
    0.12-4
    13 August 2022
    0 references
    0.14-4
    25 June 2023
    0 references
    0.14-6
    2 July 2023
    0 references
    0.14-7
    18 February 2024
    0 references
    0 references
    0 references
    18 February 2024
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references