Mostra el registre d'ítem simple
Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces
dc.contributor.author | Ventura Royo, Carles |
dc.contributor.author | Vilaplana Besler, Verónica |
dc.contributor.author | Giró Nieto, Xavier |
dc.contributor.author | Marqués Acosta, Fernando |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions |
dc.date.accessioned | 2013-10-15T09:42:24Z |
dc.date.created | 2013-09 |
dc.date.issued | 2013-09 |
dc.identifier.citation | Ventura, C. [et al.]. Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces. "Multimedia tools and applications", Setembre 2013. |
dc.identifier.issn | 1380-7501 |
dc.identifier.uri | http://hdl.handle.net/2117/20376 |
dc.description.abstract | Abstract Metric Access Methods (MAMs) are indexing techniques which al- low working in generic metric spaces. Therefore, MAMs are specially useful for Content-Based Image Retrieval systems based on features which use non Lp norms as similarity measures. MAMs naturally allow the design of image browsers due to their inherent hierarchical structure. The Hierarchical Cellular Tree (HCT), a MAM-based indexing technique, provides the starting point of our work. In this paper, we describe some limitations detected in the original formulation of the HCT and propose some modi cations to both the index building and the search algorithm. First, the covering radius, which is de ned as the distance from the representative to the furthest element in a node, may not cover all the elements belonging to the node's subtree. Therefore, we pro- pose to rede ne the covering radius as the distance from the representative to the furthest element in the node's subtree. This new de nition is essen- tial to guarantee a correct construction of the HCT. Second, the proposed Progressive Query retrieval scheme can be redesigned to perform the nearest neighbor operation in a more e cient way. We propose a new retrieval scheme which takes advantage of the bene ts of the search algorithm used in the index building. Furthermore, while the evaluation of the HCT in the original work was only subjective, we propose an objective evaluation based on two aspects which are crucial in any approximate search algorithm: the retrieval time and the retrieval accuracy. Finally, we illustrate the usefulness of the proposal by presenting some actual applications. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Processament del senyal::Processament de la imatge i del senyal vídeo |
dc.subject | Àrees temàtiques de la UPC::So, imatge i multimèdia::Creació multimèdia::Vídeo digital |
dc.subject.lcsh | Digital video |
dc.subject.lcsh | Image processing--Digital techniques |
dc.subject.other | Multimedia retrieval |
dc.subject.other | Content-based image retrieval |
dc.subject.other | Indexing techniques |
dc.subject.other | Metric access methods |
dc.subject.other | Hierarchical cellular tree |
dc.title | Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces |
dc.type | Article |
dc.subject.lemac | Vídeo digital |
dc.subject.lemac | Imatges -- Processament -- Tècniques digitals |
dc.contributor.group | Universitat Politècnica de Catalunya. GPI - Grup de Processament d'Imatge i Vídeo |
dc.identifier.doi | 10.1007/s11042-013-1686-3 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://link.springer.com/article/10.1007%2Fs11042-013-1686-3 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 12795745 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Ventura, C.; Vilaplana, V.; Giro, X.; Marques, F. |
local.citation.publicationName | Multimedia tools and applications |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [2.526]
-
Articles de revista [118]