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. © Springer-Verlag 2004.
CITATION STYLE
Lozano, M. A., & Escolano, F. (2004). Regularization kernels and softassign. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3287, 320–327. https://doi.org/10.1007/978-3-540-30463-0_39
Mendeley helps you to discover research relevant for your work.