ArticleFrontiers in neuroinformatics2019
Detection of EEG K-Complexes Using Fractal Dimension of Time Frequency Images Technique Coupled With Undirected Graph Features.
Article in Frontiers in neuroinformatics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
6 citing papers in PubMed.
- Article
- Temporal Feature Extraction and Machine Learning for Classification of Sleep Stages Using Telemetry Polysomnography.Brain sciences · 2023Article
- A RUSBoosted tree method for k-complex detection using tunable Q-factor wavelet transform and multi-domain feature extraction.Frontiers in neuroscience · 2023Article
- A study on feature selection using multi-domain feature extraction for automated k-complex detection.Frontiers in neuroscience · 2023Article
- Detection of K-complexes in EEG waveform images using faster R-CNN and deep transfer learning.BMC medical informatics and decision making · 2022Article
- Automatic Detection of K-Complexes Using the Cohen Class Recursiveness and Reallocation Method and Deep Neural Networks with EEG Signals.Sensors (Basel, Switzerland) · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
K-complexes identification is a challenging task in sleep research. The detection of k-complexes in electroencephalogram (EEG) signals based on visual inspection is time consuming, prone to errors, and requires well-trained knowledge. Many existing methods for k-complexes detection rely mainly on analyzing EEG signals in time and frequency domains. In this study, an efficient method is proposed to detect k-complexes from EEG signals based on fractal dimension (FD) of time frequency (T-F) images coupled with undirected graph features. Firstly, an EEG signal is partitioned into smaller segments using a sliding window technique. Each EEG segment is passed through a spectrogram of short time Fourier transform (STFT) to obtain the T-F images. Secondly, the box counting method is applied to each T-F image to discover the FDs in EEG signals. A vector of FD features are extracted from each T-F image and then mapped into an undirected graph. The structural properties of the graphs are used as the representative features of the original EEG signals for the input of a least square support vector machine (LS-SVM) classifier. Key graphic features are extracted from the undirected graphs. The extracted graph features are forwarded to the LS-SVM for classification. To investigate the classification ability of the proposed feature extraction combined with the LS-SVM classifier, the extracted features are also forwarded to a k-means classifier for comparison. The proposed method is compared with several existing k-complexes detection methods in which the same datasets were used. The findings of this study shows that the proposed method yields better classification results than other existing methods in the literature. An average accuracy of 97% for the detection of the k-complexes is obtained using the proposed method. The proposed method could lead to an efficient tool for the scoring of automatic sleep stages which could be useful for doctors and neurologists in the diagnosis and treatment of sleep disorders and for sleep research.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.