English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30419
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 fast and exact modulo-distance between histograms

AuthorsSerratosa, Francesc; Sanfeliu, Alberto
KeywordsPattern recognition
Pattern recognition systems
Issue Date2006
CitationStructural, Syntactic, and Statistical Pattern Recognition: 394-402 (2006)
SeriesLecture Notes in Computer Science 4109
AbstractThe aim of this paper is to present a new method to compare modulo histograms. In these histograms, the type of elements are cyclic, for instance, the hue in colour images. The main advantage is that there is an important time-complexity reduction respect the methods presented before. The distance between histograms that we present is defined on a structure called signature, which is a lossless representation of histograms. We show that the computational cost of our distance is O(z'2), being z' the number of non-empty bins of the histograms. The computational cost of the algorithms presented in the literature depends on the number of bins of the histograms. In most of the applications, the obtained histograms are sparse, then considering only the non-empty bins makes the time consuming of the comparison drastically decrease. The distance and algorithms presented in this paper are experimentally validated on the comparison of images obtained from public databases.
DescriptionPresentado al 11th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR/2006) celebrado en Hong Kong (China).
Publisher version (URL)http://dx.doi.org/10.1007/11815921_43
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
fast and exact modulo.pdf210,41 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.