Abstract
Structural pattern representations, especially graphs, have advantages over feature vectors. However, they also suffer from a number of disadvantages, for example, their high computational complexity. Moreover, we observe that in the field of statistical pattern recognition a number of powerful concepts emerged recently that have no equivalent counterpart in the domain of structural pattern recognition yet. Examples include multiple classifier systems and kernel methods. In this paper, we survey a number of recent developments that may be suitable to overcome some of the current limitations of graph based representations in pattern recognition.
Chapter PDF
Similar content being viewed by others
Keywords
References
IEEE Transactions on Pattern Analysis and Machine Intelligence: Special section on graph algorithms and computer vision 23, 1040–1151 (2001)
Pattern Recognition Letters: Special issue on graph based representations 24, 1033–1122 (2003)
Int. Journal of Pattern Recognition and Art. Intelligence: Special issue on graph matching in pattern recognition and computer vision 18, 261–517 (2004)
Special Section on Syntactic and Structural Pattern Recognition: IEEE Transactions on Pattern Analysis and Machine Intelligence 27 (2005) ( to appear)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence 18, 265–298 (2004)
Roli, F., Kittler, J., Windeatt, T. (eds.): MCS 2004. LNCS, vol. 3077. Springer, Heidelberg (2004)
Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)
Gärtner, T.: A survey of kernels for structured data. ACM SIGKDD Explorations 5, 49–58 (2003)
Bunke, H., Allermann, C.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 245–253 (1983)
Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics 13, 353–363 (1983)
Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence 21, 917–922 (1999)
Ristad, E., Yianilos, P.: Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 522–532 (1998)
Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging, and its application to diatom identification. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 95–106. Springer, Heidelberg (2003)
Le Saux, B., Bunke, H.: Feature selection for graph-based image classifiers. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol. 3523, pp. 147–154. Springer, Heidelberg (2005) (to appear)
Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics 35 (2005) (to appear)
Kohonen, T.: Self-organizing Maps. Springer, Heidelberg (1995)
Neuhaus, M., Bunke, H.: A probabilistic approach to learning costs for graph edit distance. In: Kittler, J., Petrou, M., Nixon, M. (eds.) Proc. 17th Int. Conference on Pattern Recognition, vol. 3, pp. 389–393 (2004)
Vapnik, V.: Statistical Learning Theory. John Wiley, Chichester (1998)
Schölkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)
Byun, H., Lee, S.: A survey on pattern recognition applications of support vector machines. Int. Journal of Pattern Recognition and Artificial Intelligence 17, 459–486 (2003)
Joachims, T.: Learning to Classify Text Using Support Vector Machines. Kluwer Academic, Dordrecht (2002)
Watkins, C.: Dynamic alignment kernels. In: Smola, A., Bartlett, P., Schölkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 39–50. MIT Press, Cambridge (2000)
Lodhi, H., Saunders, C., Shawe-Tayler, J., Cristianini, N., Watkins, C.: Text classification using string kernels. Machine Learning 2, 419–444 (2002)
Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proc. 20th Int. Conf. on Machine Learning, pp. 321–328 (2003)
van Wyk, M.A., Durrani, T.S., van Wyk, B.J.: A RKHS interpolator-based graph matching algorithm. PAMI 24, 988–995 (2002)
Neuhaus, M., Bunke, H.: Edit distance based kernel functions for structural pattern classification (2005) (submitted)
Dietterich, T.: Ensemble methods in machine learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1–15. Springer, Heidelberg (2000)
Breiman, L.: Bagging predictors. Machine Learning 24, 123–140 (1996)
Ho, T.: The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 832–844 (1998)
Marcialis, G., Roli, F., Serrau, A.: Fusion of statistical and structural fingerprint classifiers. In: Proc. 4th International Conf. Audio- and Video-Based Biometrie Person Authentication AVBPA, pp. 310–317 (2003)
Serrau, A., Marcialis, G., Bunke, H., Roli, F.: An experimental comparison of fingerprint classification methods using graphs. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 281–290. Springer, Heidelberg (2005)
Le Saux, B., Bunke, H.: Bayesian multiple classifier system for image content recognition (2005) (submitted)
Schenker, A., Bunke, H., Last, M., Kandel, A.: Building graph-based classifier ensembles by random node selection. In: Roli, F., Kittler, J., Windeatt, T. (eds.) MCS 2004. LNCS, vol. 3077, pp. 214–222. Springer, Heidelberg (2004)
Chapelle, O., Haffner, P., Vapnik, V.: Svms for histogram-based image classification. IEEE Transactions on Neural Networks 10, 1055–1065 (1999)
Le Saux, B., Amato, G.: Image recognition for digital libraries. In: Proc. 6th ACM MultiMedia/Int. Workshop on Multimedia Information Retrieval, pp. 91–98 (2004)
Schenker, A., Last, M., Bunke, H., Kandel, A.: Classification of web documents using graph matching. Int. Journal of Pattern Recognition and Artificial Intelligence 18, 475–496 (2004)
Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19, 255–259 (1998)
Messmer, B., Bunke, H.: A new algorithm for error–tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 493–505 (1998)
Shapiro, L., Haralick, R.: Organization of relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 4, 595–602 (1982)
Lopresti, D., Wilfong, G.: A fast technique for comparing graph representations with applications to performance evaluation. Int. Journal on Document Analysis and Recognition 6, 219–229 (2004)
Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: Proc. 16th Int. Conference on Pattern Recognition, vol. 2, pp. 467–470 (2002)
Irniger, C., Bunke, H.: Decision tree structures for graph database filtering. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 66–75. Springer, Heidelberg (2004)
Irniger, C., Bunke, H.: Graph database filtering using decision trees. In: Kittler, J., Petrou, M., Nixon, M. (eds.) Proc. 17th Int. Conference on Pattern Recognition, vol. 3, pp. 383–388 (2004)
Irniger, C., Bunke, H.: Decision trees for error-tolerant graph database filtering. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 301–312. Springer, Heidelberg (2005)
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., Irniger, C., Neuhaus, M. (2005). Graph Matching – Challenges and Potential Solutions. 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_1
Download citation
DOI: https://doi.org/10.1007/11553595_1
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)