Improving P300 Speller performance by means of optimization and machine learning
Luigi Bianchi, Chiara Liti, Giampaolo Liuzzi, Veronica Piccialli,, Cecilia Salvatore

TL;DR
This paper enhances P300 BCI performance by developing new decision functions and SVM training methods, improving accuracy and communication speed through optimization and machine learning techniques tested on public datasets.
Contribution
It introduces a novel decision function and SVM training approach to boost classification accuracy and efficiency in P300-based BCIs, applicable in both fixed and early stopping scenarios.
Findings
Improved classification accuracy and Information Transfer Rate.
Effective performance gains demonstrated on multiple datasets.
Enhanced target detection process in P300 BCIs.
Abstract
Brain-Computer Interfaces (BCIs) are systems allowing people to interact with the environment bypassing the natural neuromuscular and hormonal outputs of the peripheral nervous system (PNS). These interfaces record a user's brain activity and translate it into control commands for external devices, thus providing the PNS with additional artificial outputs. In this framework, the BCIs based on the P300 Event-Related Potentials (ERP), which represent the electrical responses recorded from the brain after specific events or stimuli, have proven to be particularly successful and robust. The presence or the absence of a P300 evoked potential within the EEG features is determined through a classification algorithm. Linear classifiers such as SWLDA and SVM are the most used for ERPs' classification. Due to the low signal-to-noise ratio of the EEG signals, multiple stimulation sequences (a.k.a.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsEarly Stopping · Support Vector Machine
