A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters - Tập 19 - Trang 255-259 - 1998
Horst Bunke1, Kim Shearer2
1Institut für Informatik und Angewandte Mathematik, University of Bern, Bern, Switzerland
2Department of Computer Science, Curtin University of Technology, Perth, WA, Australia

Tài liệu tham khảo

Bunke, 1997, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Lett., 18, 689, 10.1016/S0167-8655(97)00060-3 Bunke, 1997, Recent advances in graph matching, Internat. J. Pattern Recognition Artif. Intell., 11, 169, 10.1142/S0218001497000081 Chang, 1987, Iconic indexing by 2D strings, IEEE Trans. Pattern Anal. Machine Intell., 9, 413, 10.1109/TPAMI.1987.4767923 Cho, 1992, Recognizing 3-D objects by forward checking constrained tree search, Pattern Recognition Lett., 13, 587, 10.1016/0167-8655(92)90094-G Christmas, 1995, Structural matching in computer vision using probabilistic relaxation, IEEE Trans. Pattern Anal. Machine Intell., 17, 749, 10.1109/34.400565 Cordella, L., Foggia, P., Sansone, C., Vento, M., 1997. Subgraph transformations for the inexact matching of attributed relational graphs. In: Jolion, J.-M., Kropatsch, W. (Eds.), Preproceeding GbR'97: IAPR Workshop on Graph Based Representations, Lyon. Horaud, 1989, Stereo correspondence through feature grouping and maximal cliques, IEEE Trans. Pattern Anal. Machine Intell., 11, 1168, 10.1109/34.42855 Lee, 1992, Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation, Pattern Recognition, 25, 305, 10.1016/0031-3203(92)90112-V Lee, 1990, Translation-, rotation-, and scale invariant recognition of hand-drawn symbols in schematic diagrams, Internat. J. Pattern Recognition Artif. Intell., 4, 1, 10.1142/S0218001490000022 Levi, 1972, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcols, 9, 341, 10.1007/BF02575586 Levinson, 1992, Pattern associativity and the retrieval of semantic networks, Comput. Math. Appl., 23, 573, 10.1016/0898-1221(92)90125-2 Lu, 1991, Hierarchical attributed graph representation and recognition of handwritten Chinese characters, Pattern Recognition, 24, 617, 10.1016/0031-3203(91)90029-5 McGregor, 1982, Backtrack search algorithms and the maximal common subgraph problem, Software Practice and Experience, 12, 23, 10.1002/spe.4380120103 Messmer, B., Bunke, H., 1996. Automatic learning and recognition of graphical symbols in engineering drawing. In: Kasturi, R., Tombre, K. (Eds.), Graphics Recognition, Lecture Notes in Computer Science, vol. 1072. Springer, Berlin, 1996, pp. 123–134. Pearce, 1994, Rulegraphs for graph matching in pattern recognition, Pattern Recognition, 27, 1231, 10.1016/0031-3203(94)90007-8 Read, 1977, The graph isomorphism disease, J. Graph Theory, 1, 339, 10.1002/jgt.3190010410 Shapiro, 1981, Structural descriptions and inexact matching, IEEE Trans. Pattern Anal. Machine Intell., 3, 504, 10.1109/TPAMI.1981.4767144 Shearer, K., Bunke, H., Venkatesh, S., Kieronska, D., 1997. Efficient graph matching for video indexing. In: Jolion, J.-M., Kropatsch, W. (Eds.), Preproceeding GbR'97: IAPR Workshop on Graph based Representations, Lyon. Ullman, 1976, An algorithm for subgraph isomorphism, J. ACM, 23, 31, 10.1145/321921.321925 Wong, 1992, Model matching in robot vision by subgraph isomorphism, Pattern Recognition, 25, 287, 10.1016/0031-3203(92)90111-U