Event-related microstate dynamics represents working memory performance.

In recent years, EEG microstate analysis has attracted much attention as a tool for characterizing the spatial and temporal dynamics of large-scale electrophysiological activities in the human brain. Canonical 4 states (classes A, B, C, and D) have been widely reported, and they have been pointed out for their relationships with cognitive functions and several psychiatric disorders such as schizophrenia, in particular, through their static parameters such as average duration, occurrence, coverage, and transition probability. However, the relationships between event-related microstate changes and their related cognitive functions, as is often analyzed in event-related potentials under time-locked frameworks, is still not well understood. Furthermore, not enough attention has been paid to the relationship between microstate dynamics and static characteristics. To clarify the relationships between the static microstate parameters and dynamic microstate changes, and between the dynamics and working memory (WM) function, we first examined the temporal profiles of the microstates during the N-back task. We found significant event-related microstate dynamics that differed predominantly with WM loads, which were not clearly observed in the static parameters. Furthermore, in the 2-back condition, patterns of state transitions from class A to C in the high- and low-performance groups showed prominent differences at 50-300 ms after stimulus onset. We also confirmed that the transition patterns of the specific time periods were able to predict the performance level (low or high) in the 2-back condition at a significant level, where a specific transition between microstates, namely from class A to C with specific polarity, contributed to the prediction robustly. Taken together, our findings indicate that event-related microstate dynamics at 50-300 ms after onset may be essential for WM function. This suggests that event-related microstate dynamics can reflect more highly-refined brain functions.

Asymmetric directed functional connectivity within the frontoparietal motor network during motor imagery and execution.

Both imagery and execution of motor control consist of interactions within a neuronal network, including frontal motor-related and posterior parietal regions. To reveal neural representation in the frontoparietal motor network, two approaches have been proposed thus far: one is decoding of actions/modes related to motor control from the spatial pattern of brain activity; and the other is estimating directed functional connectivity (a directed association between two brain regions within motor areas). However, directed connectivity among multiple regions of the frontoparietal motor network during motor imagery (MI) or motor execution (ME) has not been investigated. Here, we attempted to characterize the directed functional connectivity representing the MI and ME conditions. We developed a delayed sequential movement and imagery task to evoke brain activity associated with ME and MI, which can be recorded by functional magnetic resonance imaging. We applied a causal discovery approach, a linear non-Gaussian acyclic causal model, to identify directed functional connectivity among the frontoparietal motor-related brain regions for each condition. We demonstrated higher directed functional connectivity from the contralateral dorsal premotor cortex (dPMC) to the primary motor cortex (M1) in ME than in MI. We further identified significant direct effects of the dPMC and ventral premotor cortex (vPMC) to the parietal regions. In particular, connectivity from the dPMC to the superior parietal lobule (SPL) in the same hemisphere showed significant positive effects across all conditions, while interlateral connectivities from the vPMC to the SPL showed significantly negative effects across all conditions. Finally, we found positive effects from A1 to M1, that is, the audio-motor pathway, in the same hemisphere. These results indicate that the sources of motor command originating in the d/vPMC influenced the M1 and parietal regions for achieving ME and MI. Additionally, sequential sounds may functionally facilitate temporal motor processes.

Orthogonal Connectivity Factorization: Interpretable Decomposition of Variability in Correlation Matrices.

In many multivariate time series, the correlation structure is nonstationary, that is, it changes over time. The correlation structure may also change as a function of other cofactors, for example, the identity of the subject in biomedical data. A fundamental approach for the analysis of such data is to estimate the correlation structure (connectivities) separately in short time windows or for different subjects and use existing machine learning methods, such as principal component analysis (PCA), to summarize or visualize the changes in connectivity. However, the visualization of such a straightforward PCA is problematic because the ensuing connectivity patterns are much more complex objects than, say, spatial patterns. Here, we develop a new framework for analyzing variability in connectivities using the PCA approach as the starting point. First, we show how to analyze and visualize the principal components of connectivity matrices by a tailor-made rank-two matrix approximation in which we use the outer product of two orthogonal vectors. This leads to a new kind of transformation of eigenvectors that is particularly suited for this purpose and often enables interpretation of the principal component as connectivity between two groups of variables. Second, we show how to incorporate the orthogonality and the rank-two constraint in the estimation of PCA itself to improve the results. We further provide an interpretation of these methods in terms of estimation of a probabilistic generative model related to blind separation of dependent sources. Experiments on brain imaging data give very promising results.

