Sciweavers

48 search results - page 1 / 10
» Earth mover distance over high-dimensional spaces
Sort
View
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
MST
2011
205views Hardware» more  MST 2011»
12 years 11 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
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
ICMCS
2006
IEEE
250views Multimedia» more  ICMCS 2006»
13 years 10 months ago
Adaptive Video News Story Tracking based on Earth Mover'S Distance
This paper proposes an adaptive system for video news story tracking based on the Earth Mover’s Distance (EMD). When an interesting story appears in the news, it is flagged man...
Mats Uddenfeldt, Keiichiro Hoashi, Kazunori Matsum...
PVLDB
2010
252views more  PVLDB 2010»
12 years 11 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu