arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.07807cs.LGcs.HCeess.SP
收藏

使用黎曼概率的贝叶斯累积的端到端P300 BCI

End-to-end P300 BCI using Bayesian accumulation of Riemannian probabilities

Foxstream(Foxstream公司);Université Paris-Saclay(巴黎萨克雷大学);UVSQ(凡尔赛大学)

Quentin Barthélemy, Sylvain Chevallier, Raphaëlle Bertrand-Lalo, Pierre Clisson

摘要:

在脑机接口(BCI)中,基于事件相关电位(ERP)的P300检测方法主要针对拼写任务的单次分类。虽然这是一个重要的目标,但现有的P300 BCI仍然需要多次重复才能实现正确的分类精度。P300 BCI中的信号处理和机器学习进展主要围绕P300检测部分,而将字符分类排除在范围之外。为了减少重复的次数,同时保持良好的字符分类,关键是要接受完整的分类问题。我们引入了一个端到端的管道,从特征提取开始,由使用概率黎曼MDM的ERP级分类组成,该概率黎曼MDM使用贝叶斯累积试验的置信度来提供字符级分类。虽然现有的方法只在字符闪烁时增加字符的置信度,但我们的新管道称为黎曼概率的贝叶斯累积(ASAP),在每次闪烁后更新每个字符的置信度。我们提供了适当的推导和理论重构的贝叶斯方法的信息从信号到BCI字符的无缝处理。我们证明了我们的方法在公共P300数据集上的表现明显优于标准方法。

英文摘要:

In brain-computer interfaces (BCI), most of the approaches based on event-related potential (ERP) focus on the detection of P300, aiming for single trial classification for a speller task. While this is an important objective, existing P300 BCI still require several repetitions to achieve a correct classification accuracy. Signal processing and machine learning advances in P300 BCI mostly revolve around the P300 detection part, leaving the character classification out of the scope. To reduce the number of repetitions while maintaining a good character classification, it is critical to embrace the full classification problem. We introduce an end-to-end pipeline, starting from feature extraction, and is composed of an ERP-level classification using probabilistic Riemannian MDM which feeds a character-level classification using Bayesian accumulation of confidence across trials. Whereas existing approaches only increase the confidence of a character when it is flashed, our new pipeline, called Bayesian accumulation of Riemannian probabilities (ASAP), update the confidence of each character after each flash. We provide the proper derivation and theoretical reformulation of this Bayesian approach for a seamless processing of information from signal to BCI characters. We demonstrate that our approach performs significantly better than standard methods on public P300 datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