DocumentCode
2139351
Title
Analysing epileptic EEGs with a visibility graph algorithm
Author
Guohun Zhu ; Yan Li ; Peng Wen
Author_Institution
Dept. of Math. & Comput., Univ. of Southern Queensland, Toowoomba, QLD, Australia
fYear
2012
fDate
16-18 Oct. 2012
Firstpage
432
Lastpage
436
Abstract
This paper analyzes the human epileptic electroencephalogram (EEG) based on a visibility graph algorithm. A single-channel EEG is mapped into a visibility graph (VG). Then its mean degree and degree distribution on the VG are extracted. It is shown that the mean degree on a VG from an epileptic subject is larger than that on a healthy subject based on the VG. The number of nodes having five degree on a VG from a healthy subject is significantly different from the number of nodes having the same degree on the VG from an epileptic subject. The mean degree and the number of nodes with five and eight degrees are used to discriminate the healthy EEGs, seizure EEGs and inter-ictal EEGs. Experimental results demonstrate that the visibility graph algorithm has a high classification accuracy to identify these three types of EEGs.
Keywords
electroencephalography; feature extraction; graph theory; medical disorders; medical signal processing; signal classification; EEG type; classification accuracy; epileptic EEG; feature extraction; human epileptic electroencephalogram; interictal EEG; mean degree distribution; node number; seizure EEG; single-channel EEG; visibility graph algorithm; EEG; Seizure; degree distribtuion; nonlinear discriminat analysis; visiblity graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Biomedical Engineering and Informatics (BMEI), 2012 5th International Conference on
Conference_Location
Chongqing
Print_ISBN
978-1-4673-1183-0
Type
conf
DOI
10.1109/BMEI.2012.6513212
Filename
6513212
Link To Document