@INPROCEEDINGS{CI-Dupe2009a, author = {Dup'e, F. -X. and Brun, L.}, title = {Edition within a graph kernel framework for shape recognition}, booktitle = {Graph Based Representation in Pattern Recognition 2009}, year = {2009}, theme={shape}, pages = {11-21}, url={paper(pdf):=http://www.greyc.ensicaen.fr/~luc/ARTICLES/gbr2009_dupe.pdf}, abstract={ The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junction or extremity of the branches. This graph is non simple since it can be composed of loops and multiple-edges. Within the shape comparison framework, such a graph is usually transformed into a simpler structure such as a tree or a simple graph hereby loosing major information about the shape. In this paper, we propose a graph kernel combining a kernel between bags of trails and a kernel between faces. The trails are defined within the original complex graph and the kernel between trails is enforced by an edition process. The kernel between bags of faces allows to put an emphasis on the holes of the shapes and hence on their genre. The resulting graph kernel is positive semi-definite on the graph domain.} } @INPROCEEDINGS{CI-Dupe2009b, author = {Dup'e, F. -X. and Brun, L.}, title = {Tree covering within a graph kernel framework for shape classification.}, booktitle = {I.C.I.A.P 2009}, year = {2009}, note = {To be published}, theme={shape}, pages = {}, abstract={ The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junction or extremity of the branches. This graph is non simple since it can be composed of loops and multiple-edges. Within the shape comparison framework, such a graph is usually transformed into a simpler structure such as a tree or a simple graph hereby loosing major information about the shape. In this paper, we propose a graph kernel combining a kernel between bags of trails and a kernel between faces. The trails are defined within the original complex graph and the kernel between trails is enforced by an edition process. The kernel between bags of faces allows to put an emphasis on the holes of the shapes and hence on their genre. The resulting graph kernel is positive semi-definite on the graph domain.} } @InProceedings{CI-Dupe2009c, author = {Dup'e, F. -X. and Brun, L.}, title = {Shape classification using a flexible graph kernel}, booktitle = {Proceedings of CAIP 2009}, year = 2009, editor = {Xiaoyi Jiang}, month = {September}, publisher = {LNCS}, theme= {shape}, url={paper(pdf):=http://www.greyc.ensicaen.fr/~luc/ARTICLES/caip2009.pdf}, abstract = {The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and o ne node for each junction or extremity of the branches. This graph is non simple since it can be composed of loops and multiple-edges. Within the shape comparison framework, s uch a graph is usually transformed into a simpler structure such as a tree or a simp le graph hereby loosing major information about the shape. In this paper, we propose a graph kernel combining a kernel between bags of trails and a kernel between faces. T he trails are defined within the original complex graph and the kernel between trails is enforced by an edition process. The kernel between bags of faces allows to put an empha sis on the holes of the shapes and hence on their genre. The resulting graph kernel is po sitive semi-definite on the graph domain.} } @InProceedings{CI-DUPE-2008-2, author = {Dup'e, F.-X. and Brun, L.}, title = {Hierarchical Bag of Paths for Kernel Based Shape Classification}, booktitle = {Proceedings of S+SSPR 2008}, pages = {227-236} , year = {2008}, theme= {shape}, address = {Orlando}, abstract={Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where until recently solely reserved to numerical data. Within the shape classification framework, graphs are often produced by a skeletonization step which is sensitive to noise. We propose in this paper to integrate the robustness to structural noise by using a kernel based on a bag of path where each path is associated to a hierarchy encoding successive simplifications of the path. Several experiments prove the robustness and the flexibility of our approach compared to alternative shape classification methods.}, url={paper(pdf):=http://www.greyc.ensicaen.fr/~luc/ARTICLES/sspr2008.pdf} } @InProceedings{CN-DUPE-2009, author = {Francois-Xavier Dup'e and Luc Brun}, title = {Classification de formes avec un noyau sur graphes flexible et robuste au bruit}, booktitle = {Proceedings of RFIA'2010}, year = 2010, address = {Caen}, month = {January}, organization = {AFRIF}, theme={shape}, abstract={La squelettisation par axe median etant une transformation homotopique, le squelette d'une forme 2D correspond à un graphe planaire dont les faces codent les trous et les sommets chaque jonction et extrémite. Ce graphe n'est pas un graphe simple, car compose de boucles internes et d'aretes multiples a cause des trous. Dans le cadre de la comparaison de formes, celui-ci est souvent transforme en une structure plus simple comme un arbre ou un graphe simple, perdant de ce fait des informations importantes sur la forme. Dans ce papier, nous proposons un noyau sur graphes combinant un noyau sur sacs de chemins et un noyau sur faces. Les chemins sont definis à partir du graphe non simple et le noyau sur chemins est renforce par un processus d'edition. Le noyau sur faces reflete l'importance des trous dans une forme, cette information pouvant être une caracteristique importante de la forme. Le noyau resultant est un noyau defini positif, competitif avec les noyaux proposes dans l'etat de l'art.} }