Abstract
In this paper we analyze the use of regularization kernels on graphs to weight the quadratic cost function used in the Softassign graph-matching algorithm. In a previous work, we have showed that when using diffusion kernels on graphs such a weighting improves significantly the matching performance yielding a slow decay with increasing noise. Weights, relying on the entropies of the probability distributions associated to the vertices after diffusion kernel computation, transform the original unweighted matching problem into a weighted one. In this regard, as diffusion kernels are a particular case of regularization kernels it is interesting to study the utility of this family of kernels for matching purposes. We have designed an experimental set for discovering the optimal performance for each regularization kernel. Our results suggest that kernel combination could be a key point to address in the future.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chung, F.R.K.: Spectral Graph Theory. In: Conference Board of the Mathematical Sciences (CBMS), vol.Ā 92, American Mathematical Society, Providence (1997)
Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines. Cambridge University Press, Cambridge (2000)
GƤrtner: A Survey of Kernels for Structured Data. ACM SIGKDD Explorations NewsletterĀ 5(1), 49ā58 (2003)
Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Transactions on Pattern Analysis and Machine IntelligenceĀ 18(4), 377ā388 (1996)
Finch, A.M., Wilson, R.C., Hancock, E.: An Energy Function and Continuous Edit Process for Graph Matching. Neural ComputationĀ 10(7), 1873ā1894 (1998)
Kondor, R.I., Lafferty, J.: Diffusion Kernels on Graphs and other Discrete Input Spaces. In: Sammut, C., Hoffmann, A.G. (eds.) Machine Learning, Proceedings of the Nineteenth International Conference (ICML 2002), pp. 315ā322. Morgan Kaufmann, San Francisco (2002)
Lozano, M.A., Escolano, F.: A Significant Improvement of Softassing with Diffusion Kernels. In: Proceedings of the IAPR International Workshop on Syntactical and Structural Pattern Recognition SSPR 2004. LNCS (2004) (accepted for publication)
MĆ¼ller, K.-R., Mika, S., RƤshc, T.K., Schƶlkopf, B.: An Introduction to Kernel-based Learning Algorithms. IEEE Transactions on Neural NetworksĀ 12(2), 181ā201 (2001)
Schmidt, D.C., Druffel, L.E.: A Fast Backtracking Algorithm to Test Direct Graphs for Isomorphism Using Distance Matrices. Journal of the ACMĀ 23(3), 433ā445 (1976)
Schƶlkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)
Smola, A., Schƶlkopf, B., MĆ¼ller, K.-R.: The Connection between Regularization Operators and Support Vector Kernels. Neural NetworksĀ 11, 637ā649 (1998)
Smola, A., Kondor, R.I.: Kernels and Regularization on Graphs. In: Schƶlkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol.Ā 2777, pp. 144ā158. Springer, Heidelberg (2003)
DePiero, F.W., Trivedi, M., Serbin, S.: Graph Matching Using a Direct Classification of Node Attendance. Pattern Recognition, VolĀ 29(6), 1031ā1048 (1996)
Ozer, B., Wolf, W., Akansu, A.N.: A Graph Based Object Description for Information Retrieval in Digital Image and Video Libraries. In: Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries, pp. 79ā83 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lozano, M.A., Escolano, F. (2004). Regularization Kernels and Softassign. In: Sanfeliu, A., MartĆnez Trinidad, J.F., Carrasco Ochoa, J.A. (eds) Progress in Pattern Recognition, Image Analysis and Applications. CIARP 2004. Lecture Notes in Computer Science, vol 3287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30463-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-30463-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23527-9
Online ISBN: 978-3-540-30463-0
eBook Packages: Springer Book Archive