An Efficient Earth Mover´s Distance Algorithm for Robust Histogram Comparison

We propose EMD-L₁: a fast and exact algorithm for computing the earth mover´s distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMD-L₁ significantly simplifies the original linear programming formulation of EMD. Exploiting the L₁ metric structure, the number of unknown variables in EMD-L₁ is reduced to O(N) from O(N²) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function of the linear program is simplified. Formally, without any approximation, we prove that the EMD-L₁ formulation is equivalent to the original EMD with a L₁ ground distance. To perform the EMD-L₁ computation, we propose an efficient tree-based algorithm, Tree-EMD. Tree-EMD exploits the fact that a basic feasible solution of the simplex algorithm-based solver forms a spanning tree when we interpret EMD-L₁ as a network flow optimization problem. We empirically show that this new algorithm has an average time complexity of O(N²), which significantly improves the best reported supercubic complexity of the original EMD. The accuracy of the proposed methods is evaluated by experiments for two computation-intensive problems: shape recognition and interest point matching using multidimensional histogram-based local features. For shape recognition, EMD-L₁ is applied to compare shape contexts on the widely tested MPEG7 shape data set, as well as an articulated shape data set. For interest point matching, SIFT, shape context and spin image are tested on both synthetic and real image pairs with large geometrical deformation, illumination change, and heavy intensity noise. The results demonstrate that our EMD-L₁-based solutions outperform previously reported state- - -of-the-art features and distance measures in solving the two tasks