A DTI-Derived Measure of Cortico-Cortical Connectivity

We arm researchers with a simple method to chart a macroscopic cortico-cortical connectivity network in living human subjects. The researcher provides a diffusion-magnetic resonance imaging (MRI) data set and $N$ cortical regions of interest. In return, we provide an $N times N$ structural adjacency matrix (SAM) quantifying the relative connectivity between all cortical region pairs. We also return a connectivity map for each pair to enable visualization of interconnecting fiber bundles. The measure of connectivity we devise is: 1) free of length bias, 2) proportional to fiber bundle cross-sectional area, and 3) invariant to an exchange of seed and target. We construct a 3-D lattice scaffolding (graph) for white-matter by drawing a link between each pair of voxels in a 26-voxel neighborhood for which their two respective principal eigenvectors form a sufficiently small angle. The connectivity between a cortical region pair is then measured as the maximum number of link-disjoint paths that can be established between them in the white-matter graph. We devise an efficient Edmonds–Karp-like algorithm to compute a conservative bound on the maximum number of link-disjoint paths. Using both simulated and authentic diffusion-tensor imaging data, we demonstrate that the number of link-disjoint paths as a measure of connectivity satisfies properties 1)–3), unlike the fraction of intersecting streamlines—the measure intrinsic to most existing probabilistic tracking algorithms. Finally, we present connectivity maps of some notoriously difficult to track longitudinal and contralateral fasciculi.      

Aggregate input-output models of neuronal populations

An extraordinary amount of electrophysiological data has been collected from various brain nuclei to help us understand how neural activity in one region influences another region. In this paper, we exploit the point process modeling (PPM) framework and describe a method for constructing aggregate input-output (IO) stochastic models that predict spiking activity of a population of neurons in the "output" region as a function of the spiking activity of a population of neurons in the "input" region. We first build PPMs of each output neuron as a function of all input neurons, and then cluster the output neurons using the model parameters. Output neurons that lie within the same cluster have the same functional dependence on the input neurons. We first applied our method to simulated data, and successfully uncovered the predetermined relationship between the two regions. We then applied our method to experimental data to understand the input-output relationship between motor cortical neurons and 1) somatosensory and 2) premotor cortical neurons during a behavioral task. Our aggregate IO models highlighted interesting physiological dependences including relative effects of inhibition/excitation from input neurons and extrinsic factors on output neurons.     

Image-Driven Population Analysis Through Mixture Modeling

We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of the algorithm is a small number of template images that represent different modes in a population. This is in contrast with traditional, hypothesis-driven computational anatomy approaches that assume a single template to construct an atlas. We derive the algorithm based on a generative model of an image population as a mixture of deformable template images. We validate and explore our method in four experiments. In the first experiment, we use synthetic data to explore the behavior of the algorithm and inform a design choice on parameter settings. In the second experiment, we demonstrate the utility of having multiple atlases for the application of localizing temporal lobe brain structures in a pool of subjects that contains healthy controls and schizophrenia patients. Next, we employ iCluster to partition a data set of 415 whole brain MR volumes of subjects aged 18 through 96 years into three anatomical subgroups. Our analysis suggests that these subgroups mainly correspond to age groups. The templates reveal significant structural differences across these age groups that confirm previous findings in aging research. In the final experiment, we run iCluster on a group of 15 patients with dementia and 15 age-matched healthy controls. The algorithm produces two modes, one of which contains dementia patients only. These results suggest that the algorithm can be used to discover subpopulations that correspond to interesting structural or functional “modes.”      

A Connectivity-Based Method for Defining Regions-of-Interest in fMRI Data

In this paper, we describe a new methodology for defining brain regions-of-interset (ROIs) in functional magnetic resonance imaging (fMRI) data. The ROIs are defined based on their functional connectivity to other ROIs, i.e., ROIs are defined as sets of voxels with similar connectivity patterns to other ROIs. The method relies on 1) a spatially regularized canonical correlation analysis for identifying maximally correlated signals, which are not due to correlated noise; 2) a test for merging ROIs which have similar connectivity patterns to the other ROIs; and 3) a graph-cuts optimization for assigning voxels to ROIs. Since our method is fully connectivity-based, the extracted ROIs and their corresponding time signals are ideally suited for a subsequent brain connectivity analysis.      

Probabilistic framework for brain connectivity from functional MR images

This paper unifies our earlier work on detection of brain activation (Rajapakse and Piyaratna, 2001) and connectivity (Rajapakse and Zhou, 2007) in a probabilistic framework for analyzing effective connectivity among activated brain regions from functional magnetic resonance imaging (fMRI) data. Interactions among brain regions are expressed by a dynamic Bayesian network (DBN) while contextual dependencies within functional images are formulated by a Markov random field. The approach simultaneously considers both the detection of brain activation and the estimation of effective connectivity and does not require a priori model of connectivity. Experimental results show that the present approach outperforms earlier fMRI analysis techniques on synthetic functional images and robustly derives brain connectivity from real fMRI data.     

A model selection method for nonlinear system identification based FMRI effective connectivity analysis

In this paper a model selection algorithm for a nonlinear system identification method is proposed to study functional magnetic resonance imaging (fMRI) effective connectivity. Unlike most other methods, this method does not need a pre-defined structure/model for effective connectivity analysis. Instead, it relies on selecting significant nonlinear or linear covariates for the differential equations to describe the mapping relationship between brain output (fMRI response) and input (experiment design). These covariates, as well as their coefficients, are estimated based on a least angle regression (LARS) method. In the implementation of the LARS method, Akaike's information criterion corrected (AICc) algorithm and the leave-one-out (LOO) cross-validation method were employed and compared for model selection. Simulation comparison between the dynamic causal model (DCM), nonlinear identification method, and model selection method for modelling the single-input-single-output (SISO) and multiple-input multiple-output (MIMO) systems were conducted. Results show that the LARS model selection method is faster than DCM and achieves a compact and economic nonlinear model simultaneously. To verify the efficacy of the proposed approach, an analysis of the dorsal and ventral visual pathway networks was carried out based on three real datasets. The results show that LARS can be used for model selection in an fMRI effective connectivity study with phase-encoded, standard block, and random block designs. It is also shown that the LOO cross-validation method for nonlinear model selection has less residual sum squares than the AICc algorithm for the study.     

A statistical analysis of brain morphology using wild bootstrapping

Methods for the analysis of brain morphology, including voxel-based morphology and surface-based morphometries, have been used to detect associations between brain structure and covariates of interest, such as diagnosis, severity of disease, age, IQ, and genotype. The statistical analysis of morphometric measures usually involves two statistical procedures: 1) invoking a statistical model at each voxel (or point) on the surface of the brain or brain subregion, followed by mapping test statistics (e.g., t test) or their associated p values at each of those voxels; 2) correction for the multiple statistical tests conducted across all voxels on the surface of the brain region under investigation. We propose the use of new statistical methods for each of these procedures. We first use a heteroscedastic linear model to test the associations between the morphological measures at each voxel on the surface of the specified subregion (e.g., cortical or subcortical surfaces) and the covariates of interest. Moreover, we develop a robust test procedure that is based on a resampling method, called wild bootstrapping. This procedure assesses the statistical significance of the associations between a measure of given brain structure and the covariates of interest. The value of this robust test procedure lies in its computationally simplicity and in its applicability to a wide range of imaging data, including data from both anatomical and functional magnetic resonance imaging (fMRI). Simulation studies demonstrate that this robust test procedure can accurately control the family-wise error rate. We demonstrate the application of this robust test procedure to the detection of statistically significant differences in the morphology of the hippocampus over time across gender groups in a large sample of healthy subjects.     

Removal of spurious coherence in MEG source-space coherence analysis

Source-space coherence analysis has become a popular method to estimate functional connectivity based on MEG/EEG. Source-space analysis involves solving the inverse problem, estimating the time courses of specific brain regions, and then examining the coherence between activities at different brain regions. However, source-space coherence analysis can be confounded by spurious coherence caused due to the leakage properties of the inverse algorithm employed. Such spurious coherence is typically manifested as an artifactual large peak around the seed voxel, called seed blur, in the resulting coherence images. This seed blur often obscures important details of brain interactions. This paper proposes the use of the imaginary part of the coherence to remove the spurious coherence caused by the leakage of an imaging algorithm. We present a theoretical analysis that explains how the use of imaginary part can remove this spurious coherence. We then present results from both computer simulations and experiments using resting-state MEG data which demonstrate the validity of our analysis.     

Neural networks approach to clustering of activity in fMRI data

Clusters of correlated activity in functional magnetic resonance imaging data can identify regions of interest and indicate interacting brain areas. Because the extraction of clusters is computationally complex, we apply an approximative method which is based on artificial neural networks. It allows one to find clusters of various degrees of connectivity ranging between the two extreme cases of cliques and connectivity components. We propose a criterion which allows to evaluate the relevance of such structures based on the robustness with respect to parameter variations. Exploiting the intracluster correlations, we can show that regions of substantial correlation with an external stimulus can be unambiguously separated from other activity.     

通信辐射源的潜在细微特征提取方法

