Sciweavers

58 search results - page 2 / 12
» Sublinear Time Algorithms for Earth Mover's Distance
Sort
View
ICPR
2008
IEEE
14 years 6 months ago
Circular Earth Mover's Distance for the comparison of local features
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...
Julie Delon, Julien Rabin, Yann Gousseau
ICMCS
2006
IEEE
250views Multimedia» more  ICMCS 2006»
13 years 11 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...
ICCV
2009
IEEE
14 years 9 months ago
Fast and Robust Earth Mover's Distances
We present a new algorithm for a robust family of Earth Mover’s Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that t...
Ofir Pele , Michael Werman
CVPR
2009
IEEE
13 years 8 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum
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