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

Authors:
Francesc Serratosa;Gerard Sanromà;Alberto Sanfeliu
Affiliations:
Universitat Rovira i Virgili, Spain;Universitat Rovira i Virgili, Spain;Universitat Politècnica de Catalunya, Spain
Venue:
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Year:
2007

Citing 7
Cited 0

Color indexing

International Journal of Computer Vision
The Earth Mover's Distance as a Metric for Image Retrieval

International Journal of Computer Vision
Efficient matching of large-size histograms

Pattern Recognition Letters
Signatures versus histograms: Definitions, distances and algorithms

Pattern Recognition
An efficient distance between multi-dimensional histograms for comparing images

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Multi-dimensional color histograms for segmentation of wounds in images

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Support vector machines for histogram-based image classification

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to present a new algorithm to compute the distance between n-dimensional 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.