How and why pattern recognition and computer vision applications use graphs

Studies in Computational Intelligence

Volumn 52, Issue , 2007, Pages 85-135

  Conte, Donatello ^a   Foggia, Pasquale ^a   Sansone, Carlo ^a   Vento, Mario ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34147200769     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-68020-8_4     Document Type: Review

References (170)

1. Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3):265-298.
2. Aho AV, Hopcroft JE, Ullman JD (1974) The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA
3. Hopcroft JE, Wong J (1974) Linear time algorithm for isomorphism of planar graphs. Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 172-184
4. Luks EM (1982) Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and Systems Sciences 25:42-65
5. Ullman JR (1976) An algorithm for subgraph isomorphism. Journal of the Association for Computer Machinery 23:31-42
6. Schmidt DC, Druffel LE (1976) A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. Journal of the ACM 23:433-445
7. Ghahraman DE, Wong AKC, Au T (1980) Graph monomorphism algorithms. IEEE Transactions on Systems, Man and Cybernetics 10(4):189-197
8. Cordella LP, Foggia P, Sansone C, Vento M (2000) Fast graph matching for detecting CAD image components. Proceedings of 15th International Conference on Pattern Recognition, pp. 1034-1037
9. Cordella LP, Foggia P, Sansone C, Tortorella F, Vento M (1998) Graph matching: A fast algorithm and its evaluation. Proceedings of 14th International Conference on Pattern Recognition, pp. 1582-1584
10. Cordella LP, Foggia P, Sansone C, Vento M (1999) Performance evaluation of the VF graph matching algorithm. Proceedings of the International Conference on Image Analysis and Processing, pp. 1172-1177
11. De Santo M, Foggia P, Sansone C, Vento M (2003) A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognition Letters 24(8):1067-1079
12. Cordella LP, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 149-159
13. Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10):1367-1372
14. Larrosa J, Valiente G (2002) Constraint satisfaction algorithms for graph pattern matching. Mathematical Structural in Computer Science 12:403-422
15. Durand PJ, Pasari R, Baker JW, and Tsai CC (1999) An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry 2
16. McKay BD (1981) Practical graph isomorphism. Congressus Numerantium 30:45-87
17. Foggia P, Sansone C, Vento M (2001) A performance comparison of five algorithms for graph isomorphism. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 188-199
18. Bunke H, Messmer BT (1997) Recent advances in graph matching. International Journal of Pattern Recognition and Artificial Intelligence 11(1):169-203
19. Messmer BT, Bunke H (1999) A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition 32(12):1979-1998
20. Shearer K, Bunke H, Venkatesh S, Kieronska S (1997) Efficient graph matching for video indexing. Computing. Supplement 12:53-62
21. Shearer K, Bunke H, Venkatesh S (2001) Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition 34(5):1075-1091
22. Lazarescu M, Bunke H, Venkatesh S (2000) Graph matching: Fast candidate elimination using machine learning techniques. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 236-245
23. Irniger C, Bunke H (2001) Graph matching: Filtering large databases of graphs using decision trees. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 239-249
24. Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18(8):689-694
25. Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19(3):255-259
26. Bunke H (1999) Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on PAMI 21(9):917-922
27. Fernndez ML, Valiente G (2001) A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters 22(6):753-758
28. Wallis WD, Shoubridge P, Kraetz M, Ray D (2001) Graph distances using graph union. Pattern Recognition Letters 22(6):701-704
29. Tsai WH, Fu KS (1979) Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE Transactions on Systems, Man and Cybernetics 9(12): 757-768
30. Tsai WH, Fu KS (1983) Subgraph error-correcting isomorphisms for syntactic pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13(1):48-61
31. Wong AKC, You M, Chan SC (1990) An algorithm for graph optimal monomorphism. IEEE Transactions on Systems, Man and Cybernetics 20(3):628-638
32. Eshera MA, Fu KS (1984) A similarity measure between attributed relational graphs for image analysis. Proceedings of the Seventh International Conference on Pattern Recognition, pp. 75-77
33. Eshera MA, Fu KS (1984) A graph distance measure for image analysis. IEEE Transactions on Systems, Man and Cybernetics 14(3):398-408
34. Sanfeliu A, Fu KS (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13(3): 353-363
35. Ghahraman DE, Wong AKC, Au T (1980) Graph optimal monomorphism algorithms. IEEE Transactions on Systems, Man and Cybernetics 10(4):181-188
36. Shapiro LG, Haralick RM (1981) Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 3(5):504-519
37. Shapiro LG, Haralick RM (1985) A metric for comparing relational descriptions. IEEE Transactions on Pattern Analysis and Machine Intelligence 7(1):90-94
38. Dumay ACM, van der Geest RJ, Gerbrands JJ, Jansen E, Reiber JHC (1992) Consistent inexact graph matching applied to labelling coronary segments in arteriograms. Proceedings of the International Conference on Pattern Recognition, Conference C, pp. 439-442
39. Berretti S, Del Bimbo A, Vicario E (2000) A look-ahead strategy for graph matching in retrieval by spatial arrangement. International Conference on Multimedia and Expo, pp. 1721-1724
40. Berretti S, Del Bimbo A, Vicario E (2000) The computational aspect of retrieval by spatial arrangement. Proceedings of 15th International Conference on Pattern Recognition, pp. 1047-1051
41. Berretti S, Del Bimbo A, Vicario E (2001) Efficient matching and indexing of graph models in content-based retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(10):1089-1105
42. Gregory L, Kittler J (2002) Using graph search techniques for contextual colour retrieval. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 186-194
43. Cordella LP, Foggia P, Sansone C, Vento M (1996) An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model. Proceedings of the 13th International Conference on Pattern Recognition, pp. 180-184
44. Cordella LP, Foggia P, Sansone C, Vento M (1997) Subgraph trasformations for inexact matching of attributed relational graphs. Computing. Supplement 12:43-52
45. Serratosa F, Alquezar R, Sanfeliu A (1999) Function-described graphs: A fast algorithm to compute a sub-optimal matching measure. Proceedings of the Second IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 71-77
46. Serratosa F, Alquezar R, Sanfeliu A (2000) Efficient algorithms for matching attributed graphs and function-described graphs. Proceedings of 15th International Conference on Pattern Recognition, pp. 867-872
47. Rocha J, Pavlidis T (1994) A shape analysis model with applications to a character recognition system. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(4):393-404
48. Wang C, Abe K (1995) Region correspondence by inexact attributed planar graph matching. Proceedings of the Fifth International Conference on Computer Vision, pp. 440-447
49. Llados J, Marti E, Villanueva JJ (2001) Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(10):1137-1143
50. Fischler M, Elschlager R (1973) The representation and matching of pictorial structures. IEEE Transactions on Computers (22):67-92
51. Kittler J, Hancock ER (1989) Combining evidence in probabilistic relaxation. International Journal of Pattern Recognition and Artificial Intelligence 3:29-51
52. Christmas WJ, Kittler J, Petrou M (1995) Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(8):749-764
53. Wilson RC, Hancock ER (1997) Structural matching by discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(6):634-648
54. Huet B, Hancock ER (1999) Shape recognition from large image libraries by inexact graph matching. Pattern Recognition Letters 20:1259-1269
55. Myers R,Wilson RC, Hancock ER (2000) Bayesian graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(6):628-635
56. Torsello A, Hancock ER (2001) Computing approximate tree edit-distance using relaxation labeling. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 125-136
57. Luo B, Hancock ER (2001) Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(10):1120-1136
58. Dempster AP, Laird AP, and Rubin DB (1977) Maximum-likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B 39:1-38
59. Almohamad HA, Duffuaa SO (1993) A linear programming approach for the weighted graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(5):522-525
60. Lawler ES (2001) Combinatorial Optimization: Networks and Matroids. Dover, New York
61. Rangarajan A, Mjolsness ED (1996) A Lagrangian relaxation network for graph matching. IEEE Transactions on Neural Networks 7(6):1365-1381
62. Gold S, Rangarajan A (1996) A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(4):377-388
63. Bomze IM (1997) Evolution towards the maximum clique. Journal of Global Optimization 10:143-164
64. Pelillo M (1995) Relaxation labeling networks for the maximum clique problem. Journal of Artificial Neural Networks 2:313-328
65. Pelillo M, A Jagota (1995) Feasible and infeasible maxima in a quadratic program for maximum clique. Journal of Artificial Neural Networks 2:411-420
66. Rosenfeld A, Hummel RA, Zucker SW (1976) Scene labelling by relaxation operations. IEEE Transactions on Systems, Man and Cybernetics 6(6):420-433
67. Pelillo M (1998) A unifying framework for relational structure matching. Proceedings of 14th International Conference on Pattern Recognition, pp. 1316-1319
68. Pelillo M, Siddiqi K, Zucker SW (1999) Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(11):1105-1120
69. Branca A, Stella E, Distante A (1999) Feature matching by searching maximum clique on high order association graph. Proceedings of the 10th International Conference on Image Analysis and Processing, pp. 642-658
70. Medasani S, Krishnapuram R (1999) A fuzzy approach to content-based image retrieval. Proceedings of the IEEE International Conference on Fuzzy Systems, pp. 1251-1260
71. Medasani S, Krishnapuram R, Choi YS (2001) Graph matching by relaxation of fuzzy assignments. IEEE Transactions on Fuzzy Systems 9(1):173-182
72. van Wyk BJ, van Wyk MA (2002) Non-bayesian graph matching without explicit compatibility calculations. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 74-82
73. van Wyk BJ, van Wyk MA, Hanrahan HE (2002) Successive projection graph matching. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 263-271
74. Umeyama S (1988) An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence 10(5):695-703
75. Xu L, King I (2001) A PCA approach for fast retrieval of structural patterns in attributed graphs. IEEE Transactions on Systems, Man and Cybernetics, Part B 31(5):812-817
76. Carcassoni M, Hancock ER (2001) Weighted graph-matching using modal clusters. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 260-269
77. Kosinov S, Caelli T (2002) Inexact multisubgraph matching using graph eigenspace and clustering models. Proceedings of the Joint IAPR International Workshops SSPR and SPR, pp. 133-142
78. Shokoufandeh A, Dickinson S (2001) A unified framework for indexing and matching hierarchical shape structures. In: Arcelli C, Cordella LP, Sanniti di Baja G (eds), Workshop on Visual Form, LNCS 2059, pp. 67-84
79. Jagota A, Pelillo M, Rangarajan A (2000) A new deterministic annealing algorithm for maximum clique. Proceedings of the International Joint Conference on Neural Networks 6:505-508
80. Gendreau M, Salvail L, Soriano P (1993) Solving the maximum clique problem using a tabu search approach. Annals of Operations Research 41:385-403
81. Williams ML,Wilson RC, Hancock ER (1999) Deterministic search for relational graph matching. Pattern Recognition 32(7):1255-1271
82. Eshera MA, Fu KS (1986) An image understanding system using attributed symbolic representation and inexact graph-matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 8(5):604-618
83. Hong P, Wang R, Huang T (2000) Learning patterns from images by combining soft decisions and hard decisions. Proceedings of the 2000 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 79-83
84. Jiang X, Bunke H (1998) Marked subgraph isomorphism of ordered graphs. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 122-131
85. Seong D, Kim HS, Park KH (1993) Incremental clustering of attributed graphs. IEEE Transactions on Systems, Man and Cybernetics 23(5):1399-1411
86. Zhang H, Yan H (1999) Graphic matching based on constrained Voronoi diagrams. Proceedings of the Fifth International Symposium on Signal Processing and its Applications, pp. 431-434
87. Luo B, Robles-Kelly A, Torsello A, Wilson RC, Hancock ER (2001) Clustering shock trees. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 217-228
88. Suganthan PN, Teoh EK, Mital D (1995) Pattern recognition by graph matching using the potts MFT neural networks. Pattern Recognition 28(7):997-1009
89. Torsello A, Hancock ER (2002) Learning structural variations in shock trees. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 113-122
90. Perchant A, Boeres C, Bloch I, Roux M, Ribeiro C (1999) Model-based scene recognition using graph fuzzy homomorphism solved by genetic algorithm. Proceedings of the Second IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 61-70
91. Boeres MC, Ribeiro CC, Bloch I (2004) A Randomized Heuristic for Scene Recognition by Graph Matching. In: Ribeiro CC, Martins SL (eds) Experimental and Efficient Algorithms: Third International Workshop, LNCS 3059, pp. 100-113
92. Wilson RC, Hancock ER (1999) Graph matching with hierarchical discrete relaxation. Pattern Recognition Letters 20(10):1041-1052
93. Neuhaus M, Bunke H (2003) An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In: Fred A, Caelli T, Camphilho A (eds), SSPR 2004, LNCS 3138
94. Jia J, Abe K (1998) Automatic generation of prototypes in 3D structural object recognition. Proceedings of the Fourteenth International Conference on Pattern Recognition, pp. 697-700
95. Shasha D, Wang JTL, Zhang K, Shih FY (1994) Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man and Cybernetics 24(4):668-678
96. Sanfeliu A, Serratosa F, Alquezar R (2004) Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3):375-396
97. Robles-Kelly A, Hancock ER (2005) Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(3):365-378
98. Englert R, Cremers AB, Seelmann-Eggebert J (1997) Recognition of polymorphic pattern in parameterized graphs for 3D building reconstruction. Computing. Supplement 12:11-20
99. Meth R, Chellappa R (1996) Target indexing in synthetic aperture radar imagery using topographic features. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 2152-2155
100. Li WJ, Lee T (2000) Object recognition by sub-scene graph matching. IEEE International Conference on Robotics and Automation, pp. 1459-1464
101. Belongie S, Malik J (2000) Matching with shape contexts. Proceedings of IEEE Workshop on Content-based Access of Image and Video Libraries, pp. 20-26
102. Sebastian TB, Klein PN, Kimia BB (2005) Recognition of shapes by editing their shock graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(5): 550-571
103. Koo JH, Yoo SI (1998) A structural matching for two-dimensional visual pattern inspection. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 4429-4434
104. Sharvit D, Chan J, Tek H, Kimia BB (1998) Symmetry-based indexing of image databases. Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries, pp. 56-62
105. Bauckhage C, Wachsmuth S, Sagerer G (2001) 3D assembly recognition by matching functional subparts. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 95-104
106. Olatunbosun S, Dowling GR, Ellis TJ (1996) Topological representation for matching coloured surfaces. Proceedings of the International Conference on Image Processing, pp. 1019-1022
107. Fuchs F, Le Men H (2000) Efficient subgraph isomorphism with 'A Priori' knowledge. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 427-436
108. Fuchs F, Le Men H (1999) Building reconstruction on aerial images through multiprimitive graph matching. Proceedings of the Second IAPR-TC15Workshop on Graphbased Representations in Pattern Recognition, pp. 21-30
109. Messmer BT, Bunke H (1998) A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(5):493-504
110. Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Communications of ACM 16(9):575-577
111. Foggia P, Sansone C, Tortorella F, Vento M (1999) Definition and validation of a distance measure between structural primitives. Pattern Analysis and Applications 2: 215-227
112. Foggia P, Genna R, Vento M (2001) Symbolic vs. connectionist learning: an experimental comparison in a structured domain. IEEE Transactions on Knowledge and Data Engineering 13(2):176-195
113. Chan KP (1996) Learning templates from fuzzy examples in structural pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, Part B 26(1):118-123
114. Lee RST, Liu JNK (1999) An oscillatory elastic graph matching model for recognition of offline handwritten Chinese characters. Third International Conference on Knowledge-Based Intelligent Information Engineering Systems, pp. 284-287
115. Suganthan PN, Yan H (1998) Recognition of handprinted Chinese characters by constrained graph matching. Image and Vision Computing 16(3):191-201
116. Liu JZ, Ma K, Cham WK, ChangMMY(2000) Two-layer assignment method for online Chinese character recognition. IEEE Proceedings Vision, Image and Signal Processing 147(1):47-54
117. Lu SW, Ren Y, Suen CY (1991) Hierarchical attributed graph representation and recognition of handwritten Chinese characters. Pattern Recognition 24:617-632
118. Chen LH, Lieh JR (1990) Handwritten character recognition using a 2-layer random graph model by relaxation matching. Pattern Recognition 23:1189-1205
119. Suganthan PN, Teoh EK, Mital D (1995) A self organizing Hopfield network for attributed relational graph matching. Image and Vision Computing 13(1):61-73
120. Pavlidis T, Sakoda WJ, Shi H (1995) Matching graph embeddings for shape analysis. Proceedings of the Third International Conference on Document Analysis and Recognition, pp. 729-733
121. Filatov A, Gitis A, Kil I (1995) Graph-based handwritten digit string recognition. Proceedings of the Third International Conference on Document Analysis and Recognition, pp. 845-848
122. Llados J, Lopez-Krahe J,Marti E (1996) Hand drawn document understanding using the straight line Hough transform and graph matching. Proceedings of the 13th International Conference on Pattern Recognition, pp. 497-501
123. Changhua L, Bing Y,Weixin X (2000) Online hand-sketched graphics recognition based on attributed relational graph matching. Proceedings of the Third World Congress on Intelligent Control and Automation, pp. 2549-2553
124. Jiang X, Munger A, Bunke H (1999) Synthesis of representative symbols by computing generalized median graphs. Proceedings of the International Workshop on Graphics Recognition GREC'99, pp. 187-194
125. Lades M, Vorbruggen JC, Buhmann J, Lange J, von der Malsburg C, Wurz RP, Konen W (1993) Distortion invariant object recognition in the dynamic link architecture. IEEE Transactions on Computers 42(3):300-311
126. Wiskott L, Fellous JM, Kruger N, von der Malsburg C (1997) Face recognition by elastic bunch graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(7):775-779
127. Wiskott L (1997) Phantom faces for face analysis. Proceedings of the International Conference on Image Processing, pp. 308-311
128. Lim R, Reinders MJT (2001) Facial landmarks localization based on fuzzy and gabor wavelet graph matching. The Tenth IEEE International Conference on Fuzzy Systems, pp. 683-686
129. Kotropoulos C, Tefas A, Pitas I (2000) Frontal face authentication using morphological elastic graph matching. IEEE Transactions on Image Processing 9(4):555-560
130. Tefas A, Kotropoulos C, Pitas I (2001) Using support vector machines to enhance the performance of elastic graph matching for frontal face authentication. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(7):735-746
131. Duc B, Fischer S, Bigun J (1999) Face authentication with Gabor information on deformable graphs. IEEE Transactions on Image Processing 8(4):504-516
132. Lyons MJ, Budynek J, Akamatsu S (1999) Automatic classification of single facial images. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(12):1357-1362
133. Wang M, Iwai Y, Yachida M (1998) Expression recognition from time-sequential facial images by use of expression change model. Proceedings of the Third IEEE International Conference on Automatic Face and Gesture Recognition, pp. 354-359
134. Elagin E, Steffens J, Neven H (1998) Automatic pose estimation system for human faces based on bunch graph matching technology. Proceedings of the Third IEEE International Conference on Automatic Face and Gesture Recognition, pp. 136-141
135. Triesch J, von der Malsburg C (2001) A system for person-independent hand posture recognition against complex backgrounds. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(12):1449-1453
136. Burge M, Burger W (2000) Ear biometrics in computer vision. Proceedings of 15th International Conference on Pattern Recognition, pp. 822-826
137. Maio D, Maltoni D (1996) A structural approach to fingerprint classification. Proceedings of the 13th International Conference on Pattern Recognition, pp. 578-585
138. Fan KC, Liu CW,Wang YK (1998) A fuzzy bipartite weighted graph matching approach to fingerprint verification. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 4363-4368
139. Petrakis GM, Faloutsos C (1997) Similarity searching in medical image databases. IEEE Transaction on Knowledge and Data Engineering 9(3):435-447 134 D. Conte et al.
140. Cho SJ, Yoo SJ (1998) Image retrieval using topological structure of user sketch. IEEE International Conference on Systems, Man and Cybernetics, pp. 4584-4588
141. de Mauro C, Diligenti M, Gori M, Maggini M (2003) Similarity learning for graph-based image representations. Pattern Recognition Letters 24(8):1115-1122
142. Doulamis N, Doulamis A, Kollias S (1999) Efficient content-based retrieval of humans from video databases. Proceedings of the International Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems, pp. 89-95
143. Folkers A, Samet H, Soffer A (2000) Processing pictorial queries with multiple instances using isomorphic subgraphs. Proceedings of the 15th International Conference on Pattern Recognition, pp. 51-54
144. Hlaoui A, Wang S (2002) A new algorithm for graph matching with application to content-based image retrieval. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 291-300
145. Huet B and Hancock ER (1998) Fuzzy relational distance for large-scale object recognition. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 138-143
146. Huet B, Kern NJ, G Guarascio, B Merialdo (2001) Relational skeletons for retrieval in patent drawings. Proceedings of the International Conference on Image Processing, pp. 737-740
147. Park IK, Yun ID, Lee SU (1997) Models and algorithms for efficient color image indexing. Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries, pp. 36-41
148. Shearer K, Venkatesh S, Bunke H (2001) Video sequence matching via decision tree path following. Pattern Recognition Letters 22(5):479-492
149. Ozer B, Wolf W, Akansu AN (1999) A graph based object description for information retrieval in digital image and video libraries. Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries, pp. 79-83
150. Chen HT, Lin H, Liu TL (2001) Multi-object tracking using dynamical graph matching. Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 210-217
151. Gomila C, Meyer F (2001) Tracking objects by graph matching of image partition sequences. Proceedings of the Third IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition, pp. 1-11
152. Conte D, Foggia P, Guidobaldi C, Limongiello A, Vento M (2004) An object tracking algorithm combining different cost functions. In: Campilho A, Kamel M (eds) ICIAR 2004, LNCS 3212, pp. 614-622
153. Conte D, Foggia P, Jolion JM, Vento M (2006) A graph-based, multi-resolution algorithm for tracking objects in presence of occlusions. Pattern Recognition 39(4):562-572
154. Salotti M, Laachfoubi N (2001) Topographic graph matching for shift estimation. Proceedings of the Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 54-63
155. Haris K, Efstradiatis SN, Maglaveras N, Pappas C, Gourassas J, Louridas G (1999) Model-based morphological segmentation and labeling of coronary angiograms. IEEE Transactions on Medical Imaging 18(10):1003-1015
156. Charnoz A, Agnus V, Malandain G, Soler L, Tajine M (2005) Tree matching applied to vascular system. In: Brun L, Vento M (eds) Graph-based Representations in Pattern Recognition, LNCS 3434, pp. 183-192
157. Fischer S, Gilomen K, Bunke H (2002) Identification of diatoms by grid graph matching. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 94-103
158. Ambauen R, Fischer S, Bunke H (2003) Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification. In: Hancock ER, Vento M (eds) Graph Based Representations in Pattern Recognition, LNCS 2726, pp. 95-106
159. Bunke H, Vento M (1999) Benchmarking of graph matching algorithms, Proceedings of Second IAPR TC-15 GbR Workshop, Haindorf, pp. 109-114
160. Kropatsch W (2001) Benchmarking graph matching algorithms - A complementary view. Proceedings of Third IAPR - TC15 Workshop on Graph-Based Representations, Italy, pp. 170-175
161. Irniger C, Bunke H (2003) Theoretical analysis and experimental comparison of graph matching algorithms for database filtering. In: Hancock ER, Vento M (eds) Graph Based Representations in Pattern Recognition, LNCS 2726, pp. 118-129
162. Kalviainen H, Oja E (1990) Comparisons of attributed graph matching algorithms for computer vision. In: Proceedings of STEP-90, Finnish Artificial Intelligence Symposium, pp. 354-368
163. Bunke H, Foggia P, Guidobaldi C, Vento M (2003) Graph clustering using the weighted minimum common supergraph. In: Hancock ER, Vento M (eds) Graph Based Representations in Pattern Recognition, LNCS 2726, pp. 235-246
164. Conte D, Guidobaldi C, Sansone C (2003) A comparison of three maximum common subgraph algorithms on a large database of labeled graphs. In: Hancock ER, Vento M (eds) Graph Based Representations in Pattern Recognition, LNCS 2726, pp. 130-141
165. Foggia P, Sansone C, Vento M (2001) A database of graphs for isomorphism and sub graph isomorphism benchmarking. Proceedings of the Third IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, Ischia, May 23-25, pp. 176-187
166. Hagenbuchner M, Gori M, Bunke H, Tsoi AC, Irniger C (2003) Using attributed plex grammars for the generation of image and graph databases. Pattern Recognition Letters 24(8):1081-1087
167. Feder J, (1971) Plex languages. Information Science 3:225-241
168. Cordella LP, Foggia P, Sansone C, Vento M (2002) Learning structural shape descriptions from examples. Pattern Recognition Letters 23(12):1427-1437
169. McGregor JJ (1982) Backtrack search algorithm and the maximal common subgraph problem. Software - Practice and Experience 12(1):23-34
170. Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing 15(4):1054-1068