The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Fast and robust Earth Mover's Distances
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
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
Ciaccia, P., Patella, M., & Zezula, P. (1997) · Cited by 1,527
A sparse texture representation using local affine regions
Lazebnik, S., Schmid, C., & Ponce, J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.151 · Cited by 1,123
(1993) · doi:10.5555/313559.313789 · Cited by 998
Using the triangle inequality to accelerate k-means
Elkan, C. (2003) · International Conference on Machine Learning · Cited by 954
Faster algorithms for the shortest path problem
Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E. (1990) · Journal of the ACM · doi:10.1145/77600.77615 · Cited by 554
An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison
Ling, H., & Okada, K. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1058 · Cited by 414
The Pyramid Match Kernel: Efficient Learning with Sets of Features
Grauman, K. L., & Darrell, T. (2007) · doi:10.5555/1248659.1248685 · Cited by 325
A Linear Time Histogram Metric for Improved SIFT Matching
Pele, O., & Werman, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_37 · Cited by 305
Self-citationFast contour matching using approximate Earth mover's distance
Grauman, K., & Darrell, T. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315035 · Cited by 215
Edge, junction, and corner detection using color distributions
Ruzon, M. A., & Tomasi, C. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969118 · Cited by 190
Approximate earth mover’s distance in linear time
Shirdhonkar, S., & Jacobs, D. W. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587662 · Cited by 176
A distance metric for multidimensional histograms
Werman, M., Peleg, S., & Rosenfeld, A. (1985) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(85)90055-6 · Cited by 170
Self-citationA unified approach to the change of resolution: space and gray-level
Peleg, S., Werman, M., & Rom, H. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192468 · Cited by 170
Self-citationDistance-Based Classification with Lipschitz Functions
von Luxburg, U., & Bousquet, O. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_24 · Cited by 153
Image similarity search with compact data structures
Lv, Q., Charikar, M., & Li, K. (2004) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1031171.1031213 · Cited by 105
Earth Mover Distance over High-Dimensional Spaces
Andoni, A., Indyk, P., & Krauthgamer, R. (2007) · Cited by 78
Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing
Pele, O., & Werman, M. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70794 · Cited by 74
Self-citationNear duplicate image identification with patially Aligned Pyramid Matching
Xu, D., Cham, T., Yan, S., & Chang, S.-F. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587720 · Cited by 40
Sublinear Time Algorithms for Earth Mover’s Distance
Ba, K. D., Nguyễn, H. L., Nguyen, H. N., et al. (2010) · Theory of Computing Systems · doi:10.1007/s00224-010-9265-8 · Cited by 34
An algorithm for the detection and construction of Monge sequences
Alon, N., Cosares, S., Hochbaum, D. S., & Ron Shamir, A. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90487-4 · Cited by 33
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Sandler, R., & Lindenbaum, M. (2009) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2009.5206834 · Cited by 31
CSDD Features: Center-Surround Distribution Distance for Feature Extraction and Matching
Collins, R. T., & Ge, W. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88690-7_11 · Cited by 16
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
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.