Solve optimal transport problems in statistics. Compute Wasserstein metrics (a.k.a. Kantorovitch, Fortet–Mourier, Mallows, Earth Mover's, or minimal L_p metrics), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, point patterns, and mass vectors.
Given two objects a and b that specify distributions of mass and an object that specifies (a way to compute) costs, find the transference plan for going from a to b that minimizes the total cost.
● Data Source:
CranContrib
● Keywords: main function
● Alias: transport, transport.default, transport.pgrid, transport.pp
●
0 images