Matching Point Sets with respect to the Earth Mover’s Distance
Matching Point Sets with respect to the Earth Mover’s Distance
Feb 25, 2007 3857 views 
en-sl
en
en-zh
en-de
en-es
en-fr
en-pt
0.25
0.5
0.75
1.25
1.5
1.75
2
Shape matching is a fundamental problem in computer vision: given two shapes A and B, one wants to determine how closely A resembles B, according to some distance measure between the shapes. In order to measure the similarity of A and B independently of trans- formations such as translations and/or rotations, one wants to find a transformed version of, say, A that attains the minimum possible distance to B.