Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties

Authors

  • Mona Azizi PHD, Department of Physic, Hakim Sabzevari University, Sabzevar, Iran, Telephone: 051-44012609, Fax: 051-44012605, [email protected]
  • Zeynab Mohammadpoory PHD, Department of Biomedical Engineering, Hakim Sabzevari University, Sabzevar, Iran, Telephone: 051-44012609, Fax: 051-44012605, [email protected]
Abstract:

Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorithm.   Materials and Methods: Single channel EEG signals are mapped into the LPVGs and then 14 features are calculated from these graphs. Then some features are selected using Sequential forward feature selection method and given to error-correcting output codes (ECOC) to classify signals into three groups of healthy, seizure free (interictal) and during a seizure (ictal) groups. Results: Experimental results show our method can classify normal, ictal and interictal groups with a high accuracy of 96.31%. Conclusion: The proposed method is fast and easy. Comparison the performance of the proposed method with other automatic seizure detection method also shows our method has better performance.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Multiscale limited penetrable horizontal visibility graph for analyzing nonlinear time series

Visibility graph has established itself as a powerful tool for analyzing time series. We in this paper develop a novel multiscale limited penetrable horizontal visibility graph (MLPHVG). We use nonlinear time series from two typical complex systems, i.e., EEG signals and two-phase flow signals, to demonstrate the effectiveness of our method. Combining MLPHVG and support vector machine, we detec...

full text

Sampling from social networks’s graph based on topological properties and bee colony algorithm

In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...

full text

Routing on the Visibility Graph

We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let P be a set of n points in the plane and let S be a set of non-crossing line segments whose endpoints are in P . We present two deterministic 1-local O(1)-memory routing algorithms that are guaranteed to find a path of at most linea...

full text

On the visibility graph of convex translates

We show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight. ? 2001 Elsevier Science B.V. All rights reserved.

full text

Visibility Graph Based Time Series Analysis

Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a...

full text

Visibility graph motifs

Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of visibility graph motifs, smaller substructures that appear with characteristic frequencies. We develop ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 15  issue Special Issue-12th. Iranian Congress of Medical Physics

pages  286- 286

publication date 2018-12-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023