DocumentCode :
598776
Title :
A new complexity-based algorithmic procedures for electroencephalogram (EEG) segmentation
Author :
Darkhovsky, B. ; Piryatinska, A.
Author_Institution :
Inst. for Syst. Anal., Moscow, Russia
fYear :
2012
fDate :
1-1 Dec. 2012
Firstpage :
1
Lastpage :
5
Abstract :
Electroencephalogram (EEG) signals are complex and non-stationary. To analyze and model EEG records the segmentation of the signal into (quasi)- stationary intervals is needed. In this paper we propose a novel approach for the segmentation problem that occurs in “long” EEG records. This approach utilizes the concept of complexity of a continuous function. The complexity of a continuous function is defined as the fraction of the function values necessary to recover the original function via a certain fixed family of approximation methods without exceeding a given error. We applied this approach to the EEG signal of neonates to identify sleep stages. Our results showed 82-86% average agreement with the manual scoring provided by an expert pediatric neurologist.
Keywords :
approximation theory; electroencephalography; medical signal processing; neurophysiology; paediatrics; sleep; EEG signal recording; EEG signal segmentation; approximation methods; complexity-based algorithmic procedures; continuous function complexity; electroencephalogram segmentation; expert pediatric neurologist; manual scoring; neonates; quasistationary intervals; sleep stages; Approximation methods; Brain modeling; Complexity theory; Electroencephalography; Manuals; Pediatrics; Sleep; EEG; complexity; segmentation; time series;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing in Medicine and Biology Symposium (SPMB), 2012 IEEE
Conference_Location :
New York, NY
Print_ISBN :
978-1-4673-5665-7
Type :
conf
DOI :
10.1109/SPMB.2012.6469462
Filename :
6469462
Link To Document :
بازگشت