An Efficient Distance Between Multi-dimensional Histograms for Comparing Images
The aim of this paper is to present an efficient distance between n-dimensional histograms. Some image classification or image retrieval techniques use the distance between histograms as a first step of the classification process. For this reason, some algorithms that find the distance between histograms have been proposed in the literature. Nevertheless, most of this research has been applied on one-dimensional histograms due to the computation of a distance between multi-dimensional histograms is very expensive. In this paper, we present an efficient method to compare multi-dimensional histograms in O(2z), where z represents the number of bins. Results show a huge reduction of the time consuming with no recognition-ratio reduction.
KeywordsComputational Cost Distance Measure Image Retrieval Transportation Problem Huge Reduction
- 3.Numerical Recipes in C: The Art of Scientific Computing, ISBN 0-521-43108-5Google Scholar