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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bunke, H.: Recent Developments in Graph Matching. In: Proc. 15th Int. Conference on Pattern Recognition, Barcelona, Spain, September 3-7, vol. 2, pp. 117–124 (2000)
Ullman, J.: An Algorithm for Subgraph Isomorphism. Journal of the ACM 23(1), 31–42 (1976)
Ambauen, R., Fischer, S., Bunke, H.: Graph Edit Distance with Node Splitting and Merging and its Application to Diatom Identification. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 95–106. Springer, Heidelberg (2003)
Bunke, H.: Error-correcting Graph Isomorphism Using Decision Tree. Int. Journal of Pattern Recognition and Artificial Intelligence 12, 721–742 (1998)
Massaro, A., Pelillo, M.: Matching graphs by pivoting. Pattern Recognition Letters 24(8), 1099–1106 (2003)
Hlaoui, A., Wang, S.: A New Algorithm for Inexact Graph Matching. In: Proc. 16th International Conference on Pattern Recognition, Quebec City, Canada, August 11-15, vol. 2, pp. 465–468 (2002)
Tsai, W.H., Fu, K.S.: Error-Correcting Isomorphism of Attributed Relational Graphs for Pattern Analysis. IEEE Trans. on Systems, Man, and Cybernetics 9(12) (December 1979)
Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. on Pattern Analysis and Machine Intelligence 20(5), 493–504 (1998)
Cesar, R., Bengoetxea, E., Bloch, I.: Inexact Graph Matching Using Stochastic Optimization Techniques for Facial Feature Recognition. In: Proc. 16th International Conference on Pattern Recognition, Quebec City, Canada, August 11-15, vol. 2, pp. 465–468 (2002)
Gomila, C., Meyer, F.: Tracking Objects by Graph Matching of Image Partition Sequences. In: Proc. of Int. Workshop of Graph based Representation for Pattern Recognition (GbRPR 2001), pp. 1–11 (2001)
Gregory, L., Kittler, J.: Using Graph Search Techniques for Contextual Colour Retrieval. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 186–194. Springer, Heidelberg (2002)
Del Bimbo, A., Mugnaini, M., Pala, P., Turco, F.: Visual Querying by Color Perceptive Regions. Pattern Recognition 31(9), 1241–1253 (1998)
Das, M., Riseman, E.M., Draper, B.A.: FOCUS: Searching for multi-colored objects in a diverse image database. In: Proc. of IEEE Int. Conf. on ComputerVision and Pattern Recognition (CVPR 1997), June 17-19, pp. 756–761 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berretti, S., Del Bimbo, A., Pala, P. (2004). A Graph Edit Distance Based on Node Merging. In: Enser, P., Kompatsiaris, Y., O’Connor, N.E., Smeaton, A.F., Smeulders, A.W.M. (eds) Image and Video Retrieval. CIVR 2004. Lecture Notes in Computer Science, vol 3115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27814-6_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-27814-6_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22539-3
Online ISBN: 978-3-540-27814-6
eBook Packages: Springer Book Archive