Abstract
Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure introduced in [8]. This generic similarity measure is based on a non-bijective graph matching (like [4] and [2]) so that it is well suited to image recognition. In particular, over/under-segmentation problems can be handled by linking one vertex to a set of vertices. In a second part, we address the problem of computing this measure and we describe two algorithms: a greedy algorithm, that quickly computes sub-optimal solutions, and a reactive Tabu search algorithm, that may improve these solutions. Some experimental results are given.
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.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)
Ambauen, R., Fischer, S., Bunke, H.: Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification. In: IAPR-TC15 Wksp on Graph-based Representation in Pattern Recognition, pp. 95–106 (2003)
Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. In: Springer-Verlag (ed.) Algorithmica, vol. 29, pp. 610–637 (2001)
Boeres, M., Ribeiro, C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 100–113. Springer, Heidelberg (2004)
Bunke, H.: On a relation between graph edit distance and maximum common subgraph. PRL: Pattern Recognition Letters 18 (1997)
Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. In: Proc. Vision Interface 2000, Montreal, pp. 82–88 (2000)
Bunke, H., Jiang, X.: Graph Matching and Similarity. In: Teodorescu, H.-N., Mlynek, D., Kandel, A., Zimmermann, H.-J. (eds.) Intelligent Systems and Interfaces, ch. 1. Kluwer Academic Publishers, Dordrecht (2000)
Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS (LNAI), vol. 2689, pp. 80–95. Springer, Heidelberg (2003)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3), 265–298 (2004)
Dorne, R., Hao, J.: Tabu Search for graph coloring. In: Osman, I.H., et al. (eds.) T-coloring and Set T-colorings, ch. 3. Kluwer Academic Publishers, Dordrecht (1998)
Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 176–187 (2001)
Glover, F.: Tabu search - part I. Journal on Computing, 190–260 (1989)
Hopcroft, J.E., Wong, J.-K.: Linear time algorithm for isomorphism of planar graphs. In: 6th Annu. ACM Symp. theory of Comput., pp. 172–184 (1974)
Kirkpatrick, S., Gelatt, S., Vecchi, M.: Optimisation by simulated annealing. In: Science, vol. 220, pp. 671–680 (1983)
Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, 42–65 (1982)
Petrovic, S., Kendall, G., Yang, Y.: A Tabu Search Approach for Graph-Structured Case Retrieval. In: STAIRS 2002, pp. 55–64 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sorlin, S., Solnon, C. (2005). Reactive Tabu Search for Measuring Graph Similarity. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)