z-logo
open-access-imgOpen Access
Analysing epileptic EEGs with a visibility graph algorithm
Author(s) -
Guohun Zhu,
Yan Li,
Peng Wen
Publication year - 2012
Publication title -
university of southern queensland eprints (university of southern queensland)
Language(s) - English
Resource type - Conference proceedings
ISBN - 978-1-4673-1183-0
DOI - 10.1109/bmei.2012.6513212
Subject(s) - visibility graph , electroencephalography , visibility , graph , degree (music) , computer science , pattern recognition (psychology) , ictal , artificial intelligence , algorithm , mathematics , psychology , neuroscience , theoretical computer science , physics , geometry , regular polygon , acoustics , optics
This paper analyzes the human epileptic lectroencephalogram (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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom