p300拼字机上累积MDRM的实验验证。

IF 1.6 4区 医学 Q3 CLINICAL NEUROLOGY
Fodil Zerrouki, Salah Haddab
{"title":"p300拼字机上累积MDRM的实验验证。","authors":"Fodil Zerrouki,&nbsp;Salah Haddab","doi":"10.1177/15500594221078166","DOIUrl":null,"url":null,"abstract":"<p><p>The P300 speller Machine is among the leading applications of the electroencephalography (EEG)-based brain computer interfaces (BCIs), it is still a benchmark and a persistent challenge for the BCI Community. EEG signal classification represents the key piece of a BCI chain. The minimum distance to Riemannian mean (MDRM) belongs to these classification methods emerging in different BCI applications such as text spelling by thought. Based on a binary classification of each covariance matrix separately, character prediction is done according to the highest score across the whole set of all repetitions. Minimum cumulative distance to Riemannian mean (MCDRM) is a Cumulative variant of the MDRM, perfectly adapted to the P300 Speller Machine. The power of this variant is that prediction takes a more global proceeding involving the <i>n</i> repetitions together. Indeed, thanks to cumulative distances selected row and column are those having the covariance matrices both closer to the Target barycenter and farther from the non-Target one. This variant overcomes the main MDRM limitations as it improves inter-sessional generalization, allows optimal use of all repetitions and reduces considerably the risk of conflict appearing during the selection of rows and columns leading to character prediction. We applied this variant to the raw signals of Data set II-b of Berlin BCI and compared to the published results the MCDRM offers significantly higher results: 97.5% of correct predictions compared to the 96.5% of the competition winner. The MCDRM fits best with the P300 Speller machine, especially when dealing with noisy signals that requires intelligent and optimal usage of the <i>n</i> repetitions.</p>","PeriodicalId":10682,"journal":{"name":"Clinical EEG and Neuroscience","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Experimental Validation of the Cumulative MDRM in theP300 Speller Machine.\",\"authors\":\"Fodil Zerrouki,&nbsp;Salah Haddab\",\"doi\":\"10.1177/15500594221078166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>The P300 speller Machine is among the leading applications of the electroencephalography (EEG)-based brain computer interfaces (BCIs), it is still a benchmark and a persistent challenge for the BCI Community. EEG signal classification represents the key piece of a BCI chain. The minimum distance to Riemannian mean (MDRM) belongs to these classification methods emerging in different BCI applications such as text spelling by thought. Based on a binary classification of each covariance matrix separately, character prediction is done according to the highest score across the whole set of all repetitions. Minimum cumulative distance to Riemannian mean (MCDRM) is a Cumulative variant of the MDRM, perfectly adapted to the P300 Speller Machine. The power of this variant is that prediction takes a more global proceeding involving the <i>n</i> repetitions together. Indeed, thanks to cumulative distances selected row and column are those having the covariance matrices both closer to the Target barycenter and farther from the non-Target one. This variant overcomes the main MDRM limitations as it improves inter-sessional generalization, allows optimal use of all repetitions and reduces considerably the risk of conflict appearing during the selection of rows and columns leading to character prediction. We applied this variant to the raw signals of Data set II-b of Berlin BCI and compared to the published results the MCDRM offers significantly higher results: 97.5% of correct predictions compared to the 96.5% of the competition winner. The MCDRM fits best with the P300 Speller machine, especially when dealing with noisy signals that requires intelligent and optimal usage of the <i>n</i> repetitions.</p>\",\"PeriodicalId\":10682,\"journal\":{\"name\":\"Clinical EEG and Neuroscience\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Clinical EEG and Neuroscience\",\"FirstCategoryId\":\"3\",\"ListUrlMain\":\"https://doi.org/10.1177/15500594221078166\",\"RegionNum\":4,\"RegionCategory\":\"医学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"CLINICAL NEUROLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Clinical EEG and Neuroscience","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.1177/15500594221078166","RegionNum":4,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"CLINICAL NEUROLOGY","Score":null,"Total":0}
引用次数: 0

摘要

P300拼写机是基于脑电图(EEG)的脑机接口(BCI)的主要应用之一,它仍然是脑机接口社区的基准和持续挑战。脑电信号分类是脑机接口链的关键环节。到黎曼均值的最小距离(MDRM)属于在不同脑机接口应用中出现的分类方法,如思想拼写文本。在对每个协方差矩阵分别进行二值分类的基础上,根据整个重复集的最高分进行字符预测。最小累积距离黎曼平均(MCDRM)是MDRM的累积变体,完美地适应于P300拼写机。这种变体的强大之处在于,预测需要一个涉及n个重复的更全局的过程。实际上,由于累积距离,所选择的行和列是那些协方差矩阵既靠近目标重心又远离非目标重心的行和列。这种变体克服了主要的MDRM限制,因为它提高了会话间泛化,允许优化使用所有重复,并大大降低了在选择行和列导致字符预测期间出现冲突的风险。我们将这种变体应用于柏林BCI数据集II-b的原始信号,与已发表的结果相比,MCDRM提供了明显更高的结果:97.5%的正确预测与96.5%的竞争获胜者相比。MCDRM最适合P300拼写机,特别是在处理需要智能和优化使用n次重复的噪声信号时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Experimental Validation of the Cumulative MDRM in theP300 Speller Machine.

The P300 speller Machine is among the leading applications of the electroencephalography (EEG)-based brain computer interfaces (BCIs), it is still a benchmark and a persistent challenge for the BCI Community. EEG signal classification represents the key piece of a BCI chain. The minimum distance to Riemannian mean (MDRM) belongs to these classification methods emerging in different BCI applications such as text spelling by thought. Based on a binary classification of each covariance matrix separately, character prediction is done according to the highest score across the whole set of all repetitions. Minimum cumulative distance to Riemannian mean (MCDRM) is a Cumulative variant of the MDRM, perfectly adapted to the P300 Speller Machine. The power of this variant is that prediction takes a more global proceeding involving the n repetitions together. Indeed, thanks to cumulative distances selected row and column are those having the covariance matrices both closer to the Target barycenter and farther from the non-Target one. This variant overcomes the main MDRM limitations as it improves inter-sessional generalization, allows optimal use of all repetitions and reduces considerably the risk of conflict appearing during the selection of rows and columns leading to character prediction. We applied this variant to the raw signals of Data set II-b of Berlin BCI and compared to the published results the MCDRM offers significantly higher results: 97.5% of correct predictions compared to the 96.5% of the competition winner. The MCDRM fits best with the P300 Speller machine, especially when dealing with noisy signals that requires intelligent and optimal usage of the n repetitions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Clinical EEG and Neuroscience
Clinical EEG and Neuroscience 医学-临床神经学
CiteScore
5.20
自引率
5.00%
发文量
66
审稿时长
>12 weeks
期刊介绍: Clinical EEG and Neuroscience conveys clinically relevant research and development in electroencephalography and neuroscience. Original articles on any aspect of clinical neurophysiology or related work in allied fields are invited for publication.
×
引用
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学术官方微信