Analysis of EEG signals using complex brain networks

The human brain is so complex that two mega projects, the Human Brain Project and the BRAIN Initiative project, are under way in the hope of answering important questions for peoples' health and wellbeing. Complex networks become powerful tools for studying brain function due to the fact that network topologies on real-world systems share small world properties. Examples of these networks are the Internet, biological networks, social networks, climate networks and complex brain networks. Complex brain networks in real time biomedical signal processing applications are limited because some graph algorithms (such as graph isomorphism), cannot be solved in polynomial time. In addition, they are hard to use in single-channel EEG applications, such as clinic applications in sleep scoring and depth of anaesthesia monitoring. The first contribution of this research is to present two novel algorithms and two graph models. A fast weighted horizontal visibility algorithm (FWHVA) overcoming the speed limitations for constructing a graph from a time series is presented. Experimental results show that the FWHVA can be 3.8 times faster than the Fast Fourier Transfer (FFT) algorithm when input signals exceed 4000 data points. A linear time graph isomorphism algorithm (HVGI) can determine the isomorphism of two horizontal visibility graphs (HVGs) in a linear time domain. This is an efficient way to measure the synchronized index between two time series. Difference visibility graphs (DVGs) inherit the advantages of horizontal visibility graphs. They are noise-robust, and they overcome a pitfall of visibility graphs (VG): that the degree distribution (DD) doesn't satisfy a pure power-law. Jump visibility graphs (JVGs) enhance brain graphs allowing the processing of non-stationary biomedical signals. This research shows that the DD of JVGs always satisfies a power-lower if the input signals are purely non-stationary. The second highlight of this work is the study of three clinical biomedical signals: alcoholic, epileptic and sleep EEGs. Based on a synchronization likelihood and maximal weighted matching method, this work finds that the processing repeated stimuli and unrepeated stimuli in the controlled drinkers is larger than that in the alcoholics. Seizure detections based on epileptic EEGs have also been investigated with three graph features: graph entropy of VGs, mean strength of HVGs, and mean degrees of JVGs. All of these features can achieve 100% accuracy in seizure identification and differentiation from healthy EEG signals. Sleep EEGs are evaluated based on VG and DVG methods. It is shown that the complex brain networks exhibit more small world structure during deep sleep. Based on DVG methods, the accuracy peaks at 88:9% in a 5-state sleep stage classification from 14; 943 segments from single-channel EEGs. This study also introduces two weighted complex network approaches to analyse the nonlinear EEG signals. A weighted horizontal visibility graph (WHVG) is proposed to enhance noise-robustness properties. Tested with two Chaos signals and an epileptic EEG database, the research shows that the mean strength of the WHVG is more stable and noise-robust than those features from FFT and entropy. Maximal weighted matching algorithms have been applied to evaluate the difference in complex brain networks of alcoholics and controlled drinkers. The last contribution of this dissertation is to develop an unsupervised classifier for biomedical signal pattern recognition. A Multi-Scale Means (MSK-Means) algorithm is proposed for solving the subject-dependent biomedical signals classification issue. Using JVG features from the epileptic EEG database, the MSK-Means algorithm is 4:7% higher in identifying seizures than those by the K-means algorithm and achieves 92:3% accuracy for localizing the epileptogenic zone. The findings suggest that the outcome of this thesis can improve the performance of complex brain networks for biomedical signal processing and nonlinear time series analysis

EEG sleep stages identification based on weighted undirected complex networks

Sleep scoring is important in sleep research because any errors in the scoring of the patient's sleep electroencephalography (EEG) recordings can cause serious problems such as incorrect diagnosis, medication errors, and misinterpretations of patient's EEG recordings. The aim of this research is to develop a new automatic method for EEG sleep stages classification based on a statistical model and weighted brain networks. Methods each EEG segment is partitioned into a number of blocks using a sliding window technique. A set of statistical features are extracted from each block. As a result, a vector of features is obtained to represent each EEG segment. Then, the vector of features is mapped into a weighted undirected network. Different structural and spectral attributes of the networks are extracted and forwarded to a least square support vector machine (LS-SVM) classifier. At the same time the network's attributes are also thoroughly investigated. It is found that the network's characteristics vary with their sleep stages. Each sleep stage is best represented using the key features of their networks. Results In this paper, the proposed method is evaluated using two datasets acquired from different channels of EEG (Pz-Oz and C3-A2) according to the R&K and the AASM without pre-processing the original EEG data. The obtained results by the LS-SVM are compared with those by Naïve, k-nearest and a multi-class-SVM. The proposed method is also compared with other benchmark sleep stages classification methods. The comparison results demonstrate that the proposed method has an advantage in scoring sleep stages based on single channel EEG signals. Conclusions An average accuracy of 96.74% is obtained with the C3-A2 channel according to the AASM standard, and 96% with the Pz-Oz channel based on the R&K standard

Gershgorin circle theorem-based feature extraction for biomedical signal analysis

Recently, graph theory has become a promising tool for biomedical signal analysis, wherein the signals are transformed into a graph network and represented as either adjacency or Laplacian matrices. However, as the size of the time series increases, the dimensions of transformed matrices also expand, leading to a significant rise in computational demand for analysis. Therefore, there is a critical need for efficient feature extraction methods demanding low computational time. This paper introduces a new feature extraction technique based on the Gershgorin Circle theorem applied to biomedical signals, termed Gershgorin Circle Feature Extraction (GCFE). The study makes use of two publicly available datasets: one including synthetic neural recordings, and the other consisting of EEG seizure data. In addition, the efficacy of GCFE is compared with two distinct visibility graphs and tested against seven other feature extraction methods. In the GCFE method, the features are extracted from a special modified weighted Laplacian matrix from the visibility graphs. This method was applied to classify three different types of neural spikes from one dataset, and to distinguish between seizure and non-seizure events in another. The application of GCFE resulted in superior performance when compared to seven other algorithms, achieving a positive average accuracy difference of 2.67% across all experimental datasets. This indicates that GCFE consistently outperformed the other methods in terms of accuracy. Furthermore, the GCFE method was more computationally-efficient than the other feature extraction techniques. The GCFE method can also be employed in real-time biomedical signal classification where the visibility graphs are utilized such as EKG signal classification