transport - Computation of Optimal Transport Plans and Wasserstein Distances
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.
Last updated 5 months ago
cppopenmp
7.81 score 4 stars 21 dependents 414 scripts 1.5k downloadskanjistat - A Statistical Framework for the Analysis of Japanese Kanji Characters
Various tools and data sets that support the study of kanji, including their morphology, decomposition and concepts of distance and similarity between them.
Last updated 8 months ago
cpp
5.08 score 4 stars 6 scripts 150 downloads