By Topic

A fast retrieval algorithm for the earth mover's distance using EMD lower bounds and the priority queue

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Masami Shishibori ; The University of Tokushima, Tokushima, Japan ; Daichi Koizumi ; Kenji Kita

Earth mover's distance (EMD) is a distance measure between two distributions, and has been widely used in multimedia information retrieval systems, especially content-based image retrieval systems. When the EMD is applied to image problems based on color or texture, the EMD reflects the human perceptual similarities. Its computations, however, is too expensive to use in large-scale databases. In order to achieve the efficient computation of the EMD during query processing, we have developed ldquofastEMDrdquo, a library for high-speed feature-based similarity retrievals in large databases. This paper introduces techniques that are used in the implementation of the fastEMD and demonstrates the efficiency in extensive experiments.

Published in:

Natural Language Processing and Knowledge Engineering, 2009. NLP-KE 2009. International Conference on

Date of Conference:

24-27 Sept. 2009