Sergio Cabello, Panos Giannopoulos, Christian Knauer, and
Matching point sets with respect to the earth mover's distance
- In: Abstracts of the 21st European Workshop on Computational
Eindhoven, March 2005, pp. 57-60.
- In: "Algorithms - ESA 2005", Proc. Thirteenth Annual European
Algorithms, Palma de Mallorca, 2005. Editors: Gerth Stolting Brodal and
Leonardi. Lecture Notes in Computer Science 3669, Springer-Verlag,
pp. 520-531. doi:10.1007/11561071_47
- Computational Geometry,
Theory and Applications 39 (2008), pp. 118-133. doi:10.1016/j.comgeo.2006.10.001
The Earth Mover's Distance (EMD) between two weighted point sets (point
distributions) is a distance measure commonly used in computer vision
color-based image retrieval and shape matching. It measures the minimum
amount of work needed to transform one set into the other one by weight
transportation. We study the following shape matching problem: Given
weighted point sets A and B in the plane, compute a
motion of A that minimizes its Earth Mover's Distance to B.
algorithm is known that computes an exact solution to this problem. We
present simple FPTASs and polynomial-time (2+ε)-approximation
algorithms for the minimum Euclidean EMD between A and B
translations and rigid motions.
Last update: November 15, 2007.