Feature Extraction by Nonnegative Tucker Decomposition from EEG Data Including Testing and Training Observations

2012 ◽  
pp. 166-173 ◽  
Author(s):  
Fengyu Cong ◽  
Anh Huy Phan ◽  
Qibin Zhao ◽  
Qiang Wu ◽  
Tapani Ristaniemi ◽  
...  
Keyword(s):  
Feature Extraction ◽  
Tucker Decomposition ◽  
Eeg Data ◽  
And Training

scholarly journals Categorisation of EEG suppression using enhanced feature extraction for SUDEP risk assessment

2020 ◽  
Vol 20 (S12) ◽  
Author(s):  
Juan C. Mier ◽  
Yejin Kim ◽  
Xiaoqian Jiang ◽  
Guo-Qiang Zhang ◽  
Samden Lhatoo
Keyword(s):  
Sensitivity Analysis ◽  
Feature Extraction ◽  
Random Forest ◽  
Window Size ◽  
Extraction Process ◽  
Unexpected Death ◽  
Power Spectral ◽  
Eeg Data ◽  
Boosted Decision Trees ◽  
Future Work

Abstract Background Sudden Unexpected Death in Epilepsy (SUDEP) has increased in awareness considerably over the last two decades and is acknowledged as a serious problem in epilepsy. However, the scientific community remains unclear on the reason or possible bio markers that can discern potentially fatal seizures from other non-fatal seizures. The duration of postictal generalized EEG suppression (PGES) is a promising candidate to aid in identifying SUDEP risk. The length of time a patient experiences PGES after a seizure may be used to infer the risk a patient may have of SUDEP later in life. However, the problem becomes identifying the duration, or marking the end, of PGES (Tomson et al. in Lancet Neurol 7(11):1021–1031, 2008; Nashef in Epilepsia 38:6–8, 1997). Methods This work addresses the problem of marking the end to PGES in EEG data, extracted from patients during a clinically supervised seizure. This work proposes a sensitivity analysis on EEG window size/delay, feature extraction and classifiers along with associated hyperparameters. The resulting sensitivity analysis includes the Gradient Boosted Decision Trees and Random Forest classifiers trained on 10 extracted features rooted in fundamental EEG behavior using an EEG specific feature extraction process (pyEEG) and 5 different window sizes or delays (Bao et al. in Comput Intell Neurosci 2011:1687–5265, 2011). Results The machine learning architecture described above scored a maximum AUC score of 76.02% with the Random Forest classifier trained on all extracted features. The highest performing features included SVD Entropy, Petrosan Fractal Dimension and Power Spectral Intensity. Conclusion The methods described are effective in automatically marking the end to PGES. Future work should include integration of these methods into the clinical setting and using the results to be able to predict a patient’s SUDEP risk.

scholarly journals Achieving Accurate Automatic Sleep Staging on Manually Pre-processed EEG Data Through Synchronization Feature Extraction and Graph Metrics

2018 ◽  
Vol 12 ◽  
Author(s):  
Panteleimon Chriskos ◽  
Christos A. Frantzidis ◽  
Polyxeni T. Gkivogkli ◽  
Panagiotis D. Bamidis ◽  
Chrysoula Kourtidou-Papadeli
Keyword(s):  
Feature Extraction ◽  
Sleep Staging ◽  
Graph Metrics ◽  
Eeg Data ◽  
Processed Eeg

scholarly journals Early Classification of Motor Tasks Using Dynamic Functional Connectivity Graphs from EEG

2020 ◽  
Author(s):  
Foroogh Shamsi ◽  
Ali Haddad ◽  
Laleh Najafizadeh
Keyword(s):  
Feature Extraction ◽  
Functional Connectivity ◽  
Extraction Method ◽  
Motor Tasks ◽  
Dynamic Functional Connectivity ◽  
Feature Extraction Method ◽  
Brain Functions ◽  
Eeg Data ◽  
Eeg Recordings

AbstractObjectiveClassification of electroencephalography (EEG) signals with high accuracy using short recording intervals has been a challenging problem in developing brain computer interfaces (BCIs). This paper presents a novel feature extraction method for EEG recordings to tackle this problem.ApproachThe proposed approach is based on the concept that the brain functions in a dynamic manner, and utilizes dynamic functional connectivity graphs. The EEG data is first segmented into intervals during which functional networks sustain their connectivity. Functional connectivity networks for each identified segment are then localized, and graphs are constructed, which will be used as features. To take advantage of the dynamic nature of the generated graphs, a Long Short Term Memory (LSTM) classifier is employed for classification.Main resultsFeatures extracted from various durations of post-stimulus EEG data associated with motor execution and imagery tasks are used to test the performance of the classifier. Results show an average accuracy of 85.32% about only 500 ms after stimulus presentation.SignificanceOur results demonstrate, for the first time, that using the proposed feature extraction method, it is possible to classify motor tasks from EEG recordings using a short interval of the data in the order of hundreds of milliseconds (e.g. 500 ms).This duration is considerably shorter than what has been reported before. These results will have significant implications for improving the effectiveness and the speed of BCIs, particularly for those used in assistive technologies.

