Detection of k-complexes in EEG signals using a multi-domain feature extraction coupled with a least square support vector machine classifier

Visibility graph analysis for brain: scoping review

In the past two decades, network-based analysis has garnered considerable attention for analyzing time series data across various fields. Time series data can be transformed into graphs or networks using different methods, with the visibility graph (VG) being a widely utilized approach. The VG holds extensive applications in comprehending, identifying, and predicting specific characteristics of time series data. Its practicality extends to domains such as medicine, economics, meteorology, tourism, and others. This research presents a scoping review of scholarly articles published in reputable English-language journals and conferences, focusing on VG-based analysis methods related to brain disorders. The aim is to provide a foundation for further and future research endeavors, beginning with an introduction to the VG and its various types. To achieve this, a systematic search and refinement of relevant articles were conducted in two prominent scientific databases: Google Scholar and Scopus. A total of 51 eligible articles were selected for a comprehensive analysis of the topic. These articles categorized based on publication year, type of VG used, rationale for utilization, machine learning algorithms employed, frequently occurring keywords, top authors and universities, evaluation metrics, applied network properties, and brain disorders examined, such as Epilepsy, Alzheimer's disease, Autism, Alcoholism, Sleep disorders, Fatigue, Depression, and other related conditions. Moreover, there are recommendations for future advancements in research, which involve utilizing cutting-edge techniques like graph machine learning and deep learning. Additionally, the exploration of understudied medical conditions such as attention deficit hyperactivity disorder and Parkinson's disease is also suggested.

A study on feature selection using multi-domain feature extraction for automated k-complex detection

Background

K-complex detection plays a significant role in the field of sleep research. However, manual annotation for electroencephalography (EEG) recordings by visual inspection from experts is time-consuming and subjective. Therefore, there is a necessity to implement automatic detection methods based on classical machine learning algorithms. However, due to the complexity of EEG signal, current feature extraction methods always produce low relevance to k-complex detection, which leads to a great performance loss for the detection. Hence, finding compact yet effective integrated feature vectors becomes a crucially core task in k-complex detection.

Method

In this paper, we first extract multi-domain features based on time, spectral analysis, and chaotic theory. Those features are extracted from a 0.5-s EEG segment, which is obtained using the sliding window technique. As a result, a vector containing twenty-two features is obtained to represent each segment. Next, we explore several feature selection methods and compare their performance in detecting k-complex. Based on the analysis of the selected features, we identify compact features which are fewer than twenty-two features and deemed as relevant and proceeded to the next step. Additionally, three classical classifiers are employed to evaluate the performance of the feature selection models.

Results

The results demonstrate that combining different features significantly improved the k-complex detection performance. The best performance is achieved by applying the feature selection method, which results in an accuracy of 93.03%± 7.34, sensitivity of 93.81%± 5.62%, and specificity 94.13± 5.81, respectively, using a smaller number of the combined feature sets.

Conclusion

The proposed method in this study can serve as an efficient tool for the automatic detection of k-complex, which is useful for neurologists or doctors in the diagnosis of sleep research.

A RUSBoosted tree method for k-complex detection using tunable Q-factor wavelet transform and multi-domain feature extraction

Background

K-complex detection traditionally relied on expert clinicians, which is time-consuming and onerous. Various automatic k-complex detection-based machine learning methods are presented. However, these methods always suffered from imbalanced datasets, which impede the subsequent processing steps.

New method

In this study, an efficient method for k-complex detection using electroencephalogram (EEG)-based multi-domain features extraction and selection method coupled with a RUSBoosted tree model is presented. EEG signals are first decomposed using a tunable Q-factor wavelet transform (TQWT). Then, multi-domain features based on TQWT are pulled out from TQWT sub-bands, and a self-adaptive feature set is obtained from a feature selection based on the consistency-based filter for the detection of k-complexes. Finally, the RUSBoosted tree model is used to perform k-complex detection.

Results

Experimental outcomes manifest the efficacy of our proposed scheme in terms of the average performance of recall measure, AUC, and F10-score. The proposed method yields 92.41 ± 7.47%, 95.4 ± 4.32%, and 83.13 ± 8.59% for k-complex detection in Scenario 1 and also achieves similar results in Scenario 2.

Comparison to state-of-the-art methods

The RUSBoosted tree model was compared with three other machine learning classifiers [i.e., linear discriminant analysis (LDA), logistic regression, and linear support vector machine (SVM)]. The performance based on the kappa coefficient, recall measure, and F10-score provided evidence that the proposed model surpassed other algorithms in the detection of the k-complexes, especially for the recall measure.

Conclusion

In summary, the RUSBoosted tree model presents a promising performance in dealing with highly imbalanced data. It can be an effective tool for doctors and neurologists to diagnose and treat sleep disorders.

Sleep stage classification in EEG signals using the clustering approach based probability distribution features coupled with classification algorithms

Sleep scoring is one of the primary tasks for the classification of sleep stages in Electroencephalogram (EEG) signals. Manual visual scoring of sleep stages is time-consuming as well as being dependent on the experience of a highly qualified sleep expert. This paper aims to address these issues by developing a new method to automatically classify sleep stages in EEG signals. In this research, a robust method has been presented based on the clustering approach, coupled with probability distribution features, to identify six sleep stages with the use of EEG signals. Using this method, each 30-second EEG signal is firstly segmented into small epochs and then each epoch is divided into 60 sub-segments. Each sub-segment is decomposed into five levels by using a discrete wavelet transform (DWT) to obtain the approximation and detailed coefficient. The wavelet coefficient of each level is clustered using the k-means algorithm. Subsequently, features are extracted based on the probability distribution for each wavelet coefficient. The extracted features then are forwarded to the least squares support vector machine classifier (LS-SVM) to identify sleep stages. Comparisons with several existing methods are also made in this study. The proposed method for the classification of the sleep stages achieves an average accuracy rate of 97.4%. It can be an effective tool for sleep stages classification and can be useful for doctors and neurologists for diagnosing sleep disorders.

