Tell me more ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.
up vote 6 down vote favorite

Has anyone implemented in MMA the Earth Mover's Distance (EMD)? A concept dating back to Monge 1871, used to compare histograms and images, e.g., the CIEDE2000 Color Difference algorithm. Yossi Rubner's C implementation can be found here:

Computation of EMD is more involved than Euclidean metric. EMD is a linear constrained optimization problem, and so can be handled presumably via MMA's Linear Programming functionality. Although there's typically additional normalization stage, e.g.. found here.

share|improve this question
Couldn't you just link to the compiled code you refer to? – Sjoerd C. de Vries Apr 4 '12 at 21:15
1  
A related demonstration at Monge-Kantorovich Problem – kguler Apr 4 '12 at 21:58
@SCdeV, 2many papers 2read. There's the Wavelet dual EMD approximation, there's Quadratic Chi metrics, there's a whole book called Dictionary of Distances. And then there's the ultrametric paradise, in sparse data regimes where all triangles are isoceles w/ small base. – alancalvitti Apr 5 '12 at 18:14
If you mangle my name the @-calling mechanism won't notify me. I just happened to chance by now. My remark was not about reading stuff but about linking to the C code. – Sjoerd C. de Vries Apr 7 '12 at 6:28
@Sjoerd, my bad on name mangling... the .h and .c code are linked in my original question. ?? – alancalvitti Apr 11 '12 at 2:38
show 2 more comments

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.