Sciweavers

372 search results - page 2 / 75
» The box mover problem
Sort
View
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 7 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
ICCV
2005
IEEE
13 years 12 months ago
Common Pattern Discovery Using Earth Mover's Distance and Local Flow Maximization
In this paper, we present a novel segmentationinsensitive approach for mining common patterns from 2 images. We develop an algorithm using the Earth Movers Distance (EMD) framewor...
Hung-Khoon Tan, Chong-Wah Ngo
CVPR
2011
IEEE
12 years 10 months ago
Earth Mover’s Prototypes: a Convex Learning Approach for Discovering Activity Patterns in Dynamic Scenes
We present a novel approach for automatically discovering spatio-temporal patterns in complex dynamic scenes. Similarly to recent non-object centric methods, we use low level visu...
Elisa Ricci, Gloria Zen
PVLDB
2010
252views more  PVLDB 2010»
13 years 1 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
CVPR
2008
IEEE
14 years 8 months ago
Approximate earth mover's distance in linear time
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...
Sameer Shirdhonkar, David W. Jacobs