Results 1  10
of
169
Resolution Urban Satellites Images using Haralick features and SVM with SAM and EMD distance Metrics
"... The classification of remotely sensed images knows a large progress taking into consideration the availability of images with different resolutions as well as the abundance of classification‟s algorithms. Support Vector Machines (SVMs) are a group of supervised classification algorithms that have be ..."
Abstract
 Add to MetaCart
distance (EMD) and a RBF kernel based on the Spectral Angle Mapper (SAM). The proposed approach was tested on common scenes of urban imagery. Results showed, especially with the use of Haralick texture features, that SVMs using RBF kernel based on EMD outperform the SVMs with RBF kernel based on SAM
A metric for distributions with applications to image databases
, 1998
"... We introduce a new distance between two distributions that we call the Earth Mover’s Distance (EMD), which reflects the minimal amount of work that must be performed to transform one distributioninto the other by moving “distribution mass ” around. This is a special case of the transportation proble ..."
Abstract

Cited by 438 (6 self)
 Add to MetaCart
We introduce a new distance between two distributions that we call the Earth Mover’s Distance (EMD), which reflects the minimal amount of work that must be performed to transform one distributioninto the other by moving “distribution mass ” around. This is a special case of the transportation
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 449 (6 self)
 Add to MetaCart
vectors, as well as a simple alternative to minwise independent permutations for estimating set similarity. 2. A collection of distributions on n points in a metric space, with distance between distributions measured by the Earth Mover Distance (EMD), (a popular distance measure in graphics and vision
Differential EMD Tracking
"... Illumination changes cause object appearance to change drastically and many existing tracking algorithms lack the capability to handle this problem. The Earth Mover’s Distance (EMD) is a similarity measure that is more robust against illumination changes. However, EMD is computationally expensive an ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Illumination changes cause object appearance to change drastically and many existing tracking algorithms lack the capability to handle this problem. The Earth Mover’s Distance (EMD) is a similarity measure that is more robust against illumination changes. However, EMD is computationally expensive
ÊMD dT=2, SIFT
"... This document contains additional results for image retrieval that were omitted from the paper “Fast and Robust Earth Mover’s Distances ” [3] due to lack of space. The results are for image retrieval as described in the paper. The results are for all pairs of descriptors and distance measures. Aver ..."
Abstract
 Add to MetaCart
This document contains additional results for image retrieval that were omitted from the paper “Fast and Robust Earth Mover’s Distances ” [3] due to lack of space. The results are for image retrieval as described in the paper. The results are for all pairs of descriptors and distance measures
EMD based Visual Similarity for Detection
"... Phishing has become a severe problem in the Internet society. We propose an effective phishing webpage detection approach using EMD (Earth Mover’s Distance) based visual similarity of webpages. Both suspected webpage and protected webpage are first preprocessed into low resolution images respectivel ..."
Abstract
 Add to MetaCart
Phishing has become a severe problem in the Internet society. We propose an effective phishing webpage detection approach using EMD (Earth Mover’s Distance) based visual similarity of webpages. Both suspected webpage and protected webpage are first preprocessed into low resolution images
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
An efficient earth mover’s distance algorithm for robust histogram comparison
 PAMI
, 2007
"... DRAFT We propose EMDL1: a fast and exact algorithm for computing the Earth Mover’s Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMDL1 significantly s ..."
Abstract

Cited by 96 (5 self)
 Add to MetaCart
DRAFT We propose EMDL1: a fast and exact algorithm for computing the Earth Mover’s Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMDL1 significantly
ABSTRACT COMPRESSIVE PARAMETER ESTIMATION WITH EMD
, 2014
"... In recent years, sparsity and compressive sensing have attracted significant attention in parameter estimation tasks, including frequency estimation, delay estimation, and localization. Parametric dictionaries collect signals for a sampling of the parameter space and can yield sparse representatio ..."
Abstract
 Add to MetaCart
algorithm based on optimal sparse approximation measured by earth mover’s distance (EMD). Theoretically, we show that EMD provides a better metric for the performance of parametric dictionarybased parameter estimation and Kmedian clustering algorithms has the potential iii
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 flownetwork of the EMD so that the number of edges is reduced by an order of magnitude. As a result, we compute the EMD by an order of magnitude faster tha ..."
Abstract

Cited by 90 (6 self)
 Add to MetaCart
We present a new algorithm for a robust family of Earth Mover’s Distances EMDs with thresholded ground distances. The algorithm transforms the flownetwork of the EMD so that the number of edges is reduced by an order of magnitude. As a result, we compute the EMD by an order of magnitude faster
Results 1  10
of
169