Detection of K-complexes in EEG waveform images using faster R-CNN and deep transfer learning

Background

The electroencephalography (EEG) signal carries important information about the electrical activity of the brain, which may reveal many pathologies. This information is carried in certain waveforms and events, one of which is the K-complex. It is used by neurologists to diagnose neurophysiologic and cognitive disorders as well as sleep studies. Existing detection methods largely depend on tedious, time-consuming, and error-prone manual inspection of the EEG waveform.

Methods

In this paper, a highly accurate K-complex detection system is developed. Based on multiple convolutional neural network (CNN) feature extraction backbones and EEG waveform images, a regions with faster regions with convolutional neural networks (Faster R-CNN) detector was designed, trained, and tested. Extensive performance evaluation was performed using four deep transfer learning feature extraction models (AlexNet, ResNet-101, VGG19 and Inceptionv3). The dataset was comprised of 10948 images of EEG waveforms, with the location of the K-complexes included as separate text files containing the bounding boxes information.

Results

The Inceptionv3 and VGG19-based detectors performed consistently high (i.e., up to 99.8% precision and 0.2% miss rate) over different testing scenarios, in which the number of training images was varied from 60% to 80% and the positive overlap threshold was increased from 60% to 90%.

Conclusions

Our automated method appears to be a highly accurate automatic K-complex detection in real-time that can aid practitioners in speedy EEG inspection.

Graphical Abstract

Supplementary Information

The online version contains supplementary material available at 10.1186/s12911-022-02042-x.

Fault diagnosis method of bearing utilizing GLCM and MBASA-based KELM

In this study, fault diagnosis method of bearing utilizing gray level co-occurrence matrix (GLCM) and multi-beetles antennae search algorithm (MBASA)-based kernel extreme learning machine (KELM) is presented. In the proposed method, feature extraction of time-frequency image based on GLCM is proposed to extract the features of the bearing vibration signal, and multi-beetles antennae search algorithm-based KELM (MBASA-KELM) is presented to recognize the states of bearing. KELM employs the kernel-based framework, which has better generalization than traditional extreme learning machine, and it is necessary to look for an excellent optimization algorithm to select appropriate regularization parameter and kernel parameter of the KELM model because these parameters of the KELM model can affect its performance. As traditional beetle antennae search algorithm only employs one beetle, which is difficult to find the optimal parameters when the ranges of the parameters to be optimized are wide, multi-beetles antennae search algorithm (MBASA) employing multi-beetles is presented to select the regularization parameter and kernel parameter of KELM. The experimental results demonstrate that MBASA-KELM has stronger fault diagnosis ability for bearing than LSSVM, and KNN.

Classification of ERP signal from amnestic mild cognitive impairment with type 2 diabetes mellitus using single-scale multi-input convolution neural network

BACKGROUND

The application of deep learning models to electroencephalogram (EEG) signal classification has recently become a popular research topic. Several deep learning models have been proposed to classify EEG signals in patients with various neurological diseases. However, no effective deep learning model for event-related potential (ERP) signal classification is yet available for amnestic mild cognitive impairment (aMCI) with type 2 diabetes mellitus (T2DM).

METHOD

This study proposed a single-scale multi-input convolutional neural network (SSMICNN) method to classify ERP signals between aMCI patients with T2DM and the control group. Firstly, the 18-electrode ERP signal on alpha, beta, and theta frequency bands was extracted by using the fast Fourier transform, and then the mean, sum of squares, and absolute value feature of each frequency band were calculated. Finally, these three features are converted into multispectral images respectively and used as the input of the SSMICNN network to realize the classification task.

RESULTS

The results show that the SSMICNN can fuse MSI formed by different features, SSMICNN enriches the feature quantity of the neural network input layer and has excellent robustness, and the errors of SSMICNN can be simultaneously transmitted to the three convolution channels in the back-propagation phase. Comparison with Existing Method(s): SSMICNN could more effectively identify ERP signals from aMCI with T2DM from the control group compared to existing classification methods, including convolution neural network, support vector machine, and logistic regression.

CONCLUSIONS

The combination of SSMICNN and MSI can be used as an effective biological marker to distinguish aMCI patients with T2DM from the control group.

Automatic Detection of K-Complexes Using the Cohen Class Recursiveness and Reallocation Method and Deep Neural Networks with EEG Signals

Evoked and spontaneous K-complexes are thought to be involved in sleep protection, but their role as biomarkers is still under debate. K-complexes have two major functions: first, they suppress cortical arousal in response to stimuli that the sleeping brain evaluates to avoid signaling danger; and second, they help strengthen memory. K-complexes also play an important role in the analysis of sleep quality, in the detection of diseases associated with sleep disorders, and as biomarkers for the detection of Alzheimer’s and Parkinson’s diseases. Detecting K-complexes is relatively difficult, as reliable methods of identifying this complex cannot be found in the literature. In this paper, we propose a new method for the automatic detection of K-complexes combining the method of recursion and reallocation of the Cohen class and the deep neural networks, obtaining a recursive strategy aimed at increasing the percentage of classification and reducing the computation time required to detect K-complexes by applying the proposed methods.