5 search results - page 1 / 1 » Fast Contour Matching Using Approximate Earth Mover's Distan... |
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
ECCV
2006
Springer
14 years 6 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...