Image retrieval by spatial arrangement underlies a matching problem for the interpretation of entities specified in the user query on the entities appearing in the image of the database, and for the joint comparison of their features and spatial relationships. In this paper, we provide a graph-theoretical formulation of the problem and discuss its implication on indexing and matching. We first identify an indexing scheme which may fit the characteristics of the problem, and then expound and evaluate an efficient graph matching technique which makes this indexing approach viable.
THE COMPUTATIONAL ASPECT OF RETRIEVAL BY SPATIAL ARRANGEMENT / S. BERRETTI; A. DEL BIMBO; E. VICARIO. - STAMPA. - 1:(2000), pp. 1047-1051. (Intervento presentato al convegno ICPR00, INT. CONF. ON COMPUTER VISION AND PATTERN RECOGNITION tenutosi a BARCELONA, Spain nel September 3-8) [10.1109/ICPR.2000.905651].
THE COMPUTATIONAL ASPECT OF RETRIEVAL BY SPATIAL ARRANGEMENT
BERRETTI, STEFANO;DEL BIMBO, ALBERTO;VICARIO, ENRICO
2000
Abstract
Image retrieval by spatial arrangement underlies a matching problem for the interpretation of entities specified in the user query on the entities appearing in the image of the database, and for the joint comparison of their features and spatial relationships. In this paper, we provide a graph-theoretical formulation of the problem and discuss its implication on indexing and matching. We first identify an indexing scheme which may fit the characteristics of the problem, and then expound and evaluate an efficient graph matching technique which makes this indexing approach viable.
| File | Dimensione | Formato | |
|---|---|---|---|
|
icpr00.pdf
Accesso chiuso
Descrizione: documento finale
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
536.66 kB
Formato
Adobe PDF
|
536.66 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
