Factorization Approach for Sparse Spatio-Temporal Brain-Computer Interface

• URL: http://arxiv.org/abs/2206.08494v1
• Date: Fri, 17 Jun 2022 00:30:43 GMT
• Title: Factorization Approach for Sparse Spatio-Temporal Brain-Computer Interface
• Authors: Byeong-Hoo Lee, Jeong-Hyun Cho, Byoung-Hee Kwon and Seong-Whan Lee
• Abstract summary: We show that factorizing EEG signals allows the model to extract rich and decisive features under sparse condition. Evaluations were conducted on a single-arm motor imagery dataset.
• Score: 17.85507707727557
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, advanced technologies have unlimited potential in solving various problems with a large amount of data. However, these technologies have yet to show competitive performance in brain-computer interfaces (BCIs) which deal with brain signals. Basically, brain signals are difficult to collect in large quantities, in particular, the amount of information would be sparse in spontaneous BCIs. In addition, we conjecture that high spatial and temporal similarities between tasks increase the prediction difficulty. We define this problem as sparse condition. To solve this, a factorization approach is introduced to allow the model to obtain distinct representations from latent space. To this end, we propose two feature extractors: A class-common module is trained through adversarial learning acting as a generator; Class-specific module utilizes loss function generated from classification so that features are extracted with traditional methods. To minimize the latent space shared by the class-common and class-specific features, the model is trained under orthogonal constraint. As a result, EEG signals are factorized into two separate latent spaces. Evaluations were conducted on a single-arm motor imagery dataset. From the results, we demonstrated that factorizing the EEG signal allows the model to extract rich and decisive features under sparse condition.

Related papers

• Learning a Fast Mixing Exogenous Block MDP using a Single Trajectory [87.62730694973696]
  STEEL is the first provably sample-efficient algorithm for learning the controllable dynamics of an Exogenous Block Markov Decision Process from a single trajectory. We prove that STEEL is correct and sample-efficient, and demonstrate STEEL on two toy problems.
  arXiv  Detail & Related papers  (2024-10-03T21:57:21Z)
• UMBRAE: Unified Multimodal Brain Decoding [43.6339793925953]
  We propose UMBRAE, a unified multimodal decoding of brain signals. We introduce an efficient universal brain encoder for multimodal-brain alignment. We also introduce a cross-subject training strategy mapping subject-specific features to a common feature space.
  arXiv  Detail & Related papers  (2024-04-10T17:59:20Z)
• Subject-Independent Deep Architecture for EEG-based Motor Imagery Classification [0.5439020425819]
  Motor EEG (MI) classification based on electroencephalogram (EEG) is a widely-used technique in non-invasive brain-computer interface (BCI) systems. We propose a novel subject-independent semi-supervised deep architecture (SSDA) The proposed SSDA consists of two parts: an unsupervised and a supervised element.
  arXiv  Detail & Related papers  (2024-01-27T23:05:51Z)
• Brain-Driven Representation Learning Based on Diffusion Model [25.375490061512]
  Denoising diffusion probabilistic models (DDPMs) are explored in our research as a means to address this issue. Using DDPMs in conjunction with a conditional autoencoder, our new approach considerably outperforms traditional machine learning algorithms. Our results highlight the potential of DDPMs as a sophisticated computational method for the analysis of speech-related EEG signals.
  arXiv  Detail & Related papers  (2023-11-14T05:59:58Z)
• An Adaptive Contrastive Learning Model for Spike Sorting [12.043679000694258]
  In neuroscience research, it is important to separate out the activity of individual neurons. With the development of large-scale silicon technology, artificially interpreting and labeling spikes is becoming increasingly impractical. We propose a novel modeling framework that learns representations from spikes through contrastive learning.
  arXiv  Detail & Related papers  (2022-05-24T09:18:46Z)
• A Factorization Approach for Motor Imagery Classification [1.2891210250935146]
  We proposed a method to factorize EEG signals into two groups to classify motor imagery. Based on adversarial learning, we focused on extracting common features of EEG signals which are robust to noise. We confirmed the feasibility of extracting features into two groups is advantageous for datasets that contain sparse spatial features.
  arXiv  Detail & Related papers  (2021-12-13T06:05:39Z)
• Learning Debiased and Disentangled Representations for Semantic Segmentation [52.35766945827972]
  We propose a model-agnostic and training scheme for semantic segmentation. By randomly eliminating certain class information in each training iteration, we effectively reduce feature dependencies among classes. Models trained with our approach demonstrate strong results on multiple semantic segmentation benchmarks.
  arXiv  Detail & Related papers  (2021-10-31T16:15:09Z)
• Understanding Interlocking Dynamics of Cooperative Rationalization [90.6863969334526]
  Selective rationalization explains the prediction of complex neural networks by finding a small subset of the input that is sufficient to predict the neural model output. We reveal a major problem with such cooperative rationalization paradigm -- model interlocking. We propose a new rationalization framework, called A2R, which introduces a third component into the architecture, a predictor driven by soft attention as opposed to selection.
  arXiv  Detail & Related papers  (2021-10-26T17:39:18Z)
• Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness [68.97830259849086]
  Most datasets only capture a simpler subproblem and likely suffer from spurious features. We study adversarial robustness - a local generalization property - to reveal hard, model-specific instances and spurious features. Unlike in other applications, where perturbation models are designed around subjective notions of imperceptibility, our perturbation models are efficient and sound. Surprisingly, with such perturbations, a sufficiently expressive neural solver does not suffer from the limitations of the accuracy-robustness trade-off common in supervised learning.
  arXiv  Detail & Related papers  (2021-10-21T07:28:11Z)
• The Causal Neural Connection: Expressiveness, Learnability, and Inference [125.57815987218756]
  An object called structural causal model (SCM) represents a collection of mechanisms and sources of random variation of the system under investigation. In this paper, we show that the causal hierarchy theorem (Thm. 1, Bareinboim et al., 2020) still holds for neural models. We introduce a special type of SCM called a neural causal model (NCM), and formalize a new type of inductive bias to encode structural constraints necessary for performing causal inferences.
  arXiv  Detail & Related papers  (2021-07-02T01:55:18Z)
• Frequency-aware Discriminative Feature Learning Supervised by Single-Center Loss for Face Forgery Detection [89.43987367139724]
  Face forgery detection is raising ever-increasing interest in computer vision. Recent works have reached sound achievements, but there are still unignorable problems. A novel frequency-aware discriminative feature learning framework is proposed in this paper.
  arXiv  Detail & Related papers  (2021-03-16T14:17:17Z)

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.