Applicability of Hyperdimensional Computing to Seizure Detection

IEEE Open Journal of Circuits and Systems

Lulu Ge¹  Keshab K. Parhi¹ 

[1] Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA;

关键词: Hyperdimensional (HD) computing;    classification;    seizure detection;    local binary pattern (LBP);    power spectral density (PSD);    Fisher score;   

DOI  :  10.1109/OJCAS.2022.3163075

来源: DOAJ

【 摘 要 】

Hyperdimensional (HD) computing is a form of brain-inspired computing which can be applied to numerous classification problems. In past research, it has been shown that seizures can be detected from electroencephalograms (EEG) with high accuracy using local binary pattern (LBP) encoding. This paper explores applicability of binary HD computing to seizure detection from intra-cranial EEG (iEEG) data from the Kaggle seizure detection contest based on using both LBP and power spectral density (PSD) features. In the PSD method, three novel approaches to HD classification are presented for both selected features and all features. These are referred as single classifier long hypervector, multiple classifiers, and single classifier short hypervector. To visualize the quality of classification of test data, a hypervector distance plot is introduced that plots the Hamming distance of the query hpervectors from one class hypervector vs. that from the other. Simulation results show that: 1). LBP method offers an average 80.9% test accuracy, 71.9% sensitivity, 81.4% specificity and 76.6% test AUC whereas the PSD method can achieve an average of 91.0% test accuracy, 81.8% sensitivity, 92.0% specificity and 86.9% test AUC. 2). The average seizure detection latency is 2.5s for LBP method and is 4.5s for the PSD methods. This average latency, less than 5s, is a relevant parameter for fast drug delivery, indicating that both LBP and PSD methods are able to detect the seizures in a timely manner. The performance using selected PSD features is better than that using all features. 3). It is shown that the dimensionality of the hypervector can be reduced to 1, 000 bits for LBP and PSD methods from 10, 000. Futhermore, for some approaches of selected features, the dimensionality of the hypervector can be reduced to 100 bits.

【 授权许可】

Unknown