In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance based techniques. In particular, the original edit distance based framework is extended so as to account for a new operator to support node merging during the matching process. An analysis of the computational complexity of the proposed solution is presented as well as some experimental results about its application to retrieval by content of color images.
A Graph Edit Distance based on Node Merging / S. BERRETTI; A. DEL BIMBO; P. PALA. - STAMPA. - 3115:(2004), pp. 464-472. (Intervento presentato al convegno Int. Conf. on Image and Video Retrieval tenutosi a Dublin nel July 21-23) [10.1007/978-3-540-27814-6_55].
A Graph Edit Distance based on Node Merging
BERRETTI, STEFANO;DEL BIMBO, ALBERTO;PALA, PIETRO
2004
Abstract
In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance based techniques. In particular, the original edit distance based framework is extended so as to account for a new operator to support node merging during the matching process. An analysis of the computational complexity of the proposed solution is presented as well as some experimental results about its application to retrieval by content of color images.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