为了充分挖掘高维特征空间中辐射源的细微特征, 提出一种基于全局潜在低秩表示(Global Latent Low Rank Representation, GLat-LRR)的通信辐射源潜在细微特征提取方法.首先, 提取通信辐射源信号的瞬时频率, 通过傅里叶变换将信号投影到高维特征空间; 挖掘特征样本之间全局的低秩结构和维度之间全局的潜在低秩关系, 将特征样本集作为整体应用到潜在低秩表示模型中, 利用维度之间低秩关系得到特征样本集的潜在部分矩阵, 每个列向量即为每个通信辐射源信号的潜在细微特征向量.在实际采集的同厂家同型号FM电台数据集上, 该方法提取的潜在细微特征能够显著提高通信辐射源个体识别的性能.     

Exact Bayesian curve fitting and signal segmentation

We consider regression models where the underlying functional relationship between the response and the explanatory variable is modeled as independent linear regressions on disjoint segments. We present an algorithm for perfect simulation from the posterior distribution of such a model, even allowing for an unknown number of segments and an unknown model order for the linear regressions within each segment. The algorithm is simple, can scale well to large data sets, and avoids the problem of diagnosing convergence that is present with Monte Carlo Markov Chain (MCMC) approaches to this problem. We demonstrate our algorithm on standard denoising problems, on a piecewise constant AR model, and on a speech segmentation problem.     

Estimating distances via connectivity in wireless sensor networks

Distance estimation is vital for localization and many other applications in wireless sensor networks. In this paper, we develop a method that employs a maximum‐likelihood estimator to estimate distances between a pair of neighboring nodes in a static wireless sensor network using their local connectivity information, namely the numbers of their common and non‐common one‐hop neighbors. We present the distance estimation method under a generic channel model, including the unit disk (communication) model and the more realistic log‐normal (shadowing) model as special cases. Under the log‐normal model, we investigate the impact of the log‐normal model uncertainty; we numerically evaluate the bias and standard deviation associated with our method, which show that for long distances our method outperforms the method based on received signal strength; and we provide a Cramér–Rao lower bound analysis for the problem of estimating distances via connectivity and derive helpful guidelines for implementing our method. Finally, on implementing the proposed method on the basis of measurement data from a realistic environment and applying it in connectivity‐based sensor localization, the advantages of the proposed method are confirmed. Copyright © 2012 John Wiley & Sons, Ltd.     

Group Study of Simulated Driving fMRI Data by Multiset Canonical Correlation Analysis

In this work, we apply a novel statistical method, multiset canonical correlation analysis (M-CCA), to study a group of functional magnetic resonance imaging (fMRI) datasets acquired during simulated driving task. The M-CCA method jointly decomposes fMRI datasets from different subjects/sessions into brain activation maps and their associated time courses, such that the correlation in each group of estimated activation maps across datasets is maximized. Therefore, the functional activations across all datasets are extracted in the order of consistency across different dataset. On the other hand, M-CCA preserves the uniqueness of the functional maps estimated from each dataset by avoiding concatenation of different datasets in the analysis. Hence, the cross-dataset variation of the functional activations can be used to test the hypothesis of functional-behavioral association. In this work, we study 120 simulated driving fMRI datasets and identify parietal-occipital regions and frontal lobe as the most consistently engaged areas across all the subjects and sessions during simulated driving. The functional-behavioral association study indicates that all the estimated brain activations are significantly correlated with the steering operation during the driving task. M-CCA thus provides a new approach to investigate the complex relationship between the brain functions and multiple behavioral variables, especially in naturalistic tasks as demonstrated by the simulated driving study.     

Distributed source coding for satellite communications

Inspired by mobile satellite communications systems, we consider a source coding system which consists of multiple sources, multiple encoders, and multiple decoders. Each encoder has access to a certain subset of the sources, each decoder has access to certain subset of the encoders, and each decoder reconstructs a certain subset of the sources almost perfectly. The connectivity between the sources and the encoders, the connectivity between the encoders and the decoders, and the reconstruction requirements for the decoders are all arbitrary. Our goal is to characterize the admissible coding rate region. Despite the generality of the problem, we have developed an approach which enables us to study all cases on the same footing. We obtain inner and outer bounds of the admissible coding rate region in terms of Γ_N * and Γ¯_N*, respectively, which are fundamental regions in the entropy space defined by Yeung (1991). So far, there has not been a full characterization of Γ_N*, so these bounds cannot be evaluated explicitly except for some special cases. Nevertheless, we obtain an alternative outer bound which can be evaluated explicitly. We show that this bound is tight for all the special cases for which the admissible coding rate region is known. The model we study in this paper is more general than all previously reported models on multilevel diversity coding, and the tools we use are new in multiuser information theory     

