Abstract
This paper presents an algorithm for the computation of the maximum common subgraph (MCS) between two directed, acyclic graphs with attributes. The core of the contribution resides in the modularity of the proposed algorithm which allows different heuristic techniques to be plugged in, depending on the application domain. Implemented heuristics for robust graph matching with respect to graph structural noise are discussed.
As example of its effectiveness, the algorithm is applied to the problem of 3D shape similarity evaluation through structural shape descriptors.
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
Demirci, M.F., Shokoufandeh, A., Dickinson, S., Keselman, Y., Bretzner, L.: Many-to-many feature matching using spherical codng of directed graphs. In: Proceedings of the European Conference on Computer Vision, Prague (2004)
Messmer, B.T., Bunke, H.: A new algorithm for error tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 493–504 (1998)
Conte, D., Guidobaldi, C., Sansone, C.: A comparison of three maximum common subgraph algorithms on a large database of labeled graphs. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726. Springer, Heidelberg (2003)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 1367–1372 (2004)
Biasotti, S., Marini, S.: 3D object comparison based on shape descriptors. International. Journal of Computer Applications in Technology (to be published)
Biasotti, S., Marini, S.: 3D object comparison based on shape descriptors. Technical Report 17/04, Istituto di Matematica Applicata e Tecnologie Informatiche, Consiglio Nazionale delle Ricerche, Genova (2004)
Biasotti, S., Marini, S., Mortara, M., Patané, G., Spagnuolo, M., Falcidieno, B.: 3D shape matching through topological structures. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 194–203. Springer, Heidelberg (2003)
Marini, S.: Methods for common subgraph approximation. Technical Report 23/2004, Istituto di Matematica Applicata e Tecnologie Informatiche, Consiglio Nazionale delle Ricerche, Genova (2004)
Shokoufandeh, A., Dickinson, S.: A unified framework for indexing and matching hierarchical shape structures. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol. 2059, p. 67. Springer, Heidelberg (2001)
Hilaga, M., Shinagawa, Y., Komura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: ACM Computer Graphics (Proc. of SIGGRAPH 2001), Los Angeles, pp. 203–212. ACM Press, New York (2001)
Kazdan, M., Funkhouser, T., Rusinkiewicz, S.: Rotation invariant spherical harmonic representation of 3D shape descriptors. In: Kobbelt, L., Schröder, P., Hoppe, H. (eds.) Proceedings of Symposium in Geometric Processing, Aachen, Germany, pp. 156–165 (2003)
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
Marini, S., Spagnuolo, M., Falcidieno, B. (2005). From Exact to Approximate Maximum Common Subgraph. 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_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_25
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)