Tree covering within a graph kernel framework for shape classification

François-Xavier Dupé (1) , Luc Brun (1)

1 Equipe Image - Laboratoire GREYC - UMR6072

Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. On the other hand, graph kernels provide a rich framework in which many classification algorithm may be applied on graphs. However, edit distances cannot be readily used within the kernel machine framework as they generally lead to indefinite kernels. In this paper, we propose a graph kernel based on bags of paths and edit operations which remains positive definite according to the bags. The robustness of this kernel is based on a selection of the paths according to their relevance in the graph. Several experiments prove the efficiency of this approach compared to alternative kernel.

Mots clés: Shape; Skeleton; Graph Kernel; Kernel Machine

Domaines: Traitement des images [eess.IV]

François-Xavier Dupé, Luc Brun. Tree covering within a graph kernel framework for shape classification. I.C.I.A.P 2009, 2009, Vietri sul Mare, Italy. pp.278-287, ⟨10.1007/978-3-642-04146-4_31⟩. ⟨hal-00820626⟩