Theoretical and algorithmic framework for hypergraph matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3617 LNCS, Issue , 2005, Pages 463-470

  Bunke, Horst ^a   Dickinson, Peter ^b   Kraetzl, Miro ^b  

^a UNIVERSITY OF BERN   (Switzerland)

^b DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; IMAGE ANALYSIS; PATTERN RECOGNITION;

HYPERGRAPH MATCHING;

GRAPH THEORY;

EID: 33745173833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11553595_57     Document Type: Conference Paper

References (14)

1. 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, Volume 23-10, 2001, 1137-1143
2. Luo, B., Hancock, E.: Structural graph matching using the EM algorithm and singular value decomposition, IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 23-10, 2001, 1120-1136
3. Marcialis, G., Roll, F., Serrau, A.: Fusion of statistical and structural fingerprint classifiers. In Kittler, J., Nixon, M., eds.: 4th Int. Conf. Audio- and Video-Based Biometric Person Authentication, Springer LNCS 2688, 2003, 310-317
4. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition, Int. Journal of Pattern Recognition and Art. Intelligence, Vol. 18, No. 3, 2004, 265-298
5. Berge, C.: Hypergraphs, North-Holland, 1989
6. Bretto, A., Cherifi, H., Aboutajdine, D.: Hypergraph imaging: an overview, Pattern Recognition, Vol. 35, No. 3, 2002, 651-658
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, Vol. 11, No. 3, 1989, 279-290
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, Supplement 12, Springer Verlag, 1998, 1-10
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
10. Ullman, J.R.: An algorithm for subgraph isomorphism, Journal of ACM, Vol. 23, 1976, 31-42
11. McGregor, J.J.: Backtrack search algorithm and the maximal common subgraph problem, Software - Practice and Experience, Vol. 12, 1982, 23-34
12. Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. PAMI, Vol. 20, No. 5, 1998, 493-507
13. Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph, Pattern Recognition Letters, Vol. 19, 1998, 255-259
14. Jiang, X., Münger, A. Bunke, H.: On median graphs: properties, algorithms, and applications, IEEE Trans. PAMI, Vol. 23, No. 10, 2001, 1144-1151