Application of multimedia technologies to visual data, like still images and videos, is receiving an increasing attention especially for the large number of potential innovative solutions which are expected to emerge in the next years. In this context, techniques for retrieval by visual similarity are expected to boost the interest of users through the definition of novel paradigms to access digital repositories of visual data. In this paper, we define a novel model for active graph matching and describe its application to content based retrieval of images. The proposed solution fits with the class of edit distance based techniques and supports active node merging during the graph matching process. A theoretical analysis of the computational complexity of the proposed solution is presented and a prototype system is experimented on the images of two sample image collections.

Graph Edit Distance for Active Graph Matching in Content Based Retrieval Applications / S. Berretti; A. Del Bimbo; P. Pala. - In: THE OPEN ARTIFICIAL INTELLIGENCE JOURNAL. - ISSN 1874-0618. - ELETTRONICO. - 1:(2007), pp. 1-11. [10.2174/1874061800701010001]

Graph Edit Distance for Active Graph Matching in Content Based Retrieval Applications

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

Abstract

Application of multimedia technologies to visual data, like still images and videos, is receiving an increasing attention especially for the large number of potential innovative solutions which are expected to emerge in the next years. In this context, techniques for retrieval by visual similarity are expected to boost the interest of users through the definition of novel paradigms to access digital repositories of visual data. In this paper, we define a novel model for active graph matching and describe its application to content based retrieval of images. The proposed solution fits with the class of edit distance based techniques and supports active node merging during the graph matching process. A theoretical analysis of the computational complexity of the proposed solution is presented and a prototype system is experimented on the images of two sample image collections.
2007
1
1
11
S. Berretti; A. Del Bimbo; P. Pala
File in questo prodotto:
File Dimensione Formato  
toaij07.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 361.39 kB
Formato Adobe PDF
361.39 kB Adobe PDF   Richiedi una copia

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/347502
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact