Earth Mover Distance over high-dimensional spaces

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 343-352

  Andoni, Alexandr ^a   Indyk, Piotr ^a   Krauthgamer, Robert ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITIES; DISTANCE INFORMATION; EARTH MOVER DISTANCE (EMD); LOWER BOUNDS; MINIMUM COSTS;

ALGORITHMS; COMPUTER VISION; CONTROL THEORY; IMAGE PROCESSING;

APPROXIMATION ALGORITHMS;

EID: 58649090261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Alexandr Andoni, Piotr Indyk, and Robert Krauthgamer. Earth mover distance over highdimensional spaces. ECCC Report TR07-048, May 2007.
2. Alexandr Andoni and Robert Krauthgamer. The computational hardness of estimating edit distance. In Proceedings of the Symposium on Foundations of Computer Science, 2007. To appear.
3. P. Agarwal and K. Varadarajan. A near-linear constant factor approximation for euclidean matching? Proceedings of the ACM Symposium on Computational Geometry, 2004.
4. Bo Brinkman and Moses Charikar. On the impossibility of dimension reduction in 11. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
5. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004.
6. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. Proceedings of the Symposium on Foundations of Computer Science, 1998.
7. M. Charikar. Similarity estimation techniques from rounding. Proceedings of the Symposium on Theory of Computing, 2002.
8. 1. Theory of Computing, 2(11):207-224, 2006.
9. M. Charikar, C. Lv, W. Josephson, Z. Wang, and K. Li, Ferret: A toolkit for content-based similarity search. In Proceedings of ACM SIGOS EuroSys Conference, 2006. To appear.
10. M. Charikar, Q. Lv, and K. Li. Image similarity search with compact data structures. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), 2004.
11. Graham Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Trans. Algorithms, 3(1):2, 2007.
12. K. Grauman and T. Darrell. Fast contour matching using approximate Earth Mover's Distance. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Washington DC, June 2004.
13. K. Grauman and T. Darrell. Efficient image matching with distributions of local invariant features. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition (CVPR), San Diego, CA, June 2005.
14. K. Grauman and T. Darrell. The pyramid match kernel: Discriminative classification with sets of image features. In Proceedings of the IEEE International Conference on Computer Vision (ICCV), Beijing, China, October 2005.
15. K. Grauman and T. Darrell. Approximate correspondences in high dimensions. In Proceedings of Advances in Neural Information Processing Systems (NIPS), 2006.
16. K. Grauman and T. Darrell. Unsupervised learning of categories from sets of partially matching image features. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), New York City, NY, June 2006.
17. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium on Theory of Computing, pages 604-613, 1998.
18. P. Indyk. A near linear time constant factor approximation for euclidean bichromatic matching (cost). In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2007. To appear.
19. Piotr Indyk. Uncertainty principles, extractors, and explicit embeddings of L2 into LI. In Proceedings of the Symposium on Theory of Computing, 2007. To appear.
20. P. Indyk and N. Thaper. Fast color image retrieval via embeddings. Workshop on Statistical and Computational Theories of Vision (at ICCV), 2003.
21. S. Khot and A. Naor. Nonembeddability theorems via fourier analysis. Mathematische Annalen, 334(4):821-852, 2006.
22. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the Symposium on Theory of Computing, pages 614-623, 1998.
23. 1. In Proceedings of the nth Annual ACM-SIAM Symposium on Discrete Algorithm, pages 1010-1017, 2006.
24. E. Lawler. Combinatorial optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
25. 1. Geometric and Functional Analysis (GAFA), 14(4).745-747, 2004.
26. S. Muthukrishnan and C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. Proceedings of the Symposium on Theory of Computing, pages 416-424, 2000.
27. R. Ostrovsky and Y. Rabani. Low distortion embedding for edit distance. In Proceedings of the Symposium on Theory of Computing, pages 218-224, 2005.
28. R. Panigrahy. Entropy-based nearest neighbor algorithm in high dimensions. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2006.
29. Y. Rubner, C. Tomassi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000.
30. Michael Saks and Xiaodong Sun. Space lower bounds for distance approximation in the data stream model. In Proceedings of the Symposium on Theory of Computing, pages 360-369, 2002.
31. A. C-C. Yao. Lower bounds by probabilistic arguments. In Proceedings of the Symposium on Foundations of Computer Science, pages 420-428, 1983.