Learning a common dictionary for subject-transfer decoding with resting calibration.

Brain signals measured over a series of experiments have inherent variability because of different physical and mental conditions among multiple subjects and sessions. Such variability complicates the analysis of data from multiple subjects and sessions in a consistent way, and degrades the performance of subject-transfer decoding in a brain-machine interface (BMI). To accommodate the variability in brain signals, we propose 1) a method for extracting spatial bases (or a dictionary) shared by multiple subjects, by employing a signal-processing technique of dictionary learning modified to compensate for variations between subjects and sessions, and 2) an approach to subject-transfer decoding that uses the resting-state activity of a previously unseen target subject as calibration data for compensating for variations, eliminating the need for a standard calibration based on task sessions. Applying our methodology to a dataset of electroencephalography (EEG) recordings during a selective visual-spatial attention task from multiple subjects and sessions, where the variability compensation was essential for reducing the redundancy of the dictionary, we found that the extracted common brain activities were reasonable in the light of neuroscience knowledge. The applicability to subject-transfer decoding was confirmed by improved performance over existing decoding methods. These results suggest that analyzing multisubject brain activities on common bases by the proposed method enables information sharing across subjects with low-burden resting calibration, and is effective for practical use of BMI in variable environments.

Decoding spatial attention by using cortical currents estimated from electroencephalography with near-infrared spectroscopy prior information.

For practical brain-machine interfaces (BMIs), electroencephalography (EEG) and near-infrared spectroscopy (NIRS) are the only current methods that are non-invasive and available in non-laboratory environments. However, the use of EEG and NIRS involves certain inherent problems. EEG signals are generally a mixture of neural activity from broad areas, some of which may not be related to the task targeted by BMI, hence impairing BMI performance. NIRS has an inherent time delay as it measures blood flow, which therefore detracts from practical real-time BMI utility. To try to improve real environment EEG-NIRS-based BMIs, we propose here a novel methodology in which the subjects' mental states are decoded from cortical currents estimated from EEG, with the help of information from NIRS. Using a Variational Bayesian Multimodal EncephaloGraphy (VBMEG) methodology, we incorporated a novel form of NIRS-based prior to capture event related desynchronization from isolated current sources on the cortical surface. Then, we applied a Bayesian logistic regression technique to decode subjects' mental states from further sparsified current sources. Applying our methodology to a spatial attention task, we found our EEG-NIRS-based decoder exhibited significant performance improvement over decoding methods based on EEG sensor signals alone. The advancement of our methodology, decoding from current sources sparsely isolated on the cortex, was also supported by neuroscientific considerations; intraparietal sulcus, a region known to be involved in spatial attention, was a key responsible region in our task. These results suggest that our methodology is not only a practical option for EEG-NIRS-based BMI applications, but also a potential tool to investigate brain activity in non-laboratory and naturalistic environments.

Robust common spatial filters with a max-min approach.

Electroencephalographic signals are known to be nonstationary and easily affected by artifacts; therefore, their analysis requires methods that can deal with noise. In this work, we present a way to robustify the popular common spatial patterns (CSP) algorithm under a maxmin approach. In contrast to standard CSP that maximizes the variance ratio between two conditions based on a single estimate of the class covariance matrices, we propose to robustly compute spatial filters by maximizing the minimum variance ratio within a prefixed set of covariance matrices called the tolerance set. We show that this kind of maxmin optimization makes CSP robust to outliers and reduces its tendency to overfit. We also present a data-driven approach to construct a tolerance set that captures the variability of the covariance matrices over time and shows its ability to reduce the nonstationarity of the extracted features and significantly improve classification accuracy. We test the spatial filters derived with this approach and compare them to standard CSP and a state-of-the-art method on a real-world brain-computer interface (BCI) data set in which we expect substantial fluctuations caused by environmental differences. Finally we investigate the advantages and limitations of the maxmin approach with simulations.

On the interpretation of linear Riemannian tangent space model parameters in M/EEG.

Riemannian tangent space methods offer state-of-the-art performance in magnetoencephalography (MEG) and electroencephalography (EEG) based applications such as brain-computer interfaces and biomarker development. One limitation, particularly relevant for biomarker development, is limited model interpretability compared to established component-based methods. Here, we propose a method to transform the parameters of linear tangent space models into interpretable patterns. Using typical assumptions, we show that this approach identifies the true patterns of latent sources, encoding a target signal. In simulations and two real MEG and EEG datasets, we demonstrate the validity of the proposed approach and investigate its behavior when the model assumptions are violated. Our results confirm that Riemannian tangent space methods are robust to differences in the source patterns across observations. We found that this robustness property also transfers to the associated patterns.

Interpretable brain age prediction using linear latent variable models of functional connectivity.

Neuroimaging-driven prediction of brain age, defined as the predicted biological age of a subject using only brain imaging data, is an exciting avenue of research. In this work we seek to build models of brain age based on functional connectivity while prioritizing model interpretability and understanding. This way, the models serve to both provide accurate estimates of brain age as well as allow us to investigate changes in functional connectivity which occur during the ageing process. The methods proposed in this work consist of a two-step procedure: first, linear latent variable models, such as PCA and its extensions, are employed to learn reproducible functional connectivity networks present across a cohort of subjects. The activity within each network is subsequently employed as a feature in a linear regression model to predict brain age. The proposed framework is employed on the data from the CamCAN repository and the inferred brain age models are further demonstrated to generalize using data from two open-access repositories: the Human Connectome Project and the ATR Wide-Age-Range.

On robust parameter estimation in brain-computer interfacing.

OBJECTIVE: The reliable estimation of parameters such as mean or covariance matrix from noisy and high-dimensional observations is a prerequisite for successful application of signal processing and machine learning algorithms in brain-computer interfacing (BCI). This challenging task becomes significantly more difficult if the data set contains outliers, e.g. due to subject movements, eye blinks or loose electrodes, as they may heavily bias the estimation and the subsequent statistical analysis. Although various robust estimators have been developed to tackle the outlier problem, they ignore important structural information in the data and thus may not be optimal. Typical structural elements in BCI data are the trials consisting of a few hundred EEG samples and indicating the start and end of a task. APPROACH: This work discusses the parameter estimation problem in BCI and introduces a novel hierarchical view on robustness which naturally comprises different types of outlierness occurring in structured data. Furthermore, the class of minimum divergence estimators is reviewed and a robust mean and covariance estimator for structured data is derived and evaluated with simulations and on a benchmark data set. MAIN RESULTS: The results show that state-of-the-art BCI algorithms benefit from robustly estimated parameters. SIGNIFICANCE: Since parameter estimation is an integral part of various machine learning algorithms, the presented techniques are applicable to many problems beyond BCI.

Decoding emotional valence from electroencephalographic rhythmic activity.

We attempt to decode emotional valence from electroencephalographic rhythmic activity in a naturalistic setting. We employ a data-driven method developed in a previous study, Spectral Linear Discriminant Analysis, to discover the relationships between the classification task and independent neuronal sources, optimally utilizing multiple frequency bands. A detailed investigation of the classifier provides insight into the neuronal sources related with emotional valence, and the individual differences of the subjects in processing emotions. Our findings show: (1) sources whose locations are similar across subjects are consistently involved in emotional responses, with the involvement of parietal sources being especially significant, and (2) even though the locations of the involved neuronal sources are consistent, subjects can display highly varying degrees of valence-related EEG activity in the sources.

Characterizing Variability of Modular Brain Connectivity with Constrained Principal Component Analysis.

Characterizing the variability of resting-state functional brain connectivity across subjects and/or over time has recently attracted much attention. Principal component analysis (PCA) serves as a fundamental statistical technique for such analyses. However, performing PCA on high-dimensional connectivity matrices yields complicated "eigenconnectivity" patterns, for which systematic interpretation is a challenging issue. Here, we overcome this issue with a novel constrained PCA method for connectivity matrices by extending the idea of the previously proposed orthogonal connectivity factorization method. Our new method, modular connectivity factorization (MCF), explicitly introduces the modularity of brain networks as a parametric constraint on eigenconnectivity matrices. In particular, MCF analyzes the variability in both intra- and inter-module connectivities, simultaneously finding network modules in a principled, data-driven manner. The parametric constraint provides a compact module-based visualization scheme with which the result can be intuitively interpreted. We develop an optimization algorithm to solve the constrained PCA problem and validate our method in simulation studies and with a resting-state functional connectivity MRI dataset of 986 subjects. The results show that the proposed MCF method successfully reveals the underlying modular eigenconnectivity patterns in more general situations and is a promising alternative to existing methods.

Brain-machine interfaces for assistive smart homes: A feasibility study with wearable near-infrared spectroscopy.

Smart houses for elderly or physically challenged people need a method to understand residents' intentions during their daily-living behaviors. To explore a new possibility, we here developed a novel brain-machine interface (BMI) system integrated with an experimental smart house, based on a prototype of a wearable near-infrared spectroscopy (NIRS) device, and verified the system in a specific task of controlling of the house's equipments with BMI. We recorded NIRS signals of three participants during typical daily-living actions (DLAs), and classified them by linear support vector machine. In our off-line analysis, four DLAs were classified at about 70% mean accuracy, significantly above the chance level of 25%, in every participant. In an online demonstration in the real smart house, one participant successfully controlled three target appliances by BMI at 81.3% accuracy. Thus we successfully demonstrated the feasibility of using NIRS-BMI in real smart houses, which will possibly enhance new assistive smart-home technologies.

A resampling approach to estimate the stability of one-dimensional or multidimensional independent components.

When applying unsupervised learning techniques in biomedical data analysis, a key question is whether the estimated parameters of the studied system are reliable. In other words, can we assess the quality of the result produced by our learning technique? We propose resampling methods to tackle this question and illustrate their usefulness for blind-source separation (BSS). We demonstrate that our proposed reliability estimation can be used to discover stable one-dimensional or multidimensional independent components, to choose the appropriate BSS-model, to enhance significantly the separation performance, and, most importantly, to flag components that carry physical meaning. Application to different biomedical testbed data sets (magnetoencephalography (MEG)/electrocardiography (ECG)-recordings) underline the usefulness of our approach.

On-line learning in changing environments with applications in supervised and unsupervised learning.

An adaptive on-line algorithm extending the learning of learning idea is proposed and theoretically motivated. Relying only on gradient flow information it can be applied to learning continuous functions or distributions, even when no explicit loss function is given and the Hessian is not available. The framework is applied for unsupervised and supervised learning. Its efficiency is demonstrated for drifting and switching non-stationary blind separation tasks of acoustic signals. Furthermore applications to classification (US postal service data set) and time-series prediction in changing environments are presented.

Divergence-based framework for common spatial patterns algorithms.

Controlling a device with a brain-computer interface requires extraction of relevant and robust features from high-dimensional electroencephalographic recordings. Spatial filtering is a crucial step in this feature extraction process. This paper reviews algorithms for spatial filter computation and introduces a general framework for this task based on divergence maximization. We show that the popular common spatial patterns (CSP) algorithm can be formulated as a divergence maximization problem and computed within our framework. Our approach easily permits enforcing different invariances and utilizing information from other subjects; thus, it unifies many of the recently proposed CSP variants in a principled manner. Furthermore, it allows to design novel spatial filtering algorithms by incorporating regularization schemes into the optimization process or applying other divergences. We evaluate the proposed approach using three regularization schemes, investigate the advantages of beta divergence, and show that subject-independent feature spaces can be extracted by jointly optimizing the divergence problems of multiple users. We discuss the relations to several CSP variants and investigate the advantages and limitations of our approach with simulations. Finally, we provide experimental results on a dataset containing recordings from 80 subjects and interpret the obtained patterns from a neurophysiological perspective.

Structural Differences in Gray Matter between Glider Pilots and Non-Pilots. A Voxel-Based Morphometry Study.

Glider flying is a unique skill that requires pilots to control an aircraft at high speeds in three dimensions and amidst frequent full-body rotations. In the present study, we investigated the neural correlates of flying a glider using voxel-based morphometry. The comparison between gray matter densities of 15 glider pilots and a control group of 15 non-pilots exhibited significant gray matter density increases in left ventral premotor cortex, anterior cingulate cortex, and the supplementary eye field. We posit that the identified regions might be associated with cognitive and motor processes related to flying, such as joystick control, visuo-vestibular interaction, and oculomotor control.

Brain-computer interfacing in discriminative and stationary subspaces.

The non-stationary nature of neurophysiological measurements, e.g. EEG, makes classification of motion intentions a demanding task. Variations in the underlying brain processes often lead to significant and unexpected changes in the feature distribution resulting in decreased classification accuracy in Brain Computer Interfacing (BCI). Several methods were developed to tackle this problem by either adapting to these changes or extracting features that are invariant. Recently, a method called Stationary Subspace Analysis (SSA) was proposed and applied to BCI data. It diminishes the influence of non-stationary changes as learning and classification is performed in a stationary subspace of the data which can be extracted by SSA. In this paper we extend this method in two ways. First we propose a variant of SSA that allows to extract stationary subspaces from labeled data without disregarding class-related variations or treating class-differences as non-stationarities. Second we propose a discriminant variant of SSA that trades-off stationarity and discriminativity, thus it allows to extract stationary subspaces without losing relevant information. We show that learning in a discriminative and stationary subspace is advantageous for BCI application and outperforms the standard SSA method.

Stationary common spatial patterns for brain-computer interfacing.

Classifying motion intentions in brain-computer interfacing (BCI) is a demanding task as the recorded EEG signal is not only noisy and has limited spatial resolution but it is also intrinsically non-stationary. The non-stationarities in the signal may come from many different sources, for instance, electrode artefacts, muscular activity or changes of task involvement, and often deteriorate classification performance. This is mainly because features extracted by standard methods like common spatial patterns (CSP) are not invariant to variations of the signal properties, thus should also change over time. Although many extensions of CSP were proposed to, for example, reduce the sensitivity to noise or incorporate information from other subjects, none of them tackles the non-stationarity problem directly. In this paper, we propose a method which regularizes CSP towards stationary subspaces (sCSP) and show that this increases classification accuracy, especially for subjects who are hardly able to control a BCI. We compare our method with the state-of-the-art approaches on different datasets, show competitive results and analyse the reasons for the improvement.

Insights from classifying visual concepts with multiple kernel learning.

Combining information from various image features has become a standard technique in concept recognition tasks. However, the optimal way of fusing the resulting kernel functions is usually unknown in practical applications. Multiple kernel learning (MKL) techniques allow to determine an optimal linear combination of such similarity matrices. Classical approaches to MKL promote sparse mixtures. Unfortunately, 1-norm regularized MKL variants are often observed to be outperformed by an unweighted sum kernel. The main contributions of this paper are the following: we apply a recently developed non-sparse MKL variant to state-of-the-art concept recognition tasks from the application domain of computer vision. We provide insights on benefits and limits of non-sparse MKL and compare it against its direct competitors, the sum-kernel SVM and sparse MKL. We report empirical results for the PASCAL VOC 2009 Classification and ImageCLEF2010 Photo Annotation challenge data sets. Data sets (kernel matrices) as well as further information are available at http://doc.ml.tu-berlin.de/image_mkl/(Accessed 2012 Jun 25).

Direct density-ratio estimation with dimensionality reduction via least-squares hetero-distributional subspace search.

Methods for directly estimating the ratio of two probability density functions have been actively explored recently since they can be used for various data processing tasks such as non-stationarity adaptation, outlier detection, and feature selection. In this paper, we develop a new method which incorporates dimensionality reduction into a direct density-ratio estimation procedure. Our key idea is to find a low-dimensional subspace in which densities are significantly different and perform density-ratio estimation only in this subspace. The proposed method, D(3)-LHSS (Direct Density-ratio estimation with Dimensionality reduction via Least-squares Hetero-distributional Subspace Search), is shown to overcome the limitation of baseline methods.