Abstract
We present a new histogram distance, the Tangent Earth Mover’s Distance (TEMD). The TEMD is a generalization of the Earth Mover’s Distance (EMD) that is invariant to some global transformations. Thus, like the EMD it is robust to local deformations. Additionally, it is robuster to global transformations such as global translations and rotations of the whole image. The TEMD is formulated as a linear program which allows efficient computation. Additionally, previous works about the efficient computation of the EMD that reduced the number of variables in the EMD linear program can be used to accelerate also the TEMD computation. We present results for image retrieval using the Scale Invariant Feature Transform (SIFT) and color image descriptors. We show that the new TEMD outperforms state of the art distances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover’s distance as a metric for image retrieval. IJCV (2000)
Pele, O., Werman, M.: A linear time histogram metric for improved sift matching. In: ECCV (2008)
Ling, H., Okada, K.: An Efficient Earth Mover’s Distance Algorithm for Robust Histogram Comparison. PAMI (2007)
Pele, O., Werman, M.: Fast and robust earth mover’s distances. In: ICCV (2009)
Shen, H., Wong, A.: Generalized texture representation and metric. CVGIP (1983)
Werman, M., Peleg, S., Rosenfeld, A.: A distance metric for multidimensional histograms. CVGIP (1985)
Werman, M., Peleg, S., Melter, R., Kong, T.: Bipartite graph matching for points on a line or a circle. JoA (1986)
Peleg, S., Werman, M., Rom, H.: A unified approach to the change of resolution: Space and gray-level. PAMI (1989)
Orlin, J.: A faster strongly polynomial minimum cost flow algorithm. In: STOC (1988)
Rabin, J., Delon, J., Gousseau, Y.: Transportation distances on the circle. JMIV (2011)
Delon, J., Salomon, J., Sobolevski, A.: Local matching indicators for transport problems with concave costs. JDM (2012)
Ling, H., Okada, K.: An Efficient Earth Mover’s Distance Algorithm for Robust Histogram Comparison. PAMI (2007)
Gudmundsson, J., Klein, O., Knauer, C., Smid, M.: Small Manhattan Networks and Algorithmic Applications for the Earth Movers Distance. In: EWCG (2007)
Ruzon, M., Tomasi, C.: Edge, Junction, and Corner Detection Using Color Distributions. PAMI (2001)
Lv, Q., Charikar, M., Li, K.: Image similarity search with compact data structures. In: ICIKM (2004)
Simard, P., LeCun, Y., Denker, J., Victorri, B.: Transformation invariance in pattern recognition–tangent distance and tangent propagation. NN (1998)
Cohen, S., Guibas, L.: The earth mover’s distance under transformation sets. In: ICCV (1999)
Zhang, W., Srinivasan, P., Shi, J.: Discriminative image warping using attribute flow. In: CVPR (2011)
Yianilos, P.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA (1993)
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: ICVLDB (1997)
Elkan, C.: Using the Triangle Inequality to Accelerate k-Means. In: ICML (2003)
MOSEK: The MOSEK optimization software, http://www.mosek.com/
Lowe, D.: Distinctive image features from scale-invariant keypoints. IJCV (2004)
Luo, M., Cui, G., Rigg, B.: The Development of the CIE 2000 Colour-Difference Formula: CIEDE2000. CRA (2001)
Sharma, G., Wu, W., Dalal, E.: The CIEDE2000 color-difference formula: implementation notes, supplementary test data, and mathematical observations. CRA (2005)
Rabin, J., Peyré, G., Delon, J., Bernot, M.: Wasserstein barycenter and its application to texture mixing. SSVM (2012)
Ricci, E., Zen, G., Sebe, N., Messelodi, S.: A prototype learning framework using emd: Application to complex scenes analysis (2012)
Wagner, J., Ommer, B.: Efficiently clustering earth movers distance. In: ACCV (2010)
Hastie, T., Simard, P., Säckinger, E.: Learning prototype models for tangent distance. NIPS (1994)
Cuturi, M., Avis, D.: Ground metric learning. arXiv (2011)
Wang, F., Guibas, L.: Supervised earth movers distance learning and its computer vision applications. In: ECCV (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pele, O., Taskar, B. (2013). The Tangent Earth Mover’s Distance. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-40020-9_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40019-3
Online ISBN: 978-3-642-40020-9
eBook Packages: Computer ScienceComputer Science (R0)