The Tangent Earth Mover's Distance

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.

[1]  Julie Delon,et al.  Local Matching Indicators for Transport Problems with Concave Costs , 2011, SIAM J. Discret. Math..

[2]  Wencheng Wu,et al.  The CIEDE2000 color-difference formula: Implementation notes, supplementary test data, and mathematical observations , 2005 .

[3]  Julien Rabin,et al.  Transportation Distances on the Circle , 2009, Journal of Mathematical Imaging and Vision.

[4]  M. Luo,et al.  The development of the CIE 2000 Colour Difference Formula , 2001 .

[5]  Leonidas J. Guibas,et al.  The Earth Mover's Distance under transformation sets , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[6]  Björn Ommer,et al.  Efficient Clustering Earth Mover's Distance , 2010, ACCV.

[7]  Michael Werman,et al.  A Unified Approach To The Change Of Resolution: Space And Grey Level , 1988, Photonics West - Lasers and Applications in Science and Engineering.

[8]  Michael Werman,et al.  A Unified Approach to the Change of Resolution: Space and Gray-Level , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Julien Rabin,et al.  Wasserstein Barycenter and Its Application to Texture Mixing , 2011, SSVM.

[10]  David Avis,et al.  Ground metric learning , 2011, J. Mach. Learn. Res..

[11]  Leonidas J. Guibas,et al.  Supervised Earth Mover's Distance Learning and Its Computer Vision Applications , 2012, ECCV.

[12]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[13]  Ming Ronnier Luo,et al.  CIE 2000 color difference formula: CIEDE2000 , 2002, Other Conferences.

[14]  Michael Werman,et al.  Bipartite Graph Matching for Points on a Line or a Circle , 1986, J. Algorithms.

[15]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[16]  Haibin Ling,et al.  An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Yann LeCun,et al.  Transformation Invariance in Pattern Recognition - Tangent Distance and Tangent Propagation , 2012, Neural Networks: Tricks of the Trade.

[18]  Nicu Sebe,et al.  A Prototype Learning Framework Using EMD: Application to Complex Scenes Analysis , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Carlo Tomasi,et al.  The Earth Mover’s Distance , 2001 .

[20]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[21]  Michael Werman,et al.  A Linear Time Histogram Metric for Improved SIFT Matching , 2008, ECCV.

[22]  Jianbo Shi,et al.  Discriminative image warping with attribute flow , 2011, CVPR 2011.

[23]  Carlo Tomasi,et al.  Edge, Junction, and Corner Detection Using Color Distributions , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Michael Werman,et al.  Fast and robust Earth Mover's Distances , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[25]  Kai Li,et al.  Image similarity search with compact data structures , 2004, CIKM '04.

[26]  Yann LeCun,et al.  Transformation Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation , 1996, Neural Networks: Tricks of the Trade.

[27]  Helen C. Shen,et al.  Generalized texture representation and metric , 1983, Comput. Vis. Graph. Image Process..

[28]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[29]  Patrice Y. Simard,et al.  Learning Prototype Models for Tangent Distance , 1994, NIPS.

[30]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[31]  Joachim Gudmundsson,et al.  Small Manhattan Networks and Algorithmic Applications for the Earth Mover ’ s Distance , 2007 .

[32]  Azriel Rosenfeld,et al.  A distance metric for multidimensional histograms , 1985, Comput. Vis. Graph. Image Process..

[33]  Charles Elkan,et al.  Using the Triangle Inequality to Accelerate k-Means , 2003, ICML.