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.
CitationSerratosa, Francesc; Sanroma, G.; Sanfeliu, Alberto. "A new algorithm to compute the distance between multi-dimensional histograms ". 12th Iberoamerican Congress on Pattern Recognition (CIARP), Valparaiso, Xile, 2007. A: Lecture Notes in Computer Science, vol. 4756. Berlin, Alemanya: Springer Verlag, 2008, p. 115 - 123.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com