Graph kernels between point clouds - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Graph kernels between point clouds

Résumé

Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and practical constraints associated with point clouds in computer vision and graphics. In this paper, we present extensions of graph kernels for point clouds, which allow to use kernel methods for such ob jects as shapes, line drawings, or any three-dimensional point clouds. In order to design rich and numerically efficient kernels with as few free parameters as possible, we use kernels between covariance matrices and their factorizations on graphical models. We derive polynomial time dynamic programming recursions and present applications to recognition of handwritten digits and Chinese characters from few training examples.
Fichier principal
Vignette du fichier
hal_point_clouds.pdf (201.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00200109 , version 1 (20-12-2007)

Identifiants

Citer

Francis Bach. Graph kernels between point clouds. 2007. ⟨hal-00200109⟩
193 Consultations
108 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More