EMD
Code for the Earth Movers Distance (EMD). This is an implementation of the Earth Movers Distance, as described in [1]. The EMD computes the distance between two distributions, which are represented by signatures. The signatures are sets of weighted features that capture the distributions. The features can be of any type and in any number of dimensions, and are defined by the user. The EMD is defined as the minimum amount of work needed to change one signature into the other. The notion of ”work” is based on the user-defined ground distance which is the distance between two features. The size of the two signatures can be different. Also, the sum of weights of one signature can be different than the sum of weights of the other (partial match). Because of this, the EMD is normalized by the smaller sum. The code is implemented in C, and is based on the solution for the Transportation problem as described in [2] Please let me know of any bugs you find, or any questions, comments, suggestions, and criticisms you have. If you find this code useful for your work, I would like very much to hear from you. Once you do, I’ll inform you of any improvements, etc. Also, an acknowledgment in any publication describing work that uses this code would be greatly appreciated.
Keywords for this software
References in zbMATH (referenced in 212 articles , 1 standard article )
Showing results 1 to 20 of 212.
Sorted by year (- Balzanella, Antonio; Irpino, Antonio: Spatial prediction and spatial dependence monitoring on georeferenced data streams (2020)
- Bassetti, Federico; Gualandi, Stefano; Veneroni, Marco: On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows (2020)
- Budinich, Renato; Plonka, Gerlind: A tree-based dictionary learning framework (2020)
- Cárcamo, Javier; Cuevas, Antonio; Rodríguez, Luis-Alberto: Directional differentiability for supremum-type functionals: statistical applications (2020)
- Katzfuss, Matthias; Stroud, Jonathan R.; Wikle, Christopher K.: Ensemble Kalman methods for high-dimensional hierarchical dynamic space-time models (2020)
- Luini, E.; Arbenz, P.: Density estimation of multivariate samples using Wasserstein distance (2020)
- Stuart, Andrew M.; Wolfram, Marie-Therese: Inverse optimal transport (2020)
- Xu, Ganggang; Zhu, Huirong; Lee, J. Jack: Borrowing strength and borrowing index for Bayesian hierarchical models (2020)
- Carlsson, John Gunnar; Wang, Ye: Distributions with maximum spread subject to Wasserstein distance constraints (2019)
- Cloninger, Alexander; Roy, Brita; Riley, Carley; Krumholz, Harlan M.: People mover’s distance: class level geometry using fast pairwise data adaptive transportation costs (2019)
- de Gournay, Frédéric; Kahn, Jonas; Lebrat, Léo: Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure (2019)
- Kline, Jeffery: Properties of the (d)-dimensional Earth mover’s problem (2019)
- Liu, Jian-Guo; Pego, Robert L.; Slepčev, Dejan: Least action principles for incompressible flows and geodesics between shapes (2019)
- Liu, Jiarui; Xia, Qing; Li, Shuai; Hao, Aimin; Qin, Hong: Quantitative and flexible 3D shape dataset augmentation via latent space embedding and deformation learning (2019)
- Métivier, Ludovic; Brossier, R.; Mérigot, Q.; Oudet, E.: A graph space optimal transport distance as a generalization of (L^p) distances: application to a seismic imaging inverse problem (2019)
- Ostrovska, Sofiya; Ostrovskii, Mikhail I.: Generalized transportation cost spaces (2019)
- Redko, Ievgen; Habrard, Amaury; Sebban, Marc: On the analysis of adaptability in multi-source domain adaptation (2019)
- Schmitzer, Bernhard: Stabilized sparse scaling algorithms for entropy regularized transport problems (2019)
- Schmitzer, Bernhard; Wirth, Benedikt: A framework for Wasserstein-1-type metrics (2019)
- Shafieezadeh-Abadeh, Soroosh; Kuhn, Daniel; Esfahani, Peyman Mohajerin: Regularization via mass transportation (2019)