The Wasserstein Metric a.k.a Earth Mover's Distance: A Quick and Convenient Introduction
Here are two papers that describe this in more detail: Y. Lavin, R. Kumar Batra, and L. Hesselink. Feature Comparisons of Vector Fields Using Earth Mover’s Distance. In Proceedings IEEE Visualization ’98, pages 103–110, 1998. Y. Rubner, C. Tomasi, and L. J. Guibas. A Metric for Distributions with Applications to Image Databases. Computer Vision, 1998. Sixth International Conference on, 4-7 Jan 1998 Page(s): 59 - 66, 1998. Connect with Bob on LinkedIn: / robert-s-laramee Connect with Bob on Facebook: / datavisbob Connect with Bob on WeChat-User ID: rlaramee
▶︎
Glyph Design for Flow Visualization: A Quick and Convenient Summary
▶︎
Introduction to the Wasserstein distance
▶︎
Marco Cuturi - A Primer on Optimal Transport Part 1
▶︎
Tom Needham - Gromov-Wasserstein Distance and Applications to Shape Graphs
▶︎
Earth Mover's Distance and Maximum Mean Discrepancy | Unsupervised Learning for Big Data
▶︎
The Most Elegant Way to Compare Probability Distributions
▶︎
Estimating the Wasserstein Metric - Jonathan Niles-Weed
▶︎
New Frontiers in Mathematics: Professor Cédric Villani, “Optimal Transport Theory”
▶︎
Marco Cuturi - A Primer on Optimal Transport Part 2
▶︎
How to pre-process your spectra for research (SNV, MSC, Derivatives, etc.)
▶︎
Shape Analysis (Lecture 19): Optimal transport
▶︎
An introduction to persistent homology
▶︎
Deep Learning 35: (2) Wasserstein Generative Adversarial Network (WGAN): Wasserstein metric
▶︎
Improving and Generalizing Flow-Based Generative Models with Minibatch Optimal Transport | Alex Tong
▶︎
A Near-Linear Time Algorithm for the Chamfer Distance
▶︎
Soheil Kolouri - Wasserstein Embeddings in the Deep Learning Era
▶︎
Optimal Transport and Information Geometry for Machine Learning and Data Science
▶︎
Wasserstein Distance & Optimal Transport — Fully Explained
▶︎
Marco Part A Primer on Optimal Transport Part 3
▶︎