Approximate entropy for EEG-based movement detection

An approximate entropy feature is tested with parameters appropriate for online BCI - a short calculation window and use of the running standard deviation of the EEG signal. Features are extracted from self-paced real movement data, with various values of the embedding dimension and tolerance of comparison. Two alternative features, band power and reflection coefficients, are extracted for comparative purposes. Class separability is measured using classiffication results from k-means clustering for individual features and linear discriminant analysis for multiple features, as selected by sequential forward floating search. Results show this method of calculating approximate entropy to be a candidate for online movement detection in self-paced BCI systems.

[1]  J. Sprott Chaos and time-series analysis , 2001 .

[2]  S M Pincus,et al.  Approximate entropy as a measure of system complexity. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Josef Kittler,et al.  Floating search methods in feature selection , 1994, Pattern Recognit. Lett..

[4]  H. Kantz,et al.  Nonlinear time series analysis , 1997 .

[5]  S. J. Roberts,et al.  Temporal and spatial complexity measures for electroencephalogram based brain-computer interfacing , 2006, Medical & Biological Engineering & Computing.

[6]  V. Srinivasan,et al.  Approximate Entropy-Based Epileptic EEG Detection Using Artificial Neural Networks , 2007, IEEE Transactions on Information Technology in Biomedicine.

[7]  I. Rezek,et al.  Stochastic complexity measures for physiological signal analysis , 1998, IEEE Transactions on Biomedical Engineering.