| Literature DB >> 29628883 |
Panteleimon Chriskos1, Christos A Frantzidis1,2, Polyxeni T Gkivogkli1,2, Panagiotis D Bamidis1,2, Chrysoula Kourtidou-Papadeli2,3.
Abstract
Sleep staging, the process of assigning labels to epochs of sleep, depending on the stage of sleep they belong, is an arduous, time consuming and error prone process as the initial recordings are quite often polluted by noise from different sources. To properly analyze such data and extract clinical knowledge, noise components must be removed or alleviated. In this paper a pre-processing and subsequent sleep staging pipeline for the sleep analysis of electroencephalographic signals is described. Two novel methods of functional connectivity estimation (Synchronization Likelihood/SL and Relative Wavelet Entropy/RWE) are comparatively investigated for automatic sleep staging through manually pre-processed electroencephalographic recordings. A multi-step process that renders signals suitable for further analysis is initially described. Then, two methods that rely on extracting synchronization features from electroencephalographic recordings to achieve computerized sleep staging are proposed, based on bivariate features which provide a functional overview of the brain network, contrary to most proposed methods that rely on extracting univariate time and frequency features. Annotation of sleep epochs is achieved through the presented feature extraction methods by training classifiers, which are in turn able to accurately classify new epochs. Analysis of data from sleep experiments on a randomized, controlled bed-rest study, which was organized by the European Space Agency and was conducted in the "ENVIHAB" facility of the Institute of Aerospace Medicine at the German Aerospace Center (DLR) in Cologne, Germany attains high accuracy rates, over 90% based on ground truth that resulted from manual sleep staging by two experienced sleep experts. Therefore, it can be concluded that the above feature extraction methods are suitable for semi-automatic sleep staging.Entities:
Keywords: artificial intelligence; classification; computerized sleep staging; electroencephalogram; feature extraction; functional connectivity; graph theory
Year: 2018 PMID: 29628883 PMCID: PMC5877486 DOI: 10.3389/fnhum.2018.00110
Source DB: PubMed Journal: Front Hum Neurosci ISSN: 1662-5161 Impact factor: 3.169
Figure 1Pre-processing pipeline: After the EEG signal has been recorded it is segmented into five parts which are digitally filtered through Butterworth filters of 3rd order. Then, Independent Component Analysis is performed through the EEGLAB graphical interface and components corresponding to industrial noise, linear trends, muscle movements, bad electrode placement, eye blinks are visually rejected. Finally, epochs of 30 s of continuous, non-overlapping, artifact free data are formed according to the guidelines of the American Association of Sleep Medicine (AASM).
Figure 2Feature extraction: For each epoch, the feature extraction procedure takes place during which features that quantify the macroscopic organization of the brain during sleep are extracted. Two alternative functional connectivity methodologies (Synchronization Likelihood and Relative Wavelet Entropy) are investigated. The synchronization matrices are used through concepts derived from graph theory (small-world property, cluster coefficient, characteristic path length, betweenness centrality, node degree) to form the feature vectors used for the computerized staging.
Graph metrics.
| Node degree | Number of immediate neighbors of each node |
| Clustering coefficient | Strength of node connection |
| Characteristic path efficiency and length | Length and efficiency of the shortest path connecting all nodes |
| Connection density | Number of connections present in a graph divided by the total possible connections of the same graph |
| Centrality | Number of shortest paths connecting all other pairs of nodes that incorporate the given node |
| Small world metric | Quantifies the average distance between nodes in a graph |
Sleep stage classification results.
| 1 | Euclidean | 100.00 | 72.55 | 100.00 | 89.95 |
| 3 | Euclidean | 85.80 | 74.86 | 96.26 | 90.90 |
| 5 | Euclidean | 83.40 | 76.22 | 94.39 | 91.44 |
| 1 | Cityblock | 100.00 | 67.93 | 100.00 | 88.18 |
| 3 | Cityblock | 84.40 | 71.33 | 95.79 | 89.40 |
| 5 | Cityblock | 80.48 | 73.10 | 94.16 | 89.95 |
| 1 | Cosine | 100.00 | 73.91 | 100.00 | 89.95 |
| 3 | Cosine | 88.66 | 77.17 | 96.26 | 91.85 |
| 5 | Cosine | 85.97 | 78.26 | 94.45 | 91.44 |
| 0.1 | Linear | 73.35 | 71.74 | 87.61 | 85.05 |
| 10 | Linear | 89.42 | 79.35 | 99.24 | 90.22 |
| 100 | Linear | 93.28 | 76.49 | 100.00 | 90.49 |
| 0.1 | Polynomial, | 53.83 | 52.72 | 99.65 | 91.44 |
| 10 | Polynomial, | 90.77 | 80.98 | 100.00 | 91.58 |
| 100 | Polynomial, | 99.59 | 82.07 | 100.00 | 91.58 |
| 0.1 | Polynomial, | 51.14 | 51.22 | 100.00 | 91.58 |
| 10 | Polynomial, | 86.44 | 78.94 | 100.00 | 91.58 |
| 100 | Polynomial, | 98.48 | 82.34 | 100.00 | 91.58 |
| 0.1 | Gaussian, σSL = 1.95 σRWE = 0.25 | 71.65 | 67.53 | 80.30 | 78.13 |
| 10 | Gaussian, σSL = 1.95 σRWE = 0.25 | 100.00 | 100.00 | ||
| 100 | Gaussian, σSL = 1.95 σRWE = 0.25 | 100.00 | 86.82 | 100.00 | 92.80 |
| 0.1 | Gaussian, σSL = 1.45 σRWE = 0.75 | 72.71 | 69.57 | 78.73 | 74.73 |
| 10 | Gaussian, σSL = 1.45 σRWE = 0.75 | 100.00 | 86.28 | 100.00 | 92.66 |
| 100 | Gaussian, σSL = 1.45 σRWE = 0.75 | 100.00 | 86.28 | 100.00 | 92.66 |
| 10 | – | 85.80 | 78.26 | 94.16 | 87.77 |
| 30 | – | 83.82 | 79.48 | 96.67 | 90.49 |
| 50 | – | 84.04 | 78.94 | 95.79 | 90.22 |
| 100 | – | 86.62 | 80.16 | 94.39 | 88.59 |
| 50 | 50 | 86.73 | 78.13 | 96.20 | 89.54 |
| 100 | 50 | 86.09 | 79.89 | 97.49 | 89.13 |
| 100 | 100 | 86.97 | 79.08 | 95.27 | 88.72 |
Bold values are the maximum achieved accuracy for each feature extraction method.
Figure 3Computer-assisted classification is performed with various classifiers such as the k-Nearest Neighbors (kNN), Support Vector Machines (SVMs) and Neural Networks (NNs). Various classification parameters are employed in a comparative analysis.
Confusion matrix for the Gaussian kernel SVM classifier (σ = 1.95) that achieved maximum accuracy with synchronization likelihood features.
| Output Class | N1 | 39 | 4 | 1 | 0 | 88.6% |
| N2 | 18 | 286 | 31 | 6 | 83.9% | |
| N3 | 3 | 23 | 212 | 3 | 88.0% | |
| REM | 0 | 5 | 3 | 102 | 92.7% | |
| 65.0% | 89.9% | 85.8% | 91.9% | 86.8% | ||
| N1 | N2 | N3 | REM | |||
| Target Class | ||||||
Confusion matrix for the Gaussian kernel SVM classifier (σ = 0.25) that achieved maximum accuracy with relative wavelet entropy features.
| Output Class | N1 | 47 | 4 | 0 | 0 | 92.2% |
| N2 | 12 | 300 | 16 | 4 | 90.4% | |
| N3 | 1 | 12 | 231 | 1 | 94.3% | |
| REM | 0 | 2 | 0 | 106 | 98.1% | |
| 78.3% | 94.3% | 93.5% | 95.5% | 92.9% | ||
| N1 | N2 | N3 | REM | |||
| Target Class | ||||||