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 localization 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.
CITATION STYLE
Gallardo, G., Gayraud, N. T. H., Deriche, R., Clerc, M., Deslauriers-Gauthier, S., & Wassermann, D. (2018). Solving the cross-subject parcel matching problem using optimal transport. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11070 LNCS, pp. 836–843). Springer Verlag. https://doi.org/10.1007/978-3-030-00928-1_94
Mendeley helps you to discover research relevant for your work.