Exploring new territory: Calibration-free decoding for c-VEP BCI

• URL: http://arxiv.org/abs/2403.15521v2
• Date: Fri, 17 May 2024 14:48:53 GMT
• Title: Exploring new territory: Calibration-free decoding for c-VEP BCI
• Authors: J. Thielen, J. Sosulski, M. Tangermann,
• Abstract summary: This study explores two zero-training methods aimed at enhancing the usability of brain-computer interfaces (BCIs) We introduce a novel method rooted in the event-related potential (ERP) domain, unsupervised mean (UMM) We compare UMM to the state-of-the-art c-VEP zero-training method that uses canonical correlation analysis (CCA)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study explores two zero-training methods aimed at enhancing the usability of brain-computer interfaces (BCIs) by eliminating the need for a calibration session. We introduce a novel method rooted in the event-related potential (ERP) domain, unsupervised mean maximization (UMM), to the fast code-modulated visual evoked potential (c-VEP) stimulus protocol. We compare UMM to the state-of-the-art c-VEP zero-training method that uses canonical correlation analysis (CCA). The comparison includes instantaneous classification and classification with cumulative learning from previously classified trials for both CCA and UMM. Our study shows the effectiveness of both methods in navigating the complexities of a c-VEP dataset, highlighting their differences and distinct strengths. This research not only provides insights into the practical implementation of calibration-free BCI methods but also paves the way for further exploration and refinement. Ultimately, the fusion of CCA and UMM holds promise for enhancing the accessibility and usability of BCI systems across various application domains and a multitude of stimulus protocols.

Related papers

• Unlocking the Potential of Similarity Matching: Scalability, Supervision and Pre-training [9.160910754837754]
  Backpropagation (BP) algorithm exhibits limitations in terms of biological plausibility, computational cost, and suitability for online learning. This study focuses on the primarily unsupervised similarity matching (SM) framework, which aligns with observed mechanisms in biological systems.
  arXiv  Detail & Related papers  (2023-08-02T20:34:55Z)
• Provably Efficient UCB-type Algorithms For Learning Predictive State Representations [55.00359893021461]
  The sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs) This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models. In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.
  arXiv  Detail & Related papers  (2023-07-01T18:35:21Z)
• Distilling Vision-Language Pre-training to Collaborate with Weakly-Supervised Temporal Action Localization [77.19173283023012]
  Weakly-supervised temporal action localization learns to detect and classify action instances with only category labels. Most methods widely adopt the off-the-shelf Classification-Based Pre-training (CBP) to generate video features for action localization.
  arXiv  Detail & Related papers  (2022-12-19T10:02:50Z)
• GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP, and Beyond [101.5329678997916]
  We study sample efficient reinforcement learning (RL) under the general framework of interactive decision making. We propose a novel complexity measure, generalized eluder coefficient (GEC), which characterizes the fundamental tradeoff between exploration and exploitation. We show that RL problems with low GEC form a remarkably rich class, which subsumes low Bellman eluder dimension problems, bilinear class, low witness rank problems, PO-bilinear class, and generalized regular PSR.
  arXiv  Detail & Related papers  (2022-11-03T16:42:40Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning [92.18524491615548]
  Contrastive self-supervised learning has been successfully integrated into the practice of (deep) reinforcement learning (RL) We study how RL can be empowered by contrastive learning in a class of Markov decision processes (MDPs) and Markov games (MGs) with low-rank transitions. Under the online setting, we propose novel upper confidence bound (UCB)-type algorithms that incorporate such a contrastive loss with online RL algorithms for MDPs or MGs.
  arXiv  Detail & Related papers  (2022-07-29T17:29:08Z)
• An Adaptive Task-Related Component Analysis Method for SSVEP recognition [0.913755431537592]
  Steady-state visual evoked potential (SSVEP) recognition methods are equipped with learning from the subject's calibration data. This study develops a new method to learn from limited calibration data.
  arXiv  Detail & Related papers  (2022-04-17T15:12:40Z)
• Minimizing subject-dependent calibration for BCI with Riemannian transfer learning [0.8399688944263843]
  We present a scheme to train a classifier on data recorded from different subjects, to reduce the calibration while preserving good performances. To demonstrate the robustness of this approach, we conducted a meta-analysis on multiple datasets for three BCI paradigms.
  arXiv  Detail & Related papers  (2021-11-23T18:37:58Z)
• ACP++: Action Co-occurrence Priors for Human-Object Interaction Detection [102.9428507180728]
  A common problem in the task of human-object interaction (HOI) detection is that numerous HOI classes have only a small number of labeled examples. We observe that there exist natural correlations and anti-correlations among human-object interactions. We present techniques to learn these priors and leverage them for more effective training, especially on rare classes.
  arXiv  Detail & Related papers  (2021-09-09T06:02:50Z)
• MIN2Net: End-to-End Multi-Task Learning for Subject-Independent Motor Imagery EEG Classification [10.773708402778025]
  EEG rhythms are specific to a subject and various changes over time. We propose MIN2Net, a novel end-to-end multi-task learning to tackle this task. We integrate deep metric learning into a multi-task autoencoder to learn a compact and discriminative latent representation from EEG.
  arXiv  Detail & Related papers  (2021-02-07T15:20:23Z)
• A Novel RL-assisted Deep Learning Framework for Task-informative Signals Selection and Classification for Spontaneous BCIs [2.299749220980997]
  We formulate the problem of estimating and selecting task-relevant temporal signal segments from a single EEG trial. We propose a novel reinforcement-learning mechanism that can be combined with the existing deep-learning based BCI methods.
  arXiv  Detail & Related papers  (2020-07-01T00:35:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.