Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces
Visualitza/Obre
Preprint (1,970Mb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/20376
Tipus de documentArticle
Data publicació2013-09
Condicions d'accésAccés restringit per política de l'editorial
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
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.
CitacióVentura, C. [et al.]. Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces. "Multimedia tools and applications", Setembre 2013.
ISSN1380-7501
Versió de l'editorhttp://link.springer.com/article/10.1007%2Fs11042-013-1686-3
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1574.pdf | Preprint | 1,970Mb | Accés restringit |