Please use this identifier to cite or link to this item:
http://hdl.handle.net/10261/30435
Share/Export:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Title: | A new algorithm to compute the distance between multi-dimensional histograms |
Authors: | Serratosa, Francesc; Sanroma, Gerard; Sanfeliu, Alberto CSIC ORCID | Keywords: | Multi-dimensional histogram distance Earth movers distance Second-order random graphs |
Issue Date: | 2007 | Publisher: | Springer Nature | Citation: | Progress in Pattern Recognition, Image Analysis and Applications: 115-123 (2007) | Abstract: | 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. | Description: | Presentado 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 | URI: | http://hdl.handle.net/10261/30435 | DOI: | 10.1007/978-3-540-76725-1_13 | ISBN: | 978-3-540-76724-4 |
Appears in Collections: | (IRII) Libros y partes de libros |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A new algorithm to compute.pdf | 138,35 kB | Adobe PDF | View/Open |
CORE Recommender
Page view(s)
319
checked on Apr 19, 2024
Download(s)
666
checked on Apr 19, 2024
Google ScholarTM
Check
Altmetric
Altmetric
WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.