A new algorithm to compute the distance between multi-dimensional histograms

Conference Article


Iberoamerican Congress on Pattern Recognition (CIARP)





Doc link


Download the digital copy of the doc pdf document


Projects associated


The aim of this paper is to present a new algorithm to compute the distance between ndimensional histograms. There are some domains such as pattern recognition or image retrieval that use the distance between histograms at some 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(z2), where z represents the number of bins.


pattern recognition.

Author keywords

multi-dimensional histogram distance, Earth movers distance, second-order random graphs

Scientific reference

F. Serratosa, G. Sanromà and A. Sanfeliu. A new algorithm to compute the distance between multi-dimensional histograms, 12th Iberoamerican Congress on Pattern Recognition, 2007, Valparaiso, Xile, in Progress in Pattern Recognition, Image Analysis and Applications, Vol 4756 of Lecture Notes in Computer Science, pp. 115-123, 2008, Springer Verlag, Berlin, Alemanya.