8,777 research outputs found
Tensor Analysis and Fusion of Multimodal Brain Images
Current high-throughput data acquisition technologies probe dynamical systems
with different imaging modalities, generating massive data sets at different
spatial and temporal resolutions posing challenging problems in multimodal data
fusion. A case in point is the attempt to parse out the brain structures and
networks that underpin human cognitive processes by analysis of different
neuroimaging modalities (functional MRI, EEG, NIRS etc.). We emphasize that the
multimodal, multi-scale nature of neuroimaging data is well reflected by a
multi-way (tensor) structure where the underlying processes can be summarized
by a relatively small number of components or "atoms". We introduce
Markov-Penrose diagrams - an integration of Bayesian DAG and tensor network
notation in order to analyze these models. These diagrams not only clarify
matrix and tensor EEG and fMRI time/frequency analysis and inverse problems,
but also help understand multimodal fusion via Multiway Partial Least Squares
and Coupled Matrix-Tensor Factorization. We show here, for the first time, that
Granger causal analysis of brain networks is a tensor regression problem, thus
allowing the atomic decomposition of brain networks. Analysis of EEG and fMRI
recordings shows the potential of the methods and suggests their use in other
scientific domains.Comment: 23 pages, 15 figures, submitted to Proceedings of the IEE
Fast Optimal Transport Averaging of Neuroimaging Data
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 group linear
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 an entropic smoothing approach. 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.Comment: Information Processing in Medical Imaging (IPMI), Jun 2015, Isle of
Skye, United Kingdom. Springer, 201
- …