title: Fast Optimal Transport Averaging of Neuroimaging Data.
abstract: Knowing how the Human brain is anatomically and functionally organized at the level of a group of healthy individuals or patients is the primary goal of neuroimaging research. Yet computing an average of brain imaging data defined over a voxel grid or a triangulation remains a challenge. Data are large, the geometry of the brain is complex and the between subjects variability leads to spatially or temporally non-overlapping effects of interest. To address the problem of variability, data are commonly smoothed before performing a linear group averaging. In this work we build on ideas originally introduced by Kantorovich to propose a new algorithm that can average efficiently non-normalized data defined over arbitrary discrete domains using transportation metrics. We show how Kantorovich means can be linked to Wasserstein barycenters in order to take advantage of the entropic smoothing approach used by. It leads to a smooth convex optimization problem and an algorithm with strong convergence guarantees. We illustrate the versatility of this tool and its empirical behavior on functional neuroimaging data, functional MRI and magnetoencephalography (MEG) source estimates, defined on voxel grids and triangulations of the folded cortical surface.
authors.forename: A
authors.initials: A
authors.lastname: Gramfort
authors.forename: G
authors.initials: G
authors.lastname: Peyré
authors.forename: M
authors.initials: M
authors.lastname: Cuturi
mesh_terms: D000465:Algorithms; D001921:Brain / Q000033:anatomy & histology* / Q000502:physiology*; D001931:Brain Mapping / Q000379:methods*; D006801:Humans; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D008279:Magnetic Resonance Imaging / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity