Fast retrieval algorithm for earth mover's distance using EMD lower bounds and a skipping algorithm

Authors:
Masami Shishibori;Daichi Koizumi;Kenji Kita
Affiliations:
Department of Information Solution, Institute of Technology and Science, The University of Tokushima, Tokushima-Shi, Tokushima, Japan;Department of Information Solution, Institute of Technology and Science, The University of Tokushima, Tokushima-Shi, Tokushima, Japan;Center for Advanced Information Technology, The University of Tokushima, Tokushima-Shi, Tokushima, Japan
Venue:
Advances in Multimedia
Year:
2011

Citing 6
Cited 0

Efficient and effective querying by image content

Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Data structures and algorithms for nearest neighbor search in general metric spaces

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Perceptual Metrics for Image Database Navigation

Perceptual Metrics for Image Database Navigation
The Earth Mover''s Distance: Lower Bounds and Invariance under Translation

The Earth Mover''s Distance: Lower Bounds and Invariance under Translation
Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The earth mover's distance (EMD) is a measure of the distance between two distributions, and it has been widely used in multimedia information retrieval systems, in particular, in 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. However, its computations are too expensive to use in large-scale databases. In order to achieve efficient computation of the EMD during query processing, we have developed "fastEMD," 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 performs extensive experiments to demonstrate its efficiency.