Abstract
Graphs have been successfully used in many disciplines of science and engineering. In the field of pattern recognition and image analysis, graph matching has proven to be a powerful tool. In this paper we generalize various matching tasks from graphs to the case of hypergraphs. We also discuss related algorithms for hypergraph matching.
Chapter PDF
Similar content being viewed by others
References
Llados, J., Marti, E., Villanueva, J.: Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 23-10, 1137–1143 (2001)
Luo, B., Hancock, E.: Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence 23-10, 1120–1136 (2001)
Marcialis, G., Roli, F., Serrau, A.: Fusion of statistical and structural fingerprint classifiers. In: Kittler, J., Nixon, M.S. (eds.) AVBPA 2003. LNCS, vol. 2688, pp. 310–317. Springer, Heidelberg (2003)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Art. Intelligence 18(3), 265–298 (2004)
Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)
Bretto, A., Cherifi, H., Aboutajdine, D.: Hypergraph imaging: an overview. Pattern Recognition 35(3), 651–658 (2002)
Wong, A.C.K., Lu, S.W., Rioux, M.: Recognition and shape synthesis of 3-D objects based on attributed hypergraphs. IEEE Trans. PAMI 11(3), 279–290 (1989)
Demko, D.: Generalization of two hypergraphs. Algorithm of calculation of the greatest sub-hypergraph common to two hypergraphs annotated by semantic information. In: Jolion, J.-M., Kropatsch, W. (eds.) Graph Based Representations in Pattern Recognition, Computing, vol. (suppl. 12), pp. 1–10. Springer, Heidelberg (1998)
Bunke, H., Dickinson, P., Kraetzl, M.: Matching Hypergraphs, Technical Report, Intelligence Surveillance Reconnaissance Division, Defence Science and Technology Organisation, Edinburgh SA 5111, Australia (2004)
Ullman, J.R.: An algorithm for subgraph isomorphism. Journal of ACM 23, 31–42 (1976)
McGregor, J.J.: Backtrack search algorithm and the maximal common subgraph problem. Software – Practice and Experience 12, 23–34 (1982)
Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. PAMI 20(5), 493–507 (1998)
Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19, 255–259 (1998)
Jiang, X., Münger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE Trans. PAMI 23(10), 1144–1151 (2001)
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
Bunke, H., Dickinson, P., Kraetzl, M. (2005). Theoretical and Algorithmic Framework for Hypergraph Matching. In: Roli, F., Vitulano, S. (eds) Image Analysis and Processing – ICIAP 2005. ICIAP 2005. Lecture Notes in Computer Science, vol 3617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553595_57
Download citation
DOI: https://doi.org/10.1007/11553595_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28869-5
Online ISBN: 978-3-540-31866-8
eBook Packages: Computer ScienceComputer Science (R0)