K. Georgiadis, D. Adamos, S. Nikolopoulos, N. Laskaris, Y. Kompatsiaris
{"title":"A graph-theoretic sensor-selection scheme for covariance-based Motor Imagery (MI) decoding","authors":"K. Georgiadis, D. Adamos, S. Nikolopoulos, N. Laskaris, Y. Kompatsiaris","doi":"10.23919/Eusipco47968.2020.9287865","DOIUrl":null,"url":null,"abstract":"Optimal sensor selection is an issue of paramount importance in brain decoding. When associated with estimates of covariance, its implications concern not only classification accuracy, but also computational efficiency. However, very few attempts have been made so far, since it constitutes a challenging mathematical problem. Herein, we propose an efficient heuristic scheme that combines discriminative learning (from a small training dataset of labelled trials) with unsupervised learning (the automated detection of sensors that collectively maximize the trial discriminability of the induced Covariance structure). The approach is motivated from a complex network modelling perspective. Its efficacy and efficiency are demonstrated experimentally, based on BCI-competition datasets concerning MI-tasks, and compared against popular techniques in the field.","PeriodicalId":6705,"journal":{"name":"2020 28th European Signal Processing Conference (EUSIPCO)","volume":"61 1","pages":"1234-1238"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 28th European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/Eusipco47968.2020.9287865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Optimal sensor selection is an issue of paramount importance in brain decoding. When associated with estimates of covariance, its implications concern not only classification accuracy, but also computational efficiency. However, very few attempts have been made so far, since it constitutes a challenging mathematical problem. Herein, we propose an efficient heuristic scheme that combines discriminative learning (from a small training dataset of labelled trials) with unsupervised learning (the automated detection of sensors that collectively maximize the trial discriminability of the induced Covariance structure). The approach is motivated from a complex network modelling perspective. Its efficacy and efficiency are demonstrated experimentally, based on BCI-competition datasets concerning MI-tasks, and compared against popular techniques in the field.