An Original Algorithm for Classifying Premotor Potentials in Electroencephalogram Signal for Neurorehabilitation Using a Closed-Loop Brain–Computer Interface

IF 0.4 4区 物理与天体物理 Q4 PHYSICS, MULTIDISCIPLINARY
A. I. Saevskiy, I. E. Shepelev, I. V. Shcherban
{"title":"An Original Algorithm for Classifying Premotor Potentials in Electroencephalogram Signal for Neurorehabilitation Using a Closed-Loop Brain–Computer Interface","authors":"A. I. Saevskiy,&nbsp;I. E. Shepelev,&nbsp;I. V. Shcherban","doi":"10.3103/S0027134924702345","DOIUrl":null,"url":null,"abstract":"<p>Over the past decades, brain–computer interfaces (BCIs) have been rapidly evolving. A BCI is a system that records brain activity signals using electrophysiological methods and then processes these signals to generate control commands. The most challenging aspect of BCIs is the nonstationary nature of brain signals, which makes it difficult to achieve stable and accurate decoding. Therefore, developing robust methods for processing and classifying EEG signals to extract control commands is a critical research area. A related challenge is the low signal-to-noise ratio in EEG data, especially when target patterns are weak or the data is labeled inaccurately. This paper presents the results of an evaluation of an approach combining feature extraction and data augmentation techniques to address the aforementioned challenges applied to the classification of premotor potentials. The approach is based on the application of linear discriminant analysis (LDA) to sequentially extract informative components in the frequency and time domains For the first time, the applicability of this algorithm to EEG containing premotor patterns of real movements is demonstrated. Features of different nature (spectral power, Hjorth parameters, interchannel correlations) were tested and compared with each other and a traditional approach based on common spatial patterns and a linear classifier. It is shown that transformations in the frequency domain alone improve accuracy from 63.9<span>\\(\\%\\)</span> in the traditional approach to 77.5<span>\\(\\%\\)</span> on a dataset of 16 experiments on different subjects. With additional transformation in the time domain, accuracy increases to 98.8<span>\\(\\%\\)</span>. On average, across different model configurations, a segment length of 500 ms is the most optimal. Two approaches were developed and tested to achieve algorithm universality across subjects: universal transformations in frequency domain trained on data from all subjects and without this step at all. It is shown that accuracies of up to 98.3<span>\\(\\%\\)</span> can be achieved with such approaches. A discussion of optimal frequency bands, segment lengths, and features is provided. Thus, data from different subjects can be effectively classified by a common model, which is rare in global research and is usually accompanied by a number of assumptions, cumbersome models, and inferior accuracy. Thus, in addition to the achieved accuracy enhancement, the proposed algorithm exhibits robustness to transient noise and artifacts through signal segmentation into short epochs. It also effectively addresses the critical task of extracting informative signal components in scenarios with potentially imprecise expert annotations. Finally, it can be adapted to mitigate the need for subject-specific calibration. These attributes render the proposed algorithm suitable for real-time applications, including closed-loop BCIs for addressing the pressing challenge of neurorehabilitation.</p>","PeriodicalId":711,"journal":{"name":"Moscow University Physics Bulletin","volume":"79 2 supplement","pages":"S890 - S897"},"PeriodicalIF":0.4000,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Physics Bulletin","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.3103/S0027134924702345","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Over the past decades, brain–computer interfaces (BCIs) have been rapidly evolving. A BCI is a system that records brain activity signals using electrophysiological methods and then processes these signals to generate control commands. The most challenging aspect of BCIs is the nonstationary nature of brain signals, which makes it difficult to achieve stable and accurate decoding. Therefore, developing robust methods for processing and classifying EEG signals to extract control commands is a critical research area. A related challenge is the low signal-to-noise ratio in EEG data, especially when target patterns are weak or the data is labeled inaccurately. This paper presents the results of an evaluation of an approach combining feature extraction and data augmentation techniques to address the aforementioned challenges applied to the classification of premotor potentials. The approach is based on the application of linear discriminant analysis (LDA) to sequentially extract informative components in the frequency and time domains For the first time, the applicability of this algorithm to EEG containing premotor patterns of real movements is demonstrated. Features of different nature (spectral power, Hjorth parameters, interchannel correlations) were tested and compared with each other and a traditional approach based on common spatial patterns and a linear classifier. It is shown that transformations in the frequency domain alone improve accuracy from 63.9\(\%\) in the traditional approach to 77.5\(\%\) on a dataset of 16 experiments on different subjects. With additional transformation in the time domain, accuracy increases to 98.8\(\%\). On average, across different model configurations, a segment length of 500 ms is the most optimal. Two approaches were developed and tested to achieve algorithm universality across subjects: universal transformations in frequency domain trained on data from all subjects and without this step at all. It is shown that accuracies of up to 98.3\(\%\) can be achieved with such approaches. A discussion of optimal frequency bands, segment lengths, and features is provided. Thus, data from different subjects can be effectively classified by a common model, which is rare in global research and is usually accompanied by a number of assumptions, cumbersome models, and inferior accuracy. Thus, in addition to the achieved accuracy enhancement, the proposed algorithm exhibits robustness to transient noise and artifacts through signal segmentation into short epochs. It also effectively addresses the critical task of extracting informative signal components in scenarios with potentially imprecise expert annotations. Finally, it can be adapted to mitigate the need for subject-specific calibration. These attributes render the proposed algorithm suitable for real-time applications, including closed-loop BCIs for addressing the pressing challenge of neurorehabilitation.

Abstract Image

求助全文
约1分钟内获得全文 求助全文
来源期刊
Moscow University Physics Bulletin
Moscow University Physics Bulletin PHYSICS, MULTIDISCIPLINARY-
CiteScore
0.70
自引率
0.00%
发文量
129
审稿时长
6-12 weeks
期刊介绍: Moscow University Physics Bulletin publishes original papers (reviews, articles, and brief communications) in the following fields of experimental and theoretical physics: theoretical and mathematical physics; physics of nuclei and elementary particles; radiophysics, electronics, acoustics; optics and spectroscopy; laser physics; condensed matter physics; chemical physics, physical kinetics, and plasma physics; biophysics and medical physics; astronomy, astrophysics, and cosmology; physics of the Earth’s, atmosphere, and hydrosphere.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信