scholarly journals Sparse Granger Causality Analysis Model Based on Sensors Correlation for Emotion Recognition Classification in Electroencephalography

2021 ◽  
Vol 15 ◽  
Author(s):  
Dongwei Chen ◽  
Rui Miao ◽  
Zhaoyong Deng ◽  
Na Han ◽  
Chunjian Deng
Keyword(s):  
Feature Extraction ◽  
Prior Knowledge ◽  
Granger Causality ◽  
Affective Computing ◽  
Causality Analysis ◽  
Emotion Classification ◽  
Analysis Model ◽  
Granger Causality Analysis ◽  
Model Based ◽  
Eeg Data

In recent years, affective computing based on electroencephalogram (EEG) data has attracted increased attention. As a classic EEG feature extraction model, Granger causality analysis has been widely used in emotion classification models, which construct a brain network by calculating the causal relationships between EEG sensors and select the key EEG features. Traditional EEG Granger causality analysis uses the L2 norm to extract features from the data, and so the results are susceptible to EEG artifacts. Recently, several researchers have proposed Granger causality analysis models based on the least absolute shrinkage and selection operator (LASSO) and the L1/2 norm to solve this problem. However, the conventional sparse Granger causality analysis model assumes that the connections between each sensor have the same prior probability. This paper shows that if the correlation between the EEG data from each sensor can be added to the Granger causality network as prior knowledge, the EEG feature selection ability and emotional classification ability of the sparse Granger causality model can be enhanced. Based on this idea, we propose a new emotional computing model, named the sparse Granger causality analysis model based on sensor correlation (SC-SGA). SC-SGA integrates the correlation between sensors as prior knowledge into the Granger causality analysis based on the L1/2 norm framework for feature extraction, and uses L2 norm logistic regression as the emotional classification algorithm. We report the results of experiments using two real EEG emotion datasets. These results demonstrate that the emotion classification accuracy of the SC-SGA model is better than that of existing models by 2.46–21.81%.

scholarly journals Multimodal Tucker Decomposition for Gated RBM Inference

2021 ◽  
Vol 11 (16) ◽  
pp. 7397
Author(s):  
Mauricio Maldonado-Chan ◽  
Andres Mendez-Vazquez ◽  
Ramon Osvaldo Guardado-Medina
Keyword(s):  
Three Dimensional ◽  
Feature Learning ◽  
Model Parameters ◽  
Affine Transformations ◽  
Tucker Decomposition ◽  
Still Images ◽  
Dimensional Interaction ◽  
Fully Connected ◽  
Image Transformations ◽  
And Training

Gated networks are networks that contain gating connections in which the output of at least two neurons are multiplied. The basic idea of a gated restricted Boltzmann machine (RBM) model is to use the binary hidden units to learn the conditional distribution of one image (the output) given another image (the input). This allows the hidden units of a gated RBM to model the transformations between two successive images. Inference in the model consists in extracting the transformations given a pair of images. However, a fully connected multiplicative network creates cubically many parameters, forming a three-dimensional interaction tensor that requires a lot of memory and computations for inference and training. In this paper, we parameterize the bilinear interactions in the gated RBM through a multimodal tensor-based Tucker decomposition. Tucker decomposition decomposes a tensor into a set of matrices and one (usually smaller) core tensor. The parameterization through Tucker decomposition helps reduce the number of model parameters, reduces the computational costs of the learning process and effectively strengthens the structured feature learning. When trained on affine transformations of still images, we show how a completely unsupervised network learns explicit encodings of image transformations.

Learning Advanced Brain Computer Interface Technology

2019 ◽  
Vol 15 (3) ◽  
pp. 14-27
Author(s):  
Wang Tao ◽  
Wu Linyan ◽  
Li Yanping ◽  
Gao Nuo ◽  
Zhang Weiran
Keyword(s):  
Feature Extraction ◽  
Classification Accuracy ◽  
Wavelet Packet ◽  
Extraction Methods ◽  
Support Vector ◽  
Wavelet Packet Analysis ◽  
Accuracy Rate ◽  
Desirable Outcome ◽  
Eeg Data ◽  
System Data

Feature extraction is an important step in electroencephalogram (EEG) processing of motor imagery, and the feature extraction of EEG directly affects the final classification results. Through the analysis of various feature extraction methods, this article finally selects Common Spatial Patterns (CSP) and wavelet packet analysis (WPA) to extract the feature and uses Support Vector Machine (SVM) to classify and compare these extracted features. For the EEG data provided by GRAZ University, the accuracy rate of feature extraction using CSP algorithm is 85.5%, and the accuracy rate of feature extraction using wavelet packet analysis is 92%. Then this paper analyzes the EEG data collected by Emotiv epoc+ system. The classification accuracy of wavelet packet extracted features can still be maintained at more than 80%, while the classification accuracy of CSP extracted feature is decreased obviously. Experimental results show that the method of wavelet packet analysis towards competition data and Emotiv epoc+ system data can both get a desirable outcome.

Sign in / Sign up

Export Citation Format

Share Document