Modern visual information retrieval systems support retrieval by directly addressing image visual features such as color, texture, shape and spatial relationships. However, combining useful representations and similarity models with effcient 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 in correspondence with its protrusions, and each token is modeled by a set of perceptually salient attributes. 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 are expounded with considerations about the effectiveness of the approach.

EFFICIENT SHAPE RETRIEVAL BY PARTS / S. BERRETTI; A. DEL BIMBO; P. PALA. - STAMPA. - 1689:(1999), pp. 57-64. (Intervento presentato al convegno CAIP99, INT. CONF. ON COMPUTER ANALYSIS OF IMAGES AND PATTERNS tenutosi a LUBIANA, Slovenia nel September 1-3) [10.1007/3-540-48375-6_8].

EFFICIENT SHAPE RETRIEVAL BY PARTS

BERRETTI, STEFANO;DEL BIMBO, ALBERTO;PALA, PIETRO
1999

Abstract

Modern visual information retrieval systems support retrieval by directly addressing image visual features such as color, texture, shape and spatial relationships. However, combining useful representations and similarity models with effcient 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 in correspondence with its protrusions, and each token is modeled by a set of perceptually salient attributes. 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 are expounded with considerations about the effectiveness of the approach.
1999
Proceeding CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
CAIP99, INT. CONF. ON COMPUTER ANALYSIS OF IMAGES AND PATTERNS
LUBIANA, Slovenia
September 1-3
S. BERRETTI; A. DEL BIMBO; P. PALA
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/3502
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 1
social impact