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 146 articles , 1 standard article )
Showing results 1 to 20 of 146.
Sorted by year (- Yu, Xiaokang; Lei, Na; Zheng, Xiaopeng; Gu, Xianfeng: Surface parameterization based on polar factorization (2018)
- Kuang, Max; Tabak, Esteban G.: Preconditioning of optimal transport (2017)
- Mendivil, Franklin: Computing the Monge-Kantorovich distance (2017)
- Puccetti, Giovanni: An algorithm to approximate the optimal expected inner product of two vectors with given marginals (2017)
- Whidden, Chris; Matsen, Frederick A.IV: Ricci-ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph (2017)
- Wolansky, Gershon: On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value? (2017)
- Abramov, Rafail V.; Kjerland, Marc: The response of reduced models of multiscale dynamics to small external perturbations (2016)
- Berrendero, José R.; Cuevas, Antonio; Pateiro-López, Beatriz: Shape classification based on interpoint distance distributions (2016)
- Christlieb, Andrew; Lawlor, David; Wang, Yang: A multiscale sub-linear time Fourier algorithm for noisy data (2016)
- Cuturi, Marco; Peyré, Gabriel: A smoothed dual approach for variational Wasserstein problems (2016)
- Dsilva, Carmeline J.; Talmon, Ronen; Gear, C.William; Coifman, Ronald R.; Kevrekidis, Ioannis G.: Data-driven reduction for a class of multiscale fast-slow stochastic dynamical systems (2016)
- Huang, Juntao; Yong, Wen-An; Hong, Liu: Generalization of the Kullback-Leibler divergence in the Tsallis statistics (2016)
- Koulouri, Alexandra; Rimpiläinen, Ville; Brookes, Mike; Kaipio, Jari P.: Compensation of domain modelling errors in the inverse source problem of the Poisson equation: application in electroencephalographic imaging (2016)
- Leeb, William; Coifman, Ronald: Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover’s distance (2016)
- Musatov, Daniil; Savvateev, Alexei; Weber, Shlomo: Gale-Nikaido-Debreu and Milgrom-Shannon: communal interactions with endogenous community structures (2016)
- Schmitzer, Bernhard: A sparse multiscale algorithm for dense optimal transport (2016)
- Wang, Chi; Jonckheere, Edmond; Brun, Todd: Differential geometric treewidth estimation in adiabatic quantum computation (2016)
- Benamou, Jean-David; Carlier, Guillaume; Cuturi, Marco; Nenna, Luca; Peyré, Gabriel: Iterative Bregman projections for regularized transportation problems (2015)
- Bonneel, Nicolas; Rabin, Julien; Peyré, Gabriel; Pfister, Hanspeter: Sliced and Radon Wasserstein barycenters of measures (2015)
- Bronstein, Alexander M.; Bronstein, Michael M.: Manifold intrinsic similarity (2015)