Theoretical and Algorithmic Framework for Hypergraph Matching
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.
- 2.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)Google Scholar
- 7.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)Google Scholar
- 8.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)Google Scholar
- 9.Bunke, H., Dickinson, P., Kraetzl, M.: Matching Hypergraphs, Technical Report, Intelligence Surveillance Reconnaissance Division, Defence Science and Technology Organisation, Edinburgh SA 5111, Australia (2004)Google Scholar
- 12.Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. PAMI 20(5), 493–507 (1998)Google Scholar
- 14.Jiang, X., Münger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE Trans. PAMI 23(10), 1144–1151 (2001)Google Scholar