Shape Similarity Based on a Treelet Kernel with Edition
Several shape similarity measures, based on shape skeletons, are designed in the context of graph kernels. State-of-the-art kernels act on bags of walks, paths or trails which decompose the skeleton graph, and take into account structural noise through edition mechanisms. However, these approaches fail to capture the complexity of junctions inside skeleton graphs due to the linearity of the patterns. To overcome this drawback, tree patterns embedded in the plane have been proposed to decompose the skeleton graphs. In this paper, we reinforce the behaviour of kernel based on tree patterns by explictly incorporating an edition mechanism adapted to tree patterns.
Keywordsshape similarity kernel methods tree patterns edition
- 2.Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proc. of the 20st Int. Conf. on Machine Learning, pp. 321–328 (2003)Google Scholar
- 6.Shervashidze, N., Vishwanathan, S.V.N., Petri, T.H., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison. In: Proc. of the 12th Int. Conf. on Artificial Intelligence and Statistics, pp. 488–495 (2009)Google Scholar
- 9.Bougleux, S., Dupé, F.X., Brun, L., Gaüzère, B., Mokhtari, M.: Shape similarity based on combinatorial maps and a tree pattern kernel. In: 21st Int. Conf. on Pattern Recognition (2012)Google Scholar
- 11.Cori, R.: Computation of the automorphism group of a topological graph embedding. Technical Report I-8612, Université Bordeaux 1, France (1985)Google Scholar
- 12.Bougleux, S., Brun, L.: Symmetry group of 2d combinatorial maps. Technical report, GREYC, France (2012)Google Scholar