Solving the Cross-Subject Parcel Matching Problem using Optimal Transport

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
Contributor : Guillermo Gallardo <>
Submitted on : Tuesday, November 27, 2018 - 6:58:55 AM
Last modification on : Monday, February 10, 2020 - 6:13:44 PM
Long-term archiving on: Thursday, February 28, 2019 - 12:29:46 PM


Files produced by the author(s)


  • HAL Id : hal-01935684, version 1


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⟩



Record views


Files downloads