OpenCV Q&A Forum - RSS feedhttp://answers.opencv.org/questions/OpenCV answersenCopyright <a href="http://www.opencv.org">OpenCV foundation</a>, 2012-2018.Wed, 24 May 2017 23:31:13 -0500How is the EMDL1() function different from EMD() function in OpenCV?http://answers.opencv.org/question/151206/how-is-the-emdl1-function-different-from-emd-function-in-opencv/ What is the difference between EMDL1() and EMD() function in OpenCV? What does 'L1' signify? Please provide suggestions.Wed, 24 May 2017 05:16:03 -0500http://answers.opencv.org/question/151206/how-is-the-emdl1-function-different-from-emd-function-in-opencv/Answer by LBerger for <p>What is the difference between EMDL1() and EMD() function in OpenCV? What does 'L1' signify? Please provide suggestions.</p>
http://answers.opencv.org/question/151206/how-is-the-emdl1-function-different-from-emd-function-in-opencv/?answer=151240#post-id-151240Have you read reference ?
[> Computes the "minimal work" distance
> between two weighted point
> configurations base on the papers
> "EMD-L1: An efficient and Robust
> Algorithm for comparing
> histogram-based descriptors", by
> Haibin Ling and Kazunori Okuda; and
> "The Earth Mover's Distance is the
> Mallows Distance: Some Insights from
> Statistics", by Elizaveta Levina and
> Peter Bickel.](http://docs.opencv.org/master/d1/d85/group__shape.html#gacb101cb63eb94a4a6a61d60e487b18e6)
Abstract.
We propose a fast algorithm, EMD-
L
1
, for computing the
Earth Mover’s Distance (EMD) between a pair of histograms. Compared
to the original formulation, EMD-
L
1
has a largely simplified structure.
The number of unknown variables in EMD-
L
1
is
O
(
N
) that is signifi-
cantly less than
O
(
N
2
) of the original EMD for a histogram with
N
bins ....Wed, 24 May 2017 08:19:17 -0500http://answers.opencv.org/question/151206/how-is-the-emdl1-function-different-from-emd-function-in-opencv/?answer=151240#post-id-151240Comment by lohachan0108 for <p>Have you read reference ?</p>
<p>[> Computes the "minimal work" distance</p>
<blockquote>
<p>between two weighted point
configurations base on the papers
"EMD-L1: An efficient and Robust
Algorithm for comparing
histogram-based descriptors", by
Haibin Ling and Kazunori Okuda; and
"The Earth Mover's Distance is the
Mallows Distance: Some Insights from
Statistics", by Elizaveta Levina and
Peter Bickel.](http://docs.opencv.org/master/d1/d85/group__shape.html#gacb101cb63eb94a4a6a61d60e487b18e6)</p>
</blockquote>
<p>Abstract.
We propose a fast algorithm, EMD-
L
1
, for computing the
Earth Mover’s Distance (EMD) between a pair of histograms. Compared
to the original formulation, EMD-
L
1
has a largely simplified structure.
The number of unknown variables in EMD-
L
1
is
O
(
N
) that is signifi-
cantly less than
O
(
N
2
) of the original EMD for a histogram with
N
bins ....</p>
http://answers.opencv.org/question/151206/how-is-the-emdl1-function-different-from-emd-function-in-opencv/?comment=151611#post-id-151611Thanks for the explanation. It was really helpful.Wed, 24 May 2017 23:31:13 -0500http://answers.opencv.org/question/151206/how-is-the-emdl1-function-different-from-emd-function-in-opencv/?comment=151611#post-id-151611