Solving the Cross-Subject Parcel Matching Problem using Optimal Transport - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Solving the Cross-Subject Parcel Matching Problem using Optimal Transport

Résumé

Matching structural parcels across different subjects is an open problem in neuroscience. Even when produced by the same technique , parcellations tend to differ in the number, shape, and spatial lo-calization of parcels across subjects. In this work, we propose a parcel matching method based on Optimal Transport. We test its performance by matching parcels of the Desikan atlas, parcels based on a functional criteria and structural parcels. We compare our technique against three other ways to match parcels which are based on the Euclidean distance, the cosine similarity, and the Kullback-Leibler divergence. Our results show that our method achieves the highest number of correct matches.
Fichier principal
Vignette du fichier
GallardoGayraud2018.pdf (1.32 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01935684 , version 1 (27-11-2018)

Identifiants

  • HAL Id : hal-01935684 , version 1

Citer

Guillermo Gallardo, Nathalie Gayraud, Rachid Deriche, Maureen Clerc, Samuel Deslauriers-Gauthier, et al.. Solving the Cross-Subject Parcel Matching Problem using Optimal Transport. International Conference on Medical Image Computing and Computer-Assisted Intervention 2018, Sep 2018, Granada, Spain. ⟨hal-01935684⟩
175 Consultations
215 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More