English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30435
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

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

AuthorsSerratosa, Francesc; Sanroma, Gerard; Sanfeliu, Alberto
KeywordsMulti-dimensional histogram distance
Earth movers distance
Second-order random graphs
Issue Date2007
CitationProgress in Pattern Recognition, Image Analysis and Applications: 115-123 (2007)
AbstractThe 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.
DescriptionPresentado al 12th Iberoamerican Congress on Pattern Recognition (CIARP-2007) celebrado en Valparaiso (Chile).
Publisher version (URL)http://dx.doi.org/10.1007/978-3-540-76725-1_13
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
A new algorithm to compute.pdf138,35 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.