Modern visual information retrieval systems support retrieval by visual content also by directly addressing image visual features such as color, texture, shape and spatial relationships. Combining useful representations and similarity models with efficient index structures is a problem that has been largely underestimated. This problem is particularly challenging in the case of retrieval by shape similarity. In this paper we discuss retrieval by shape similarity, using local features and metric indexing. Shape is partitioned into tokens following curvature analysis. Each token is modeled by a set of perceptually salient attributes and two distinct distance functions are used to model token similarity and shape similarity. Shape indexing is obtained by arranging tokens into a M-tree index structure. Examples from a prototype system an expounded with considerations about the effectiveness of the approach.
INDEXED RETRIEVAL BY SHAPE APPEARANCE / S. BERRETTI; A. DEL BIMBO; P. PALA. - STAMPA. - (1999), pp. 301-305. (Intervento presentato al convegno IEE IPA99, INT. CONF. ON IMAGE PROCESSING AND ITS APPLICATIONS tenutosi a MANCHESTER, UK nel July 13-15) [10.1049/cp:19990331].
INDEXED RETRIEVAL BY SHAPE APPEARANCE
BERRETTI, STEFANO;DEL BIMBO, ALBERTO;PALA, PIETRO
1999
Abstract
Modern visual information retrieval systems support retrieval by visual content also by directly addressing image visual features such as color, texture, shape and spatial relationships. Combining useful representations and similarity models with efficient index structures is a problem that has been largely underestimated. This problem is particularly challenging in the case of retrieval by shape similarity. In this paper we discuss retrieval by shape similarity, using local features and metric indexing. Shape is partitioned into tokens following curvature analysis. Each token is modeled by a set of perceptually salient attributes and two distinct distance functions are used to model token similarity and shape similarity. Shape indexing is obtained by arranging tokens into a M-tree index structure. Examples from a prototype system an expounded with considerations about the effectiveness of the approach.File | Dimensione | Formato | |
---|---|---|---|
ipa99.pdf
Accesso chiuso
Descrizione: documento finale
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
414.96 kB
Formato
Adobe PDF
|
414.96 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.