Sciweavers

31 search results - page 1 / 7
» Matching Point Sets with Respect to the Earth Mover's Distan...
Sort
View
ESA
2005
Springer
105views Algorithms» more  ESA 2005»
13 years 10 months ago
Matching Point Sets with Respect to the Earth Mover's Distance
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 6 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
CVPR
2004
IEEE
14 years 6 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
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...
Kristen Grauman, Trevor Darrell
VISUALIZATION
1999
IEEE
13 years 8 months ago
Feature Comparisons of 3-D Vector Fields Using Earth Mover's Distance
ct A method for comparing three-dimensional vector fields constructed from simple critical points is described. This method is a natural extension of the previous work [1] which de...
Rajesh Batra, Lambertus Hesselink
ICPR
2004
IEEE
14 years 5 months ago
Deformable Geometry Model Matching by Topological and Geometric Signatures
In this paper, we present a novel method for efficient 3D model comparison. The method matches highly deformed models by comparing topological and geometric features. First, we pr...
Kwok-Leung Tam, Rynson W. H. Lau, Chong-Wah Ngo