Results 1  10
of
291
EARTH MOVER DISTANCE ON SUPERPIXELS
"... Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problems of image processing. This success comes from two reasons, a physical one, since it computes a physical cost to transpor ..."
Abstract
 Add to MetaCart
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problems of image processing. This success comes from two reasons, a physical one, since it computes a physical cost
Sparse Recovery for Earth Mover Distance
, 2010
"... We initiate the study of sparse recovery problems under the EarthMover Distance (EMD). Specifically, we design a distribution over m × n matrices A, for m ≪ n, such that for any x, given Ax, we can recover a ksparse approximation to x under the EMD distance. We also provide an empirical evaluation ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We initiate the study of sparse recovery problems under the EarthMover Distance (EMD). Specifically, we design a distribution over m × n matrices A, for m ≪ n, such that for any x, given Ax, we can recover a ksparse approximation to x under the EMD distance. We also provide an empirical
Sketching EarthMover Distance on Graph Metrics ⋆
"... Abstract. We develop linear sketches for estimating the EarthMover distance between two point sets, i.e., the cost of the minimum weight matching between the points according to some metric. While Euclidean distance and Edit distance are natural measures for vectors and strings respectively, Earth ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We develop linear sketches for estimating the EarthMover distance between two point sets, i.e., the cost of the minimum weight matching between the points according to some metric. While Euclidean distance and Edit distance are natural measures for vectors and strings respectively, EarthMover
Efficient sketches for earthmover distance, with applications
 in FOCS
, 2009
"... Abstract — We provide the first sublinear sketching algorithm for estimating the planar EarthMover Distance with a constant approximation. For sets living in the twodimensional grid [∆] 2, we achieve space ∆ ɛ for approximation O(1/ɛ), for any desired 0 < ɛ < 1. Our sketch has immediate app ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
Abstract — We provide the first sublinear sketching algorithm for estimating the planar EarthMover Distance with a constant approximation. For sets living in the twodimensional grid [∆] 2, we achieve space ∆ ɛ for approximation O(1/ɛ), for any desired 0 < ɛ < 1. Our sketch has immediate
Earth Mover Distance over HighDimensional Spaces
, 2007
"... The Earth Mover Distance (EMD) between two equalsize sets of points in R d is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metric for comparing sets of features, and as such, it has received significant interest in computer vision. Motivated by re ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
The Earth Mover Distance (EMD) between two equalsize sets of points in R d is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metric for comparing sets of features, and as such, it has received significant interest in computer vision. Motivated
Improved Approximation Algorithms for EarthMover Distance in Data Streams
, 2014
"... For two multisets S and T of points in [∆]2, such that S  = T  = n, the earthmover distance (EMD) between S and T is the minimum cost of a perfect bipartite matching with edges between points in S and T, i.e., EMD(S, T) = minpi:S→T a∈S a−pi(a)1, where pi ranges over all onetoone mappin ..."
Abstract
 Add to MetaCart
For two multisets S and T of points in [∆]2, such that S  = T  = n, the earthmover distance (EMD) between S and T is the minimum cost of a perfect bipartite matching with edges between points in S and T, i.e., EMD(S, T) = minpi:S→T a∈S a−pi(a)1, where pi ranges over all one
Budget ErrorCorrecting under EarthMover Distance. Research report
, 2013
"... Abstract. We study the following budget errorcorrecting problem: Alice has a point set x and Bob has a point set y in the ddimensional grid. Alice wants to send a short message to Bob so that Bob can use this information to adjust his point set y towards x to minimize the EarthMover Distance betw ..."
Abstract
 Add to MetaCart
Abstract. We study the following budget errorcorrecting problem: Alice has a point set x and Bob has a point set y in the ddimensional grid. Alice wants to send a short message to Bob so that Bob can use this information to adjust his point set y towards x to minimize the EarthMover Distance
KNearest Neighbour and Earth Mover Distance for Raaga Recognition
"... As far as the Raaga Recognition process, most probably the significant and straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier. The classification is achieved by identifying the nearest neighbours to a query example and using those neighbours ..."
Abstract
 Add to MetaCart
focusing on; mechanisms for finding distance between neighbours using Cosine Distance (CD), Earth Movers Distance (EMD) and formulas are used to identify nearest neighbours, algorithm for classification in training and testing for identifying raagas. From the results it is concluded that Earth Movers
The Constrained Earth Mover Distance Model, with Applications to Compressive Sensing
"... Sparse signal representations have emerged as powerful tools in signal processing theory and applications, and serve as the basis of the nowpopular field of compressive sensing (CS). However, several practical signal ensembles exhibit additional, richer structure beyond mere sparsity. Our particul ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
, and biological imaging. Our contributions are threefold: (i) We propose a simple, deterministic model based on the Earth Mover Distance that effectively captures the structure of the sparse nonzeros of signals belonging to such classes. (ii) We formulate an approach for approximating any arbitrary signal by a
Spaceefficient approximation scheme for circular earth mover distance
 In LATIN
, 2012
"... Abstract. The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer visi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer
Results 1  10
of
291