Joint Blind Source Separation by Multiset Canonical Correlation Analysis

In this paper, we introduce a simple and effective scheme to achieve joint blind source separation (BSS) of multiple datasets using multiset canonical correlation analysis (M-CCA) [J. R. Kettenring, "Canonical analysis of several sets of variables", Biometrika, vol. 58, pp. 433-451, 1971]. We first propose a generative model of joint BSS based on the correlation of latent sources within and between datasets. We specify source separability conditions, and show that, when the conditions are satisfied, the group of corresponding sources from each dataset can be jointly extracted by M-CCA through maximization of correlation among the extracted sources. We compare source separation performance of the M-CCA scheme with other joint BSS methods and demonstrate the superior performance of the M-CCA scheme in achieving joint BSS for a large number of datasets, group of corresponding sources with heterogeneous correlation values, and complex-valued sources with circular and non-circular distributions. We apply M-CCA to analysis of functional magnetic resonance imaging (fMRI) data from multiple subjects and show its utility in estimating meaningful brain activations from a visuomotor task.     

Abnormal Basal Ganglia Functional Connectivity in Idiopathic Generalized Epilepsy

The basal ganglia have been implicated in a modulation role in idiopathic generalized epilepsy (IGE) by an invasive electrophysioigic means.This paper investigates the basal ganglia functional connectivity by using the region-wise functional connection analysis in resting-state functional magnetic resonance imaging (fMRi) in IGE.The increased functional connectivity within basal ganglia,and between the basal ganglia and the thalamus,and decreased functional connectivity between basal ganglia and motor cortex are found in IGE compared with the controls. These findings not only implicate dysfunctional integration in the motor loop in IGE and the enhanced interaction in the modulated loop,but also suggest that the basal ganglia modulate the generalized epileptic discharges with the influence over thalamus in the corticothalamus network.     

Analytical Model for Connectivity in Vehicular Ad Hoc Networks

We investigate connectivity in the ad hoc network formed between vehicles that move on a typical highway. We use a common model in vehicular traffic theory in which a fixed point on the highway sees cars passing it that are separated by times with an exponentially distributed duration. We obtain the distribution of the distances between the cars, which allows us to use techniques from queuing theory to study connectivity. We obtain the Laplace transform of the probability distribution of the connectivity distance, explicit expressions for the expected connectivity distance, and the probability distribution and expectation of the number of cars in a platoon. Then, we conduct extensive simulation studies to evaluate the obtained results. The analytical model that we present is able to describe the effects of various system parameters, including road traffic parameters (i.e., speed distribution and traffic flow) and the transmission range of vehicles, on the connectivity. To more precisely study the effect of speed on connectivity, we provide bounds obtained using stochastic ordering techniques. Our approach is based on the work of Miorandi and Altman, which transformed the problem of connectivity distance distribution into that of the distribution of the busy period of an equivalent infinite server queue. We use our analytical results, along with common road traffic statistical data, to understand connectivity in vehicular ad hoc networks.      

Three-dimensional multimodal brain warping using the demons algorithm and adaptive intensity corrections

This paper presents an original method for three-dimensional elastic registration of multimodal images. We propose to make use of a scheme that iterates between correcting for intensity differences between images and performing standard monomodal registration. The core of our contribution resides in providing a method that finds the transformation that maps the intensities of one image to those of another. It makes the assumption that there are at most two functional dependencies between the intensities of structures present in the images to register, and relies on robust estimation techniques to evaluate these functions. We provide results showing successful registration between several imaging modalities involving segmentations, T1 magnetic resonance (MR), T2 MR, proton density (PD) MR and computed tomography (CT). We also argue that our intensity modeling may be more appropriate than mutual information (MI) in the context of evaluating high-dimensional deformations, as it puts more constraints on the parameters to be estimated and, thus, permits a better search of the parameter space.     

Kernel Granger Causality Mapping Effective Connectivity on fMRI Data

Although it is accepted that linear Granger causality can reveal effective connectivity in functional magnetic resonance imaging (fMRI), the issue of detecting nonlinear connectivity has hitherto not been considered. In this paper, we address kernel Granger causality (KGC) to describe effective connectivity in simulation studies and real fMRI data of a motor imagery task. Based on the theory of reproducing kernel Hilbert spaces, KGC performs linear Granger causality in the feature space of suitable kernel functions, assuming an arbitrary degree of nonlinearity. Our results demonstrate that KGC captures effective couplings not revealed by the linear case. In addition, effective connectivity networks between the supplementary motor area (SMA) as the seed and other brain areas are obtained from KGC.