Fast, accurate, and interpretable decoding of electrocorticographic signals using dynamic mode decomposition

• URL: http://arxiv.org/abs/2311.04225v1
• Date: Tue, 31 Oct 2023 07:13:43 GMT
• Title: Fast, accurate, and interpretable decoding of electrocorticographic signals using dynamic mode decomposition
• Authors: Ryohei Fukuma, Kei Majima, Yoshinobu Kawahara, Okito Yamashita, Yoshiyuki Shiraishi, Haruhiko Kishima and Takufumi Yanagisawa
• Abstract summary: We propose a mapping function to the Grassmann kernel that transforms DMs into spatialtemporal (sDM) features, which can be used in any machine learning algorithm. The proposed sDM features enable fast, accurate, and interpretable neural decoding.
• Score: 4.416399743917548
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dynamic mode (DM) decomposition decomposes spatiotemporal signals into basic oscillatory components (DMs). DMs can improve the accuracy of neural decoding when used with the nonlinear Grassmann kernel, compared to conventional power features. However, such kernel-based machine learning algorithms have three limitations: large computational time preventing real-time application, incompatibility with non-kernel algorithms, and low interpretability. Here, we propose a mapping function corresponding to the Grassmann kernel that explicitly transforms DMs into spatial DM (sDM) features, which can be used in any machine learning algorithm. Using electrocorticographic signals recorded during various movement and visual perception tasks, the sDM features were shown to improve the decoding accuracy and computational time compared to conventional methods. Furthermore, the components of the sDM features informative for decoding showed similar characteristics to the high-$\gamma$ power of the signals, but with higher trial-to-trial reproducibility. The proposed sDM features enable fast, accurate, and interpretable neural decoding.

Related papers

• Parsimonious Dynamic Mode Decomposition: A Robust and Automated Approach for Optimally Sparse Mode Selection in Complex Systems [0.40964539027092917]
  This paper introduces the Parsimonious Dynamic Mode Decomposition (parsDMD) ParsDMD is a novel algorithm designed to automatically select an optimally sparse subset of dynamic modes for both temporal and purely temporal data. It is validated on a diverse range of datasets, including standing wave signals, identifying hidden dynamics, fluid dynamics simulations, and atmospheric sea-surface temperature (SST) data.
  arXiv  Detail & Related papers  (2024-10-22T03:00:11Z)
• DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs [59.434893231950205]
  Dynamic graph learning aims to uncover evolutionary laws in real-world systems. We propose DyG-Mamba, a new continuous state space model for dynamic graph learning. We show that DyG-Mamba achieves state-of-the-art performance on most datasets.
  arXiv  Detail & Related papers  (2024-08-13T15:21:46Z)
• Specific Emitter Identification Based on Joint Variational Mode Decomposition [7.959137957880584]
  Specific emitter identification (SEI) technology is significant in device administration scenarios, such as self-organized networking and spectrum management. For nonlinear and non-stationary electromagnetic signals, SEI often employs variational modal decomposition (VMD) to decompose the signal in order to effectively characterize the distinct device fingerprint. In this paper, we propose a joint variational modal decomposition (JVMD) algorithm, which is an improved version of VMD by simultaneously implementing modal decomposition on multi-frame signals.
  arXiv  Detail & Related papers  (2024-01-03T02:19:32Z)
• Quantized Non-Volatile Nanomagnetic Synapse based Autoencoder for Efficient Unsupervised Network Anomaly Detection [0.07892577704654172]
  We show that implementing the autoencoder in edge devices capable of learning in real-time is challenging due to limited hardware, energy, and computational resources. We propose a ferromagnetic racetrack with engineered notches hosting a magnetic domain wall (DW) as the autoencoder synapses. Our DW-based approach demonstrates a remarkable reduction of at least three orders of magnitude in weight updates during training compared to the floating-point approach.
  arXiv  Detail & Related papers  (2023-09-12T02:29:09Z)
• Label-free timing analysis of SiPM-based modularized detectors with physics-constrained deep learning [9.234802409391111]
  We propose a novel method based on deep learning for timing analysis of modularized detectors. We mathematically demonstrate the existence of the optimal function desired by the method, and give a systematic algorithm for training and calibration of the model.
  arXiv  Detail & Related papers  (2023-04-24T09:16:31Z)
• On Neural Architectures for Deep Learning-based Source Separation of Co-Channel OFDM Signals [104.11663769306566]
  We study the single-channel source separation problem involving frequency-division multiplexing (OFDM) signals. We propose critical domain-informed modifications to the network parameterization, based on insights from OFDM structures.
  arXiv  Detail & Related papers  (2023-03-11T16:29:13Z)
• Multi-Scale Control Signal-Aware Transformer for Motion Synthesis without Phase [72.01862340497314]
  We propose a task-agnostic deep learning method, namely Multi-scale Control Signal-aware Transformer (MCS-T) MCS-T is able to successfully generate motions comparable to those generated by the methods using auxiliary information.
  arXiv  Detail & Related papers  (2023-03-03T02:56:44Z)
• A Comparison of Temporal Encoders for Neuromorphic Keyword Spotting with Few Neurons [0.11726720776908518]
  Two candidate neurocomputational elements for temporal encoding and feature extraction in SNNs are investigated. Resource-efficient keyword spotting applications may benefit from the use of these encoders, but further work on methods for learning the time constants and weights is required.
  arXiv  Detail & Related papers  (2023-01-24T12:50:54Z)
• NAF: Neural Attenuation Fields for Sparse-View CBCT Reconstruction [79.13750275141139]
  This paper proposes a novel and fast self-supervised solution for sparse-view CBCT reconstruction. The desired attenuation coefficients are represented as a continuous function of 3D spatial coordinates, parameterized by a fully-connected deep neural network. A learning-based encoder entailing hash coding is adopted to help the network capture high-frequency details.
  arXiv  Detail & Related papers  (2022-09-29T04:06:00Z)
• ZippyPoint: Fast Interest Point Detection, Description, and Matching through Mixed Precision Discretization [71.91942002659795]
  We investigate and adapt network quantization techniques to accelerate inference and enable its use on compute limited platforms. ZippyPoint, our efficient quantized network with binary descriptors, improves the network runtime speed, the descriptor matching speed, and the 3D model size. These improvements come at a minor performance degradation as evaluated on the tasks of homography estimation, visual localization, and map-free visual relocalization.
  arXiv  Detail & Related papers  (2022-03-07T18:59:03Z)
• Dynamic Mode Decomposition in Adaptive Mesh Refinement and Coarsening Simulations [58.720142291102135]
  Dynamic Mode Decomposition (DMD) is a powerful data-driven method used to extract coherent schemes. This paper proposes a strategy to enable DMD to extract from observations with different mesh topologies and dimensions.
  arXiv  Detail & Related papers  (2021-04-28T22:14:25Z)

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.