RESEARCH ARTICLE
Graph Edit Distance for Active Graph Matching in Content Based Retrieval Applications
Stefano Berretti*, Alberto Del Bimbo, Pietro Pala
Article Information
Identifiers and Pagination:
Year: 2007Volume: 1
First Page: 1
Last Page: 11
Publisher Id: TOAIJ-1-1
DOI: 10.2174/1874061800701010001
Article History:
Electronic publication date: 13/11/2007Collection year: 2007
open-access license: This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International Public License (CC-BY 4.0), a copy of which is available at: (https://creativecommons.org/licenses/by/4.0/legalcode). This license permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
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.