Fast and robust earth mover's distances

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 460-467

  Pele, Ofir ^a   Werman, Michael ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EARTH MOVER'S DISTANCE; ORDER OF MAGNITUDE; ORIGINAL ALGORITHMS; QUANTIZATION EFFECTS; THRESHOLDING;

ALGORITHMS; COMPUTER VISION; WAVELET TRANSFORMS;

EDGE DETECTION;

EID: 77953203542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459199     Document Type: Conference Paper

References (42)

1. R. Ahuja, A. Goldberg, J. Orlin, and R. Tarjan. Finding minimum-cost flows by double scaling. Mathematical Programming, 1992.
2. R. Ahuja, T. Magnanti, and J. Orlin. Network flows: theory, algorithms, and applications. 1993.
3. R. Ahuja, K. Mehlhorn, J. Orlin, and R. Tarjan. Faster algorithms for the shortest path problem. JACM, 1990.
4. N. Alon, S. Cosares, D. S. Hochbaum, and R. Shamir. An algorithm for the detection and construction of monge sequences. LAA, 1989.
5. A. Andoni, P. Indyk, and R. Krauthgamer. Earth mover distance over high-dimensional spaces. In SODA, 2008.
6. K. D. Ba, H. L. Nguyen, H. N. Nguyen, and R. Rubinfeld. Sublinear time algorithms for earth mover's distance. CoRR, 2009.
7. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In ICVLDB, 1997.
8. R. Collins and W. Ge. CSDD Features: Center-Surround Distribution Distance for Feature Extraction and Matching. In ECCV, 2008.
9. J. Edmonds and R. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. JACM, 1972.
10. C. Elkan. Using the Triangle Inequality to Accelerate k-Means. In ICML, 2003.
11. M. Fredman and R. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. JACM, 1987.
12. K. Grauman and T. Darrell. Fast contour matching using approximate earth mover's distance. In CVPR, 2004.
13. K. Grauman and T. Darrell. The pyramid match kernel: Efficient learning with sets of features. JMLR, 2007.
14. J. Gudmundsson, O. Klein, C. Knauer, and M. Smid. Small Manhattan Networks and Algorithmic Applications for the Earth Movers Distance. In EWCG, 2007.
15. M. Hein, O. Bousquet, and B. Schölkopf. Maximal margin classification for metric spaces. JCSS, 2005.
16. A. Hoffman. On simple linear programming problems. In SPM, 1963.
17. P. Indyk and N. Thaper. Fast image retrieval via embeddings. In IWSCTV, 2003.
18. S. Khot and A. Naor. Nonembeddability theorems via Fourier analysis. Mathematische Annalen, 2006.
19. S. Lazebnik, C. Schmid, and J. Ponce. A sparse texture representation using local affine regions. PAMI, 2005.
20. H. Ling and K. Okada. An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison. PAMI, 2007.
21. D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 2004.
22. M. Luo, G. Cui, and B. Rigg. The Development of the CIE 2000 Colour-Difference Formula: CIEDE2000. CRA, 2001.
23. Q. Lv, M. Charikar, and K. Li. Image similarity search with compact data structures. In ICIKM, 2004.
24. G. Monge. Déblai et remblai. Mémoires de l'Académie des Sciences, 1781.
25. J. Orlin. A faster strongly polynomial minimum cost flow algorithm. In STOC, 1988.
26. O. Pele and M. Werman. A linear time histogram metric for improved sift matching. In ECCV, 2008.
27. O. Pele and M. Werman. Robust real time pattern matching using bayesian sequential hypothesis testing. PAMI, 2008.
28. S. Peleg, M. Werman, and H. Rom. A unified approach to the change of resolution: Space and gray-level. PAMI, 1989.
29. Y. Rubner, C. Tomasi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. IJCV, 2000.
30. M. Ruzon and C. Tomasi. Edge, Junction, and Corner Detection Using Color Distributions. PAMI, 2001.
31. R. Sandler and M. Lindenbaum. Nonnegative Matrix Factorization with Earth Movers Distance Metric. In CVPR, 2009.
32. G. Sharma, W. Wu, and E. Dalal. The CIEDE2000 color-difference formula: implementation notes, supplementary test data, and mathematical observations. CRA, 2005.
33. H. Shen and A. Wong. Generalized texture representation and metric. CVGIP, 1983.
34. R. Shepard. Toward a universal law of generalization for psychological science. Science, 1987.
35. S. Shirdhonkar and D. Jacobs. Approximate earth movers distance in linear time. In CVPR, 2008.
36. U. von Luxburg and O. Bousquet. Distance-Based Classification with Lipschitz Functions. JMLR, 2004.
37. J. Wang, J. Li, and G. Wiederhold. SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture LIbraries. PAMI, 2001.
38. M. Werman, S. Peleg, R. Melter, and T. Kong. Bipartite graph matching for points on a line or a circle. JoA, 1986.
39. M. Werman, S. Peleg, and A. Rosenfeld. A distance metric for multidimensional histograms. CVGIP, 1985.
40. D. Xu, T. Cham, S.Yan, and S. Chang. Near Duplicate Image Identification with Spatially Aligned Pyramid Matching. In CVPR, 2008.
41. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA, 1993.
42. J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid. Local features and kernels for classification of texture and object categories: A comprehensive study. IJCV, 2007.