Many-to-Many Graph Matching.

作者: M. Fatih Demirci , Ali Shokoufandeh , Sven J. Dickinson

DOI:

关键词: Factor-critical graphNull graphLine graphButterfly graphFolded cube graphGraph factorization3-dimensional matchingComputer scienceTheoretical computer scienceGraph property

摘要:

参考文章(22)
Alex Levinshtein, Cristian Sminchisescu, Sven Dickinson, Learning Hierarchical Shape Models from Examples Lecture Notes in Computer Science. pp. 251- 267 ,(2005) , 10.1007/11585978_17
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M. Fatih Demirci, Clas Jönsson, Sven Dickinson, The representation and matching of categorical shape Computer Vision and Image Understanding. ,vol. 103, pp. 139- 154 ,(2006) , 10.1016/J.CVIU.2006.05.001
Horst Bunke, Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-4, pp. 574- 582 ,(1982) , 10.1109/TPAMI.1982.4767310
Horst Bunke, Kim Shearer, A graph distance metric based on the maximal common subgraph Pattern Recognition Letters. ,vol. 19, pp. 255- 259 ,(1998) , 10.1016/S0167-8655(97)00179-7
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman, Lars Bretzner, Sven Dickinson, Object Recognition as Many-to-Many Feature Matching International Journal of Computer Vision. ,vol. 69, pp. 203- 222 ,(2006) , 10.1007/S11263-006-6993-Y
M.A. Fischler, R.A. Elschlager, The Representation and Matching of Pictorial Structures IEEE Transactions on Computers. ,vol. C-22, pp. 67- 92 ,(1973) , 10.1109/T-C.1973.223602
H. Bunke, On a relation between graph edit distance and maximum common subgraph Pattern Recognition Letters. ,vol. 18, pp. 689- 694 ,(1997) , 10.1016/S0167-8655(97)00060-3