Fast and robust Earth Mover's Distances
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
We present a new algorithm for a robust family of Earth Mover's Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that the number of edges is reduced by an order of magnitude. As a result, we compute the EMD by an order of magnitude faster than the original algorithm, which makes it possible to compute the EMD on large histograms and databases. In addition, we show that EMDs with thresholded ground distances have many desirable properties. First, they correspond to the way humans perceive distances. Second, they are robust to outlier noise and quantization effects. Third, they are metrics. Finally, experimental results on image retrieval show that thresholding the ground distance of the EMD improves both accuracy and speed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
Toward a Universal Law of Generalization for Psychological Science
Shepard, R. N. (1987) · Science · doi:10.1126/science.3629243 · Cited by 2,416
SIMPLIcity: semantics-sensitive integrated matching for picture libraries
Wang, J. Z., Li, J., & Wiederhold, G. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.955109 · Cited by 2,196
Sharma, G., Wu, W., & Dalal, E. N. (2005) · Color Research & Application · doi:10.1002/col.20070 · Cited by 2,175
The development of the CIE 2000 colour‐difference formula: CIEDE2000
Luo, M. R., Cui, G., & Rigg, B. (2001) · Color Research & Application · doi:10.1002/col.1049 · Cited by 2,114 · cited 3×
“The state of the art color distance is Δ00 - ciede2000 on L*a*b* color space[22, 32] (see also Fig.”
BackgroundMethodZhang, J., Marszałek, M., Lazebnik, S., & Schmid, C. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-9794-4 · Cited by 1,923
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
What Do Different Evaluation Metrics Tell Us About Saliency Models?
Bylinskii, Z., Judd, T., Oliva, A., Torralba, A., & Durand, F. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2815601 · Cited by 802
Zio, E. (2022) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2021.108119 · Cited by 714
Multimodal Explanations: Justifying Decisions and Pointing to the Evidence
Park, D. H., Hendricks, L. A., Akata, Z., Rohrbach, A., Schiele, B., Darrell, T., & Rohrbach, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00915 · Cited by 418
Fast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
Visual Event Recognition in Videos by Learning from Web Data
Duan, L., Xu, D., Tsang, I. W.-H., & Luo, J. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.265 · Cited by 409
A generative modeling approach for benchmarking and training shallow quantum circuits
Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0157-8 · Cited by 379
“In our simulations, we use the PyEMD Python library for fast computation of the earth moving distance [66]. c. Moment matching via mean squared error: where the expectation values P D and P θ are taken with respect to data and circuit distributions, respectively.”
MethodA comparative study of image retargeting
Rubinstein, M., Gutiérrez, D., Sorkine‐Hornung, O., & Shamir, A. (2010) · ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia (SIGGRAPH Asia) · doi:10.1145/1866158.1866186 · Cited by 343
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Kuhn, D., Esfahani, P. M., Nguyen, V. A., & Shafieezadeh-Abadeh, S. (2019) · Operations Research & Management Science in the Age of Analytics · doi:10.1287/educ.2019.0198 · Cited by 342
Learning with a Wasserstein Loss
Frogner, C., Zhang, C., Mobahi, H., Araya‐Polo, M., & Poggio, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.05439 · Cited by 337
Probabilistic Forecasting and Bayesian Data Assimilation
Reich, S., & Cotter, C. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107706804 · Cited by 334
Unsupervised Training for 3D Morphable Model Regression
Genova, K., Cole, F., Maschinot, A., Sarna, A., Vlasic, D., & Freeman, W. T. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00874 · Cited by 311
Machine Learning in Materials Science: Recent Progress and Emerging Applications
Mueller, T., Kusne, A. G., & Ramprasad, R. (2016) · Reviews in Computational Chemistry · doi:10.1002/9781119148739.ch4 · Cited by 295
Human mobility modeling at metropolitan scales
Isaacman, S., Becker, R., Cáceres, R., Martonosi, M., Rowland, J., Varshavsky, A., & Willinger, W. (2012) · Proceedings of the 10th international conference on Mobile systems, applications, and services · doi:10.1145/2307636.2307659 · Cited by 291
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Altschuler, J. M., Weed, J., & Rigollet, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09634 · Cited by 280
Regularized Discrete Optimal Transport
Ferradans, S., Papadakis, N., Peyré, G., & Aujol, J.-F. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130929886 · Cited by 188
Spatio-temporal Object Detection Proposals
Oneata, D., Revaud, J., Verbeek, J., & Schmid, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10578-9_48 · Cited by 181
“where dμ(n,m) = min(‖μ(n)− μ(m)‖ , 30) is the robust thresholded-distance between the color means [33], dcol(n,m) and dflow(n,m) are chi-squared distances between the color and flow histograms.”
Can the macro beat the micro? Integrated information across spatiotemporal scales
Hoel, E. P., Albantakis, L., Marshall, W., & Tononi, G. (2016) · Neuroscience of Consciousness · doi:10.1093/nc/niw012 · Cited by 140
PyPhi: A toolbox for integrated information theory
Mayner, W. G. P., Marshall, W., Albantakis, L., Findlay, G., Marchman, R., & Tononi, G. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006343 · Cited by 118
Albantakis, L., Hintze, A., Koch, C., Adami, C., & Tononi, G. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003966 · Cited by 101
Albantakis, L., & Tononi, G. (2015) · Entropy · doi:10.3390/e17085472 · Cited by 58
“EMD calculations within the IIT program were performed using the open source fast code of Pele and Werman [45].”
Method
Metadata
- Authors
- Pele, O., & Werman, M.
- Venue
- 2009 IEEE 12th International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2009-09
- Pages
- 460-467
- OpenAlex
- W2539033431
- Cited by
- 805
- References
- 32
- FWCI
- 15.54
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.