A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The earth mover's distance (EMD)  is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(n 3 log n)) computational complexity. We present a novel linear time algorithm for approximating the EMD for low dimensional histograms using the sum of absolute values of the weighted wavelet coefficients of the difference histogram. EMD computation is a special case of the Kantorovich-Rubinstein transshipment problem, and we exploit the Hölder continuitydoi:10.1109/cvpr.2008.4587662 dblp:conf/cvpr/ShirdhonkarJ08 fatcat:67asw6qc3be7tm7w4e3mqhhwvq