Brain-Computer Interfaces for 1-D and 2-D Cursor Control: Designs Using Volitional Control of the EEG Spectrum or Steady-State Visual Evoked Potentials

We have developed and tested two EEG-based brain-computer interfaces (BCI) for users to control a cursor on a computer display. Our system uses an adaptive algorithm, based on kernel partial least squares classification (KPLS), to associate patterns in multichannel EEG frequency spectra with cursor controls. Our first BCI, Target Practice, is a system for one-dimensional device control, in which participants use biofeedback to learn voluntary control of their EEG spectra. Target Practice uses a KF LS classifier to map power spectra of 30-electrode EEG signals to rightward or leftward position of a moving cursor on a computer display. Three subjects learned to control motion of a cursor on a video display in multiple blocks of 60 trials over periods of up to six weeks. The best subject s average skill in correct selection of the cursor direction grew from 58% to 88% after 13 training sessions. Target Practice also implements online control of two artifact sources: a) removal of ocular artifact by linear subtraction of wavelet-smoothed vertical and horizontal EOG signals, b) control of muscle artifact by inhibition of BCI training during periods of relatively high power in the 40-64 Hz band. The second BCI, Think Pointer, is a system for two-dimensional cursor control. Steady-state visual evoked potentials (SSVEP) are triggered by four flickering checkerboard stimuli located in narrow strips at each edge of the display. The user attends to one of the four beacons to initiate motion in the desired direction. The SSVEP signals are recorded from eight electrodes located over the occipital region. A KPLS classifier is individually calibrated to map multichannel frequency bands of the SSVEP signals to right-left or up-down motion of a cursor on a computer display. The display stops moving when the user attends to a central fixation point. As for Target Practice, Think Pointer also implements wavelet-based online removal of ocular artifact; however, in Think Pointer muscle artifact is controlled via adaptive normalization of the SSVEP. Training of the classifier requires about three minutes. We have tested our system in real-time operation in three human subjects. Across subjects and sessions, control accuracy ranged from 80% to 100% correct with lags of 1-5 seconds for movement initiation and turning

DIFFERENCES IN SLEEP PATTERNS AMONG HEALTHY SLEEPERS AND PATIENTS AFTER STROKE

Sleep deprivation, whether from disorder or lifestyle, whether acute or chronic, poses a significant risk in daytime cognitive performance, excessive somnolence, impaired attention or decreased level of motor abilities. Ischemic stroke resulting in cerebral lesions is a well-known acute disorder that leaves affected patients strongly vulnerable to sleep disturbances that often lead to the above-mentioned cognitive and attentional impairments. In this paper, we analyzed and compared sleep patterns of healthy sleepers and patients after stroke. To overcome the well-known limits of the standardized sleep scoring into several discrete sleep stages we employed the recently proposed probabilistic sleepmodel that represents the sleep process as a continuum in terms of a set of probability curves. The probability curves were considered to represent a form of functional data, and microstructure along with time dynamics of the curves were studied using functional principal components analysis and clustering. Although our study represents a preliminary attempt to separate the two groups of subjects, we were able to identify several physiologically separate sleep patterns and we also identified sleep microstate patterns being a potential source allowing the discrimination of healthy subjects and stroke patients

Kernel PLS-SVC for Linear and Nonlinear Discrimination

A new methodology for discrimination is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by support vector machines for classification. Close connection of orthonormalized PLS and Fisher's approach to linear discrimination or equivalently with canonical correlation analysis is described. This gives preference to use orthonormalized PLS over principal component analysis. Good behavior of the proposed method is demonstrated on 13 different benchmark data sets and on the real world problem of the classification finger movement periods versus non-movement periods based on electroencephalogram

Penalized Partial Least Squares Based on B-Splines Transformations

We propose a novel method to model nonlinear regression problems by adapting the principle of penalization to Partial Least Squares (PLS). Starting with a generalized additive model, we expand the additive component of each variable in terms of a generous amount of B-Splines basis functions. In order to prevent overfitting and to obtain smooth functions, we estimate the regression model by applying a penalized version of PLS. Although our motivation for penalized PLS stems from its use for B-Splines transformed data, the proposed approach is very general and can be applied to other penalty terms or to other dimension reduction techniques. It turns out that penalized PLS can be computed virtually as fast as PLS. We prove a close connection of penalized PLS to the solutions of preconditioned linear systems. In the case of high-dimensional data, the new method is shown to be an attractive competitor to other techniques for estimating generalized additive models. If the number of predictor variables is high compared to the number of examples, traditional techniques often suffer from overfitting. We illustrate that penalized PLS performs well in these situations

Multi-score Learning for Affect Recognition: the Case of Body Postures

An important challenge in building automatic affective state recognition systems is establishing the ground truth. When the groundtruth is not available, observers are often used to label training and testing sets. Unfortunately, inter-rater reliability between observers tends to vary from fair to moderate when dealing with naturalistic expressions. Nevertheless, the most common approach used is to label each expression with the most frequent label assigned by the observers to that expression. In this paper, we propose a general pattern recognition framework that takes into account the variability between observers for automatic affect recognition. This leads to what we term a multi-score learning problem in which a single expression is associated with multiple values representing the scores of each available emotion label. We also propose several performance measurements and pattern recognition methods for this framework, and report the experimental results obtained when testing and comparing these methods on two affective posture datasets

Multi-modal Synthesis of ASL-MRI Features with KPLS Regression on Heterogeneous Data

Machine learning classifiers are frequently trained on heterogeneous multi-modal imaging data, where some patients have missing modalities. We address the problem of synthesising arterial spin labelling magnetic resonance imaging (ASL-MRI) - derived cerebral blood flow (CBF) - features in a heterogeneous data set. We synthesise ASL-MRI features using T1-weighted structural MRI (sMRI) and carotid ultrasound flow features. To deal with heterogeneous data, we extend the kernel partial least squares regression (kPLSR) - method to the case where both input and output data have partial coverage. The utility of the synthetic CBF features is tested on a binary classification problem of mild cognitive impairment patients vs. controls. Classifiers based on sMRI and synthetic ASL-MRI features are combined using a maximum probability rule, achieving a balanced accuracy of 92% (sensitivity 100 %, specificity 80 %) in a separate validation set. Comparison is made against support vector machine-classifiers from literature

Recognition of prokaryotic promoters based on a novel variable-window Z-curve method

Transcription is the first step in gene expression, and it is the step at which most of the regulation of expression occurs. Although sequenced prokaryotic genomes provide a wealth of information, transcriptional regulatory networks are still poorly understood using the available genomic information, largely because accurate prediction of promoters is difficult. To improve promoter recognition performance, a novel variable-window Z-curve method is developed to extract general features of prokaryotic promoters. The features are used for further classification by the partial least squares technique. To verify the prediction performance, the proposed method is applied to predict promoter fragments of two representative prokaryotic model organisms (Escherichia coli and Bacillus subtilis). Depending on the feature extraction and selection power of the proposed method, the promoter prediction accuracies are improved markedly over most existing approaches: for E. coli, the accuracies are 96.05% (σ70 promoters, coding negative samples), 90.44% (σ70 promoters, non-coding negative samples), 92.13% (known sigma-factor promoters, coding negative samples), 92.50% (known sigma-factor promoters, non-coding negative samples), respectively; for B. subtilis, the accuracies are 95.83% (known sigma-factor promoters, coding negative samples) and 99.09% (known sigma-factor promoters, non-coding negative samples). Additionally, being a linear technique, the computational simplicity of the proposed method makes it easy to run in a matter of minutes on ordinary personal computers or even laptops. More importantly, there is no need to optimize parameters, so it is very practical for predicting other species promoters without any prior knowledge or prior information of the statistical properties of the samples