TY - JOUR

T1 - Применение алгоритма "Полоска" для онлайнового декодирования ЭЭГ-паттернов

AU - Липкович, Михаил

AU - Сагатдинов, Артур Ринатович

PY - 2023/6/13

Y1 - 2023/6/13

N2 - In this paper, we consider the problem of determining the hand with which the subject intends to make a movement according to the signals of the electroencephalogram. The relevance of the task is due to the wide spread of brain-computer interfaces, where electroencephalography is one of the main non-invasive methods for obtaining signals from the brain. To solve the problem, temporal and frequency features are selected from the segments of signals preceding the movement, which are fed to the input of the classification machine learning model. In contrast to the standard supervised learning setup, it is assumed that there is no predefined training data set and the training samples for the model are received one after another. Thus, a situation is simulated in which the model must work with a new subject and adjust to them in real time. The traditional method for training linear models in such a paradigm is stochastic gradient descent. Previously, it was shown that the "Stripe" algorithm developed by Yakubovich for a certain problem has a higher convergence rate than stochastic gradient descent. However, this is achieved by performing algorithm step on each feature of the sample. Thus, that version of "Stripe" is not suitable for working with high-dimensional data. This article discusses another version of "Stripe" that does not have this drawback. It is shown that the proposed algorithm has a higher rate of one learning step compared to traditional linear models based on stochastic gradient descent on the BCI competition II dataset.

AB - In this paper, we consider the problem of determining the hand with which the subject intends to make a movement according to the signals of the electroencephalogram. The relevance of the task is due to the wide spread of brain-computer interfaces, where electroencephalography is one of the main non-invasive methods for obtaining signals from the brain. To solve the problem, temporal and frequency features are selected from the segments of signals preceding the movement, which are fed to the input of the classification machine learning model. In contrast to the standard supervised learning setup, it is assumed that there is no predefined training data set and the training samples for the model are received one after another. Thus, a situation is simulated in which the model must work with a new subject and adjust to them in real time. The traditional method for training linear models in such a paradigm is stochastic gradient descent. Previously, it was shown that the "Stripe" algorithm developed by Yakubovich for a certain problem has a higher convergence rate than stochastic gradient descent. However, this is achieved by performing algorithm step on each feature of the sample. Thus, that version of "Stripe" is not suitable for working with high-dimensional data. This article discusses another version of "Stripe" that does not have this drawback. It is shown that the proposed algorithm has a higher rate of one learning step compared to traditional linear models based on stochastic gradient descent on the BCI competition II dataset.

UR - https://www.mendeley.com/catalogue/100b5883-32e5-3e42-b2c9-f6aca4747920/

U2 - 10.17587/mau.24.300-306

DO - 10.17587/mau.24.300-306

M3 - статья

VL - 24

SP - 300

EP - 306

JO - Mekhatronika, Avtomatizatsiya, Upravlenie

JF - Mekhatronika, Avtomatizatsiya, Upravlenie

SN - 1684-6427

IS - 6

ER -