CLASSIFICATION OF EYE STATE BASED ON EEG DATA USING RECURRENCE ANALYSIS

The relevance of this study is driven by the growing interest in portable EEG devices and the need to develop efficient algorithms for analyzing brain activity with limited technical resources. This paper addresses the problem of classifying brain states based on elec-troencephalography (EEG) data to distinguish between two specific states: relaxation and concentration. The classification of open and closed eyes is examined, as eye closure is asso-ciated with increased relaxation. A classification method based on the quantitative analysis of recurrence plots, which is one of the approaches of chaos theory, is proposed and compared with traditional brain rhythm analysis. Experimental results showed that the recurrence anal-ysis method outperforms spectral analysis in classification accuracy, particularly for the O1 point, where accuracy increased from 86% to 95%. The optimal parameters for phase space reconstruction were determined: delay 25 ms and dimension of the embedding space 4, which are consistent with the spectral characteristics of the signal. Feature importance analysis re-vealed that the most significant parameters for classification are entropy, the length of white vertical and diagonal lines in recurrence plots, as well as determinism and laminarity. The obtained results may be useful for developing EEG analysis algorithms in portable devices and applications in the fields of brain-computer interfaces and cognitive training.

Authors

Publication Details

Journal
System technologies
Published
2025-04-23
DOI
https://doi.org/10.34185/1562-9945-3-158-2025-07
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CLASSIFICATION OF EYE STATE BASED ON EEG DATA USING RECURRENCE ANALYSIS

Vasiliy Ye. Belozyorov, Y. S. Panasenko
System technologies
Face and Expression Recognition
article

CLASSIFICATION OF EYE STATE BASED ON EEG DATA USING RECURRENCE ANALYSIS

Vasiliy Ye. Belozyorov, Y. S. Panasenko
article en

Abstract

The relevance of this study is driven by the growing interest in portable EEG devices and the need to develop efficient algorithms for analyzing brain activity with limited technical resources. This paper addresses the problem of classifying brain states based on elec-troencephalography (EEG) data to distinguish between two specific states: relaxation and concentration. The classification of open and closed eyes is examined, as eye closure is asso-ciated with increased relaxation. A classification method based on the quantitative analysis of recurrence plots, which is one of the approaches of chaos theory, is proposed and compared with traditional brain rhythm analysis. Experimental results showed that the recurrence anal-ysis method outperforms spectral analysis in classification accuracy, particularly for the O1 point, where accuracy increased from 86% to 95%. The optimal parameters for phase space reconstruction were determined: delay 25 ms and dimension of the embedding space 4, which are consistent with the spectral characteristics of the signal. Feature importance analysis re-vealed that the most significant parameters for classification are entropy, the length of white vertical and diagonal lines in recurrence plots, as well as determinism and laminarity. The obtained results may be useful for developing EEG analysis algorithms in portable devices and applications in the fields of brain-computer interfaces and cognitive training.

System technologiesVol. 3(158)
Openalex Percentile: Top 93%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.