Supervized segmentation with graph-structured deep metric learning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Supervized segmentation with graph-structured deep metric learning

Résumé

We present a fully-supervized method for learning to segment data structured by an adjacency graph. We introduce the graph-structured contrastive loss, a loss function structured by a ground truth segmentation. It promotes learning vertex embed-dings which are homogeneous within desired segments , and have high contrast at their interface. Thus, computing a piecewise-constant approximation of such embeddings produces a graph-partition close to the objective segmentation. This loss is fully backpropagable, which allows us to learn vertex embeddings with deep learning algorithms. We evaluate our methods on a 3D point cloud oversegmentation task, defining a new state-of-the-art by a large margin. These results are based on the published work of Landrieu & Bous-saha (2019).
Fichier principal
Vignette du fichier
1905.04014.pdf (3.62 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03016114 , version 1 (20-11-2020)

Identifiants

  • HAL Id : hal-03016114 , version 1

Citer

Loic Landrieu, Mohamed Boussaha. Supervized segmentation with graph-structured deep metric learning. ICML Workshop on Learning and Reasoning with Graph-Structured Representations, Jun 2019, Long Beach (CA), United States. ⟨hal-03016114⟩

Collections

IGN-ENSG
33 Consultations
14 Téléchargements

Partager

Gmail Facebook X LinkedIn More