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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Berretti, S., Del Bimbo, A., & Pala, P. (2004). A Graph Edit Distance Based on Node Merging. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3115, 464–472. https://doi.org/10.1007/978-3-540-27814-6_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
