Matching Point Sets with respect to the Earth Mover’s Distance

author: Sergio Cabello, Inštitut za matematiko, fiziko in mehaniko (IMFM)
published: Feb. 25, 2007,   recorded: November 2005,   views: 3813


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


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.

See Also:

Download slides icon Download slides: cov05_cabello_mpsre_01.pdf (154.4 KB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: