EEG-based brain-computer interfaces using motor-imagery: techniques and challenges.

Electroencephalography (EEG)-based brain-computer interfaces (BCIs), particularly those using motor-imagery (MI) data, have the potential to become groundbreaking technologies in both clinical and entertainment settings. MI data is generated when a subject imagines the movement of a limb. This paper reviews state-of-the-art signal processing techniques for MI EEG-based BCIs, with a particular focus on the feature extraction, feature selection and classification techniques used. It also summarizes the main applications of EEG-based BCIs, particularly those based on MI data, and finally presents a detailed discussion of the most prevalent challenges impeding the development and commercialization of EEG-based BCIs

Feature optimization based on improved novel global harmony search algorithm for motor imagery electroencephalogram classification

BackgroundEffectively decoding electroencephalogram (EEG) pattern for specific mental tasks is a crucial topic in the development of brain-computer interface (BCI). Extracting common spatial pattern (CSP) features from motor imagery EEG signals is often highly dependent on the selection of frequency band and time interval. Therefore, optimizing frequency band and time interval would contribute to effective feature extraction and accurate EEG decoding.ObjectiveThis study proposes an approach based on an improved novel global harmony search (INGHS) to optimize frequency-time parameters for effective CSP feature extraction.MethodsThe INGHS algorithm is applied to find the optimal frequency band and temporal interval. The linear discriminant analysis and support vector machine are used for EEG pattern decoding. Extensive experimental studies are conducted on three EEG datasets to assess the effectiveness of our proposed method.ResultsThe average test accuracy obtained by the time-frequency parameters selected by the proposed INGHS method is slightly better than artificial bee colony (ABC) and particle swarm optimization (PSO) algorithms. Furthermore, the INGHS algorithm is superior to PSO and ABC in running time.ConclusionThese superior experimental results demonstrate that the optimal frequency band and time interval selected by the INGHS algorithm could significantly improve the decoding accuracy compared with the traditional CSP method. This method has a potential to improve the performance of MI-based BCI systems

A Study of recent classification algorithms and a novel approach for biosignal data classification

Analyzing and understanding human biosignals have been important research areas that have many practical applications in everyday life. For example, Brain Computer Interface is a research area that studies the connection between the human brain and external systems by processing and learning the brain signals called Electroencephalography (EEG) signals. Similarly, various assistive robotics applications are being developed to interpret eye or muscle signals in humans in order to provide control inputs for external devices. The efficiency for all of these applications depends heavily on being able to process and classify human biosignals. Therefore many techniques from Signal Processing and Machine Learning fields are applied in order to understand human biosignals better and increase the efficiency and success of these applications. This thesis proposes a new classifier for biosignal data classification utilizing Particle Swarm Optimization Clustering and Radial Basis Function Networks (RBFN). The performance of the proposed classifier together with several variations in the technique is analyzed by utilizing comparisons with the state of the art classifiers such as Fuzzy Functions Support Vector Machines (FFSVM), Improved Fuzzy Functions Support Vector Machines (IFFSVM). These classifiers are implemented on the classification of same biological signals in order to evaluate the proposed technique. Several clustering algorithms, which are used in these classifiers, such as K-means, Fuzzy c-means, and Particle Swarm Optimization (PSO), are studied and compared with each other based on clustering abilities. The effects of the analyzed clustering algorithms in the performance of Radial Basis Functions Networks classifier are investigated. Strengths and weaknesses are analyzed on various standard and EEG datasets. Results show that the proposed classifier that combines PSO clustering with RBFN classifier can reach or exceed the performance of these state of the art classifiers. Finally, the proposed classification technique is applied to a real-time system application where a mobile robot is controlled based on person\u27s EEG signal

A Motor-Imagery BCI System Based on Deep Learning Networks and Its Applications

Motor imagery brain-computer interface (BCI) by using of deep-learning models is proposed in this paper. In which, we used the electroencephalogram (EEG) signals of motor imagery (MI-EEG) to identify different imagery activities. The brain dynamics of motor imagery are usually measured by EEG as non-stationary time series of low signal-to-noise ratio. However, a variety of methods have been previously developed to classify MI-EEG signals getting not satisfactory results owing to lack of characteristics in time-frequency features. In this paper, discrete wavelet transform (DWT) was applied to transform MIEEG signals and extract their effective coefficients as the time-frequency features. Then two deep learning (DL) models named Long-short term memory (LSTM) and gated recurrent neural networks (GRNN) are used to classify MI-EEG data. LSTM is designed to fight against vanishing gradients. GRNN makes each recurrent unit to capture dependencies of different time scales adaptively. Similar scheme of the LSTM unit, GRNN has gating units that modulate the flow of information inside the unit, but without having a separate memory cells. Experimental results show that GRNN and LSTM yield higher classification accuracies compared to the existing approaches that is helpful for the further research and application of relative RNN in processing of MI-EEG

Brain-computer interface channel selection optimization using meta-heuristics and evolutionary algorithms

Producción CientíficaMany brain–computer interface (BCI) studies overlook the channel optimization due to its inherent complexity. However, a careful channel selection increases the performance and users’ comfort while reducing the cost of the system. Evolutionary meta-heuristics, which have demonstrated their usefulness in solving complex problems, have not been fully exploited yet in this context. The purpose of the study is two-fold: (1) to propose a novel algorithm to find an optimal channel set for each user and compare it with other existing meta-heuristics; and (2) to establish guidelines for adapting these optimization strategies to this framework. A total of 3 single-objective (GA, BDE, BPSO) and 4 multi-objective (NSGA-II, BMOPSO, SPEA2, PEAIL) existing algorithms have been adapted and tested with 3 public databases: ‘BCI competition III–dataset II’, ‘Center Speller’ and ‘RSVP Speller’. Dual-Front Sorting Algorithm (DFGA), a novel multi-objective discrete method especially designed to the BCI framework, is proposed as well. Results showed that all meta-heuristics outperformed the full set and the common 8-channel set for P300-based BCIs. DFGA showed a significant improvement of accuracy of 3.9% over the latter using also 8 channels; and obtained similar accuracies using a mean of 4.66 channels. A topographic analysis also reinforced the need to customize a channel set for each user. Thus, the proposed method computes an optimal set of solutions with different number of channels, allowing the user to select the most appropriate distribution for the next BCI sessions.Ministerio de Ciencia, Innovación y Universidades (project RTC2019-007350-1)Comisión Europea (project 0702_MIGRAINEE_2_E

Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics

Brain Computer Interfaces (BCI) are a domain of hardware/software in which a user can interact with a machine without the need for motor activity, communicating instead via signals generated by the nervous system. These interfaces provide life-altering benefits to users, and refinement will both allow their application to a much wider variety of disabilities, and increase their practicality. The primary method of acquiring these signals is Electroencephalography (EEG). This technique is susceptible to a variety of different sources of noise, which compounds the inherent problems in BCI training data: large dimensionality, low numbers of samples, and non-stationarity between users and recording sessions. Feature Selection and Transfer Learning have been used to overcome these problems, but they fail to account for several characteristics of BCI. This thesis extends both of these approaches by the use of Search-based algorithms. Feature Selection techniques, known as Wrappers use ‘black box’ evaluation of feature subsets, leading to higher classification accuracies than ranking methods known as Filters. However, Wrappers are more computationally expensive, and are prone to over-fitting to training data. In this thesis, we applied Iterated Local Search (ILS) to the BCI field for the first time in literature, and demonstrated competitive results with state-of-the-art methods such as Least Absolute Shrinkage and Selection Operator and Genetic Algorithms. We then developed ILS variants with guided perturbation operators. Linkage was used to develop a multivariate metric, Intrasolution Linkage. This takes into account pair-wise dependencies of features with the label, in the context of the solution. Intrasolution Linkage was then integrated into two ILS variants. The Intrasolution Linkage Score was discovered to have a stronger correlation with the solutions predictive accuracy on unseen data than Cross Validation Error (CVE) on the training set, the typical approach to feature subset evaluation. Mutual Information was used to create Minimum Redundancy Maximum Relevance Iterated Local Search (MRMR-ILS). In this algorithm, the perturbation operator was guided using an existing Mutual Information measure, and compared with current Filter and Wrapper methods. It was found to achieve generally lower CVE rates and higher predictive accuracy on unseen data than existing algorithms. It was also noted that solutions found by the MRMR-ILS provided CVE rates that had a stronger correlation with the accuracy on unseen data than solutions found by other algorithms. We suggest that this may be due to the guided perturbation leading to solutions that are richer in Mutual Information. Feature Selection reduces computational demands and can increase the accuracy of our desired models, as evidenced in this thesis. However, limited quantities of training samples restricts these models, and greatly reduces their generalisability. For this reason, utilisation of data from a wide range of users is an ideal solution. Due to the differences in neural structures between users, creating adequate models is difficult. We adopted an existing state-of-the-art ensemble technique Ensemble Learning Generic Information (ELGI), and developed an initial optimisation phase. This involved using search to transplant instances between user subsets to increase the generalisability of each subset, before combination in the ELGI. We termed this Evolved Ensemble Learning Generic Information (eELGI). The eELGI achieved higher accuracy than user-specific BCI models, across all eight users. Optimisation of the training dataset allowed smaller training sets to be used, offered protection against neural drift, and created models that performed similarly across participants, regardless of neural impairment. Through the introduction and hybridisation of search based algorithms to several problems in BCI we have been able to show improvements in modelling accuracy and efficiency. Ultimately, this represents a step towards more practical BCI systems that will provide life altering benefits to users

Dimension Reduction Using New Bond Graph Algorithm and Deep Learning Pooling on EEG Signals for BCI

One of the main challenges in studying brain signals is the large size of the data due to the use of many electrodes and the time-consuming sampling. Choosing the right dimensional reduction method can lead to a reduction in the data processing time. Evolutionary algorithms are one of the methods used to reduce the dimensions in the field of EEG brain signals, which have shown better performance than other common methods. In this article, (1) a new Bond Graph algorithm (BGA) is introduced that has demonstrated better performance on eight benchmark functions compared to genetic algorithm and particle swarm optimization. Our algorithm has fast convergence and does not get stuck in local optimums. (2) Reductions of features, electrodes, and the frequency range have been evaluated simultaneously for brain signals (left-handed and right-handed). BGA and other algorithms are used to reduce features. (3) Feature extraction and feature selection (with algorithms) for time domain, frequency domain, wavelet coefficients, and autoregression have been studied as well as electrode reduction and frequency interval reduction. (4) First, the features/properties (algorithms) are reduced, the electrodes are reduced, and the frequency range is reduced, which is followed by the construction of new signals based on the proposed formulas. Then, a Common Spatial Pattern is used to remove noise and feature extraction and is classified by a classifier. (5) A separate study with a deep sampling method has been implemented as feature selection in several layers with functions and different window sizes. This part is also associated with reducing the feature and reducing the frequency range. All items expressed in data set IIa from BCI competition IV (the left hand and right hand) have been evaluated between one and three channels, with better results for similar cases (in close proximity). Our method demonstrated an increased accuracy by 5 to 8% and an increased kappa by 5%