Search

We describe BrainSync, an orthogonal transform that allows direct comparison of resting fMRI (rfMRI) time-series across subjects. For this purpose, we exploit the geometry of the rfMRI signal space to propose a novel orthogonal transformation that synchronizes rfMRI time-series across sessions and subjects. When synchronized, rfMRI signals become approximately equal at homologous locations across subjects. The method is based on the observation that rfMRI data exhibit similar connectivity patterns across subjects, as reflected in the pairwise correlations between different brain regions. We show that if the data for two subjects have similar correlation patterns then their time courses can be approximately synchronized by an orthogonal transformation. This transform is unique, invertible, efficient to compute, and preserves the connectivity structure of the original data for all subjects. Analogously to image registration, where we spatially align structural brain images, this temporal synchronization of brain signals across a population, or within-subject across sessions, facilitates cross-sectional and longitudinal studies of rfMRI data. The utility of the BrainSync transform is illustrated through demonstrative simulations and applications including quantification of rfMRI variability across subjects and sessions, cortical functional parcellation across a population, timing recovery in task fMRI data, comparison of task and resting state data, and an application to complex naturalistic stimuli for annotation prediction.

In this article, we describe a detailed method for automatically generating tetrahedral meshes from 3D images having multiple region labels. An adaptively sized tetrahedral mesh modeling approach is described that is capable of producing meshes conforming precisely to the voxelized regions in the image. Efficient tetrahedral mesh improvement is then performed minimizing an energy function containing three terms: a smoothing term to remove the voxelization, a fidelity term to maintain continuity with the image data, and a novel elasticity term to prevent the tetrahedra from becoming flattened or inverted as the mesh deforms while allowing the voxelization to be removed entirely. The meshing algorithm is applied to structural MR image data that has been automatically segmented into 56 neuroanatomical sub-divisions as well as on two other examples. The resulting tetrahedral representation has several desirable properties such as tetrahedra with dihedral angles away from 0 and 180 degrees, smoothness, and a high resolution. Tetrahedral modeling via the approach described here has applications in modeling brain structure in normal as well as diseased brain in human and non-human data and facilitates examination of 3D object deformations resulting from neurological illness (e.g. Alzheimer's disease), development, and/or aging.

Flat mapping based cortical surface registration constrained by manually traced sulcal curves has been widely used for inter subject comparisons of neuroanatomical data. Even for an experienced neuroanatomist, manual sulcal tracing can be quite time consuming, with the cost increasing with the number of sulcal curves used for registration. We present a method for estimation of an optimal subset of size N(C) from N possible candidate sulcal curves that minimizes a mean squared error metric over all combinations of N(C) curves. The resulting procedure allows us to estimate a subset with a reduced number of curves to be traced as part of the registration procedure leading to optimal use of manual labeling effort for registration. To minimize the error metric we analyze the correlation structure of the errors in the sulcal curves by modeling them as a multivariate Gaussian distribution. For a given subset of sulci used as constraints in surface registration, the proposed model estimates registration error based on the correlation structure of the sulcal errors. The optimal subset of constraint curves consists of the N(C) sulci that jointly minimize the estimated error variance for the subset of unconstrained curves conditioned on the N(C) constraint curves. The optimal subsets of sulci are presented and the estimated and actual registration errors for these subsets are computed.

Signal and Image Processing Institute, University of Southern California, Los Angeles Division of Communication and Auditory Neuroscience, House Ear Institute, Los Angeles Laboratory of Neuro Imaging, Department of Neurology, David Geffen School of Medicine at UCLA, Los Angeles Psychology Department & Neuroscience Graduate Program, University of Southern California, Los Angeles Dornsife Cognitive Neuroscience Imaging Center, University of Southern California, Los Angeles Brain and Creativity Institute, University of Southern California, Los Angeles, CA 90089