Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/30419
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Serratosa, Francesc | - |
dc.contributor.author | Sanfeliu, Alberto | - |
dc.date.accessioned | 2010-12-17T08:08:55Z | - |
dc.date.available | 2010-12-17T08:08:55Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Structural, Syntactic, and Statistical Pattern Recognition: 394-402 (2006) | - |
dc.identifier.isbn | 978-3-540-37236-3 | - |
dc.identifier.uri | http://hdl.handle.net/10261/30419 | - |
dc.description | Presentado al 11th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR/2006) celebrado en Hong Kong (China). | - |
dc.description.abstract | The 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. | - |
dc.language.iso | eng | - |
dc.publisher | Springer Nature | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science 4109 | - |
dc.rights | openAccess | - |
dc.subject | Pattern recognition | - |
dc.subject | Pattern recognition systems | - |
dc.title | A fast and exact modulo-distance between histograms | - |
dc.type | comunicación de congreso | - |
dc.identifier.doi | 10.1007/11815921_43 | - |
dc.description.peerreviewed | Peer Reviewed | - |
dc.relation.publisherversion | http://dx.doi.org/10.1007/11815921_43 | - |
dc.type.coar | http://purl.org/coar/resource_type/c_5794 | es_ES |
item.openairetype | comunicación de congreso | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | en | - |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
Aparece en las colecciones: | (IRII) Libros y partes de libros |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
fast and exact modulo.pdf | 210,41 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
304
checked on 27-mar-2024
Download(s)
238
checked on 27-mar-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.