Learn R Programming
⚠️There's a newer version (0.15-4) of this package.Take me there.

transport (version 0.15-0)

Computation of Optimal Transport Plans and Wasserstein Distances

Description

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.

Copy Link

Version

Install

install.packages('transport')

Monthly Downloads

3,204

Version

0.15-0

License

GPL (>= 2)

Maintainer

Dominic Schuhmacher

Last Published

March 26th, 2024

Functions in transport (0.15-0)

random

Images to Illustrate the Use of transport.pgrid
power_diagram

Compute the Power Diagram of Weighted Sites in 2-Dimensional Space
wasserstein1d

Compute the Wasserstein Distance Between Two Univariate Samples
transport_track

Create a Dynamic Visualization of a Transference Plan Between Two pgrids
unbalanced

Unbalanced Optimal Transport Between Two Objects
transport

Find Optimal Transport Plan Between Two Objects
subwasserstein

Approximate Computation of Wasserstein Distances via Subsampling.
transport-package

Optimal Transport in Various Forms
trcontrol

Set the Control Parameters Used by transport.
transport-internal

Internal Functions in Package ‘transport’
wpp-object

Class of Weighted Point Patterns
wpp

Constructor for the wpp Class
wasserstein

Compute the Wasserstein Distance Between Two Objects
pgrid

Constructor for the pgrid Class
plot.ut_pgrid

Plot Unbalanced Transport Information
all.equal (transport objects)

Methods for Judging Near Equality of Objects of Class pgrid, pp or wpp
matimage

Plotting Matrices as Images
compatible

Test whether Two Objects are Compatible
methods

Print and Summary Methods for Objects of Class pgrid, pp and wpp
plot.ut_wpp

Plot Unbalanced Transport Information
plot

Methods for Plotting Objects of Class pgrid, pp and wpp
aha

Solve Transportation Problem by Aurenhammer--Hoffmann--Aronov Method
plot_apollonius

Plot Apollonius Diagram
shielding

Compute Optimal Transport (Cost/Plan) Using the Multiscale Shielding Method
starting solutions

Compute starting solution for the transportation problem
pgrid-object

Class of Pixel Grids
pp-object

Class of (Unweighted) Point Patterns
semidiscrete1

Compute Semidiscrete Optimal Transport for Euclidean Distance Cost
pp

Constructor for the pp Class
ret_message

Return Text Strings for lbfgs Return Codes
semidiscrete

Find Optimal Transport Partition Between pgrid and wpp.