arXivDaily arXiv每日学术速递 周一至周五更新

科学与医疗

脑机接口 / BCI

脑机接口、EEG、神经信号解码、神经假体和脑控交互。

2026-06-19 至 2026-06-19 收录 6 信号源:q-bio.NC, eess.SP, cs.LG, cs.HC, cs.RO

1. EEG解码 3 篇

2606.16615 2026-06-19 cs.CV 新提交 95%

SUP-MCRL: Subject-aware Unified Pseudo-feature Coded Multimodal Contrastive Representation Learning for EEG Visual Decoding

SUP-MCRL:面向EEG视觉解码的感知主体统一伪特征编码多模态对比表示学习

Shengyu Gong, Weiming Zeng, Yueyang Li, Zijian Kang, Hongjie Yan, Wai Ting Siok, Nizhuan Wang

发表机构 * Lab of Digital Image and Intelligent Computation, Shanghai Maritime University(上海海事大学数字图像与智能计算实验室) Department of Language Science and Technology, The Hong Kong Polytechnic University(香港理工大学语言科学与技术系) Affiliated Lianyungang Hospital of Xuzhou Medical University(徐州医科大学附属连云港医院)

专题命中 EEG解码 :提出EEG视觉解码框架SUP-MCRL

AI总结 提出SUP-MCRL框架,通过语义感知视觉编码器、统一EEG增强器和原型渐进增强器,解决多模态对比学习中语义一致性和主体选择性问题,在THINGS-EEG零样本任务上达到66.0%/91.9%的Top-1/Top-5准确率。

详情
AI中文摘要

非侵入式脑机接口在泛化到自然视觉体验时,神经视觉解码面临严重的保真度退化。传统的多模态对比表示学习仅优化几何距离对齐,忽略了语义一致性和主体选择性,导致虚假的零样本对齐。我们提出SUP-MCRL,一个统一框架,集成了三种协作机制:(1) 语义实体感知视觉编码器(SAVE),学习空间注意力以提取语义内容,无需预训练的显著性模型;(2) 统一EEG增强器(UEE),采用多尺度空洞卷积和频带间注意力实现自适应跨主体鲁棒性;(3) 基于原型的渐进增强器(PPA),维护一个EMA更新的伪特征池以防止表示崩溃。在THINGS-EEG上的零样本实验实现了66.0%/91.9%(Top-1/Top-5)的个体内准确率和24.0%/52.9%的LOSO准确率,超越了现有最先进方法。代码可在https://github.com/NZWANG/SUP-MCRL获取。

英文摘要

Non-invasive brain-computer interfaces exhibit significant performance degradation when moving from controlled laboratory stimuli to real-world natural images. This degradation occurs because conventional multimodal contrastive representation learning models focus exclusively on optimizing geometric distance alignment, thereby failing to account for semantic consistency and inter-subject variability in neural representation and selective attention. As a result, these models are prone to producing spurious zero-shot matches. To address these limitations, we propose SUP-MCRL, a unified framework integrating three collaborative mechanisms: (1) a Semantic-entity Aware Visual Encoder (SAVE) that learns spatial attention to extract semantic content without relying on pre-trained saliency models; (2) a Unified EEG Enhancer (UEE) that employs multi-scale atrous convolutions and inter-band attention for adaptive cross-subject robustness; and (3) a Prototype-based Progressive Augmenter (PPA) that maintains an EMA-updated pseudo-feature pool to prevent representation collapse. Zero-shot experiments on the THINGS-EEG achieve 66.0%/91.9% (Top-1/Top-5) intra-subject and 24.0%/52.9% LOSO accuracy, significantly surpassing state-of-the-art methods and demonstrating that structured alignment supervision is key to overcoming the limitations of cross-modal decoding. Code is available at https://github.com/NZWANG/SUP-MCRL.

2606.20074 2026-06-19 eess.SP cs.AI cs.LG 新提交 90%

Evaluation of EEG Foundation Models for Event-Based Burst-Suppression Detection in ICU

用于ICU中基于事件的爆发-抑制检测的EEG基础模型评估

Elisa Vasta, Thorir Mar Ingolfsson, Andrea Cossettini, Luca Benini, Tilman Beck, Emanuela Keller, Una Pale

发表机构 * DEI, University of Bologna, Bologna, Italy(DEI,博洛尼亚大学,博洛尼亚,意大利)

专题命中 EEG解码 :评估EEG基础模型检测爆发-抑制模式,属于脑电解码

AI总结 本研究首次评估EEG基础模型在ICU中无需患者校准的爆发检测性能,REVE-base模型在事件级F1分数上达到0.868,并将每分钟爆发错误率分别降低52.1%和36.2%。

Comments 4 pages, 1 figure. Code available upon publication

详情
AI中文摘要

爆发抑制(BS)是一种临床相关的脑电图(EEG)模式,用于监测危重患者的镇静深度和脑活动,特别是在重症监护病房(ICU)的诱导昏迷期间。自动爆发检测仍然具有挑战性,因为BS模式在不同患者之间差异很大,且标注数据集稀缺。最近,EEG基础模型(FMs)在多个下游EEG应用中显示出前景,但它们在BS检测中的实用性尚未被探索。我们提出了第一项研究,评估EEG FMs在减少导联的ICU EEG中无需患者校准的爆发检测性能。我们将REVE-base、LUNA-large和LuMamba-Tiny与自适应阈值基线以及任务特定的EEGNet基线进行比较。此外,我们补充了基于事件的爆发检测评估,以替代传统的EEG窗口分类。这有助于临床评估爆发事件是否被正确检测,减少预期标注变异性的影响。最佳模型REVE-base取得了最高的事件级F1分数($0.868 \pm 0.167$),并且与EEGNet和自适应阈值相比,分别将每分钟爆发错误减少了52.1%和36.2%,支持了FMs在ICU中可扩展的EEG监测。消融实验表明,与冻结骨干训练、两步微调和基于LoRA的适应相比,全微调是最有效的适应策略,对于LUNA-large,事件级F1分数比冻结骨干训练提高了最多$+0.102$。在减少标注数据集的情况下,预训练的REVE-base在25%的队列中比随机初始化高出$+0.723$事件级F1点,证明了在有限标注数据下适应爆发检测时预训练FM表示的优势。

英文摘要

Burst suppression (BS) is a clinically relevant electroencephalographic (EEG) pattern used to monitor sedation depth and brain activity in critically ill patients, particularly during induced coma in Intensive Care Units (ICUs). Automatic burst detection remains challenging because BS patterns vary substantially between patients and annotated datasets are scarce. Recently, EEG Foundation Models (FMs) have shown promise across several downstream EEG applications, but their usefulness for BS detection remains unexplored. We present the first study to evaluate EEG FMs for burst detection in reduced-montage ICU EEG without patient-specific calibration. We compare REVE-base, LUNA-large and LuMamba-Tiny with an adaptive thresholding baseline and a task-specific EEGNet baseline. Additionally, we complement conventional EEG window-based classification with event-based burst detection evaluation. This helps assessing clinically whether burst episodes are correctly detected, reducing the impact of expected annotation variability. The best model, REVE-base, achieved the highest event-based F1-score ($0.868 \pm 0.167$) and reduced burst-per-minute error by 52.1% and 36.2% compared to EEGNet and adaptive thresholding respectively, supporting FMs for scalable EEG monitoring in ICU. Ablation experiments showed that full fine-tuning was the most effective adaptation strategy with respect to frozen-backbone training, two-step fine-tuning, and LoRA-based adaptation, improving event-based F1-score over frozen-backbone training by up to $+0.102$ for LUNA-large. With reduced labeled datasets, pretrained REVE-base outperformed random initialization by $+0.723$ event-based F1 points at 25% of the cohort, demonstrating the benefit of pretraining FM representations when adapted to burst detection with limited labeled data.

2503.02636 2026-06-19 q-bio.NC cs.AI 版本更新 90%

A Deep Generative Model for Resting-State EEG Synthesis and Transferable Representation Learning

一种用于静息态脑电合成与可迁移表示学习的深度生成模型

Yeganeh Farahzadi, Morteza Ansarinia, Zoltan Kekecs

发表机构 * Institute of Psychology, Eötvös Loránd University(埃斯特哈兹·洛朗大学心理学研究所) Doctoral School of Psychology, Eötvös Loránd University(埃斯特哈兹·洛朗大学心理学博士学院) Department of Behavioural and Cognitive Sciences, University of Luxembourg(卢森堡大学行为与认知科学系)

专题命中 EEG解码 :提出REST-GAN生成静息态EEG并学习可迁移表示。

AI总结 提出REST-GAN框架,结合对抗训练与自监督重构,从原始时域信号合成静息态EEG并学习可迁移表示,在频谱、连接性及分类任务中表现优异。

详情
AI中文摘要

静息态脑电提供了一种非侵入性的自发脑活动观测方式,但提取有意义的模式常受限于高质量数据稀缺和对人工设计特征的依赖。生成对抗网络(GAN)能够合成神经信号并从原始数据中学习可迁移表示,这一双重能力在脑电研究中尚未被充分探索。本文提出REST-GAN,一个基于GAN的静息态脑电框架,将对抗训练与辅助自监督重构目标相结合,以支持信号合成和无监督特征提取。尽管仅使用原始时域信号训练,未引入显式的频域或传感器拓扑监督,生成的时序列再现了真实脑电的关键时间、频谱和连接特性。在频带功率特征空间中,生成的样本在睁眼和闭眼条件下均表现出高精确率和召回率(EO: 0.91/0.67; EC: 0.87/0.65),而组平均频谱相干矩阵与真实数据在各频段上的平均绝对差异较低(约0.01-0.03)。模型判别器学习到的表示可迁移至独立的静息态人口统计学分类任务,其性能优于直接在原始脑电上训练的模型,并与近期脑电基础模型表现相当,同时所需训练数据和计算资源大幅减少。这些发现突显了一种计算高效的架构驱动策略,其中生成模型不仅作为脑电信号生成器,还作为无监督特征提取器。该方法有望支持更数据高效的脑电分析,同时减少对人工特征工程的依赖。REST-GAN的实现代码见:this https URL。

英文摘要

Resting-state EEG provides a non-invasive view of spontaneous brain activity, but extracting meaningful patterns is often limited by scarce high-quality data and reliance on manually engineered features. Generative adversarial networks (GANs) can synthesize neural signals and learn transferable representations directly from raw data, a dual capability that remains underexplored in EEG research. Here, we introduce REST-GAN, a GAN-based framework for resting-state EEG that combines adversarial training with an auxiliary self-supervised reconstruction objective to support signal synthesis and unsupervised feature extraction. Although trained only on raw time-domain signals, without explicit frequency-domain or sensor-topographic supervision, the generated time series reproduced key temporal, spectral, and connectivity properties of real EEG. In band-power feature space, generated samples showed high precision and recall across eyes-open and eyes-closed conditions (EO: 0.91/0.67; EC: 0.87/0.65), while group-average spectral coherence matrices showed low mean absolute differences from real data across frequency bands (~0.01-0.03). The representations learned by the model's critic transferred to independent resting-state demographic classification tasks, outperforming models trained directly on raw EEG and showing competitive performance relative to a recent EEG foundation model, while requiring substantially less training data and computational resources. These findings highlight a computationally efficient, architecture-driven strategy in which generative models serve not only as EEG signal generators, but also as unsupervised feature extractors. This approach may support more data-efficient EEG analysis while reducing reliance on manual feature engineering. The implementation code for REST-GAN is available at: https://github.com/Yeganehfrh/REST-GAN.

2. 神经信号处理 2 篇

2606.19953 2026-06-19 eess.SP 新提交 60%

ConsisFormer: Compute-Efficient Transformer for Wireless Foundation Models Based on Channel Consistency

ConsisFormer: 基于信道一致性的无线基础模型高效计算Transformer

Yuwei Wang, Li Sun, Tingting Yang, Liwen Jing, Yuxuan Shi, Maged Elkashlan, Mérouane Debbah

专题命中 神经信号处理 :无线信道一致性方法可类比神经信号处理中的一致性

AI总结 提出ConsisFormer,利用无线信道短时一致性,通过自适应令牌聚合和特征序列插值降低Transformer计算复杂度,在多种任务上减少83%以上计算量且性能损失极小。

详情
AI中文摘要

无线基础模型(WFM)最近成为AI原生6G网络的一种有前景的范式,能够实现适应各种通信和感知任务的通用信道表示。现有的WFM主要基于Transformer架构,该架构提供了优越的性能,但计算复杂度与输入序列长度的平方成正比,这对其在严格推理延迟约束下的部署构成了重大障碍。为了解决这个问题,本文提出ConsisFormer,一种基于无线信道短时一致性的高效计算Transformer设计,作为WFM的骨干网络。利用相邻时间或频率实例共享相似的散射体簇并因此表现出相似信道特性的观察,我们开发了自适应令牌聚合(ATA)模块,动态合并相邻信道状态信息(CSI)令牌,从而减少自注意力计算中涉及的令牌序列长度以降低计算成本。此外,我们提出了一种特征序列插值(FSI)方法,基于Transformer块输出的稀疏特征序列恢复完整的CSI表示,从而在保持性能不受影响的同时确保低复杂度。此外,我们提出了一种用于WFM的聚合自编码器(AAE)预训练范式,通过压缩和恢复从稀疏化CSI令牌中学习鲁棒的信道表示。仿真结果表明,所提出的设计将WFM的计算复杂度降低了83%以上,同时在包括信道预测、视距/非视距分类、波束预测和定位在内的各种任务上性能损失极小。

英文摘要

Wireless foundation models (WFMs) have recently emerged as a promising paradigm for AI-native 6G networks, enabling universal channel representations adaptable to diverse communication and sensing tasks. Existing WFMs are predominantly built upon the Transformer architecture, which delivers superior performance but incurs computational complexity proportional to the square of the input sequence length, posing a significant barrier to their deployment under stringent inference latency constraints. To address this issue, in this paper, we propose ConsisFormer, a compute-efficient Transformer design based on short-term consistency of wireless channels, as a WFM backbone. By utilizing the observation that adjacent time or frequency instances share similar clusters of scatterers and thus exhibit similar channel characteristics, we develop an adaptive token aggregation (ATA) module to dynamically merge neighboring channel state information (CSI) tokens, thereby reducing the length of the token sequence involved in self-attention calculations to lower the computational cost. Furthermore, we propose a feature sequence interpolation (FSI) method to recover the full CSI representation based on the sparse feature sequence outputted from the Transformer blocks, thus keeping the performance unaffected while ensuring low complexity. Moreover, we propose an aggregated auto-encoder (AAE) pre-training paradigm for WFMs, enabling robust channel representation learning from sparsified CSI tokens via compression and recovery. Simulation results show that the proposed design reduces the computational complexity of WFM by over $83\%$ with negligible performance loss on various tasks including channel prediction, LoS/NLOS classification, beam prediction, and localization.

2602.20953 2026-06-19 eess.SP 60%

Timing Recovery and Sequence Detection for Integrate-and-Fire Time Encoding Receivers

时间恢复与序列检测用于积分-发射时间编码接收器

Neil Irwin Bernardo

专题命中 神经信号处理 :积分-发射时间编码接收器

AI总结 本文提出了一种联合时间恢复与数据检测框架,用于积分-发射时间编码接收器,通过推导对数似然函数,实现了符号定时偏移和传输序列的联合估计,改进了符号误码率性能。

Comments 6 pages, 3 figures, accepted in 2026 IEEE Wireless Communications and Networking Conference (WCNC 2026)

详情
AI中文摘要

近期神经形态信号处理的进步引入了时间编码机器作为低功耗通信接收器的有希望的替代方案。在这一范式中,模拟信号通过积分-发射电路转换为事件时间,允许信息通过脉冲时间而不是幅度样本来表示。尽管事件驱动采样消除了对固定速率时钟的需求,但配备积分-发射时间编码机器的接收机,称为时间编码接收机,通常假设完美的符号同步,留下符号定时恢复的问题。本文提出了一种联合定时恢复和数据检测框架,用于积分-发射时间编码接收机。通过推导对数似然函数,捕捉放电时间、符号定时偏移和传输序列之间的依赖关系,从而得到联合定时估计和序列检测的最大似然公式。开发了一个实用的两阶段接收机,包括定时恢复算法后接零力检测器。仿真结果表明,相比现有时间编码接收机,实现了准确的符号定时偏移估计和改进的符号误码率性能。

英文摘要

Recent advances in neuromorphic signal processing have introduced time encoding machines as a promising alternative to conventional uniform sampling for low-power communication receivers. In this paradigm, analog signals are converted into event timings by an integrate-and-fire circuit, allowing information to be represented through spike times rather than amplitude samples. While event-driven sampling eliminates the need for a fixed-rate clock, receivers equipped with integrate-and-fire time encoding machines, called time encoding receivers, often assume perfect symbol synchronization, leaving the problem of symbol timing recovery unresolved. This paper presents a joint timing recovery and data detection framework for integrate-and-fire time encoding receivers. The log-likelihood function is derived to capture the dependence between firing times, symbol timing offset, and transmitted sequence, leading to a maximum likelihood formulation for joint timing estimation and sequence detection. A practical two-stage receiver is developed, consisting of a timing recovery algorithm followed by a zero-forcing detector. Simulation results demonstrate accurate symbol timing offset estimation and improved symbol error rate performance compared to existing time encoding receivers.

3. 其他BCI 1 篇

2605.09550 2026-06-19 cs.HC 版本更新 60%

Who embraces AI in play? Exploratory modeling of player preference profiles toward game AI

谁在游戏AI中持支持态度?游戏AI玩家偏好轮廓的探索性建模

Ting-Chen Hsu, Jiangxu Lin, Wenran Chen, Zheyuan Zhang, Fei Qin

专题命中 其他BCI :研究玩家对游戏AI的接受度,与脑机接口无关

AI总结 本文通过问卷数据和AA分析,揭示玩家对游戏AI接受度的跨情境偏好轮廓,识别出七种典型群体,并探讨其与AI素养、游戏习惯等因素的关系。

Comments Accepted to 2026 IEEE Conference on Games (IEEE CoG 2026)

详情
AI中文摘要

人工智能正通过多种功能进入数字游戏。尽管先前研究显示玩家对游戏AI的态度高度依赖于情境,但对这些态度在不同玩家群体中如何结构化组合仍知之甚少。本研究通过建模玩家的跨情境AI接受度作为可解释的态度轮廓来填补这一空白。基于771名数字游戏玩家的问卷数据,我们应用架构分析(AA)对八个代表性AI应用情境中的中心化接受评分进行分析。分析识别出七种不同的轮廓:AI怀疑者、广泛AI支持者、创造性玩法探索者、经验导向支持者、系统秩序倡导者、情感中心支持者和治理怀疑者。探索性的一对多(OvR)逻辑回归进一步表明,轮廓成员与玩家的感知AI素养、游戏习惯、学科背景、个性特征和应用特定优先级相关。通过将关注点从孤立的接受判断转向模式化的偏好结构,本研究为分割游戏AI受众提供了探索性经验词汇,并为更情境敏感和玩家敏感的AI整合提供了初步设计启示。

英文摘要

Artificial intelligence is increasingly entering digital games through diverse functions. While prior work has shown that player attitudes toward game AI are strongly context-dependent, less is known about how these attitudes are structurally combined within different groups of players. This study addresses this gap by modeling players' cross-context AI acceptance as interpretable attitude profiles. Based on questionnaire data from 771 digital game players, we apply Archetypal Analysis (AA) to centered acceptance ratings across eight representative AI application contexts in games. The analysis identifies seven distinctive profiles: AI-Skeptics, Broad AI-Supporters, Creative-Play Explorers, Experience-Oriented Supporters, Systemic Order Advocates, Emotion-Centered Supporters, and Governance-Skeptics. Exploratory one-vs-rest (OvR) logistic regressions further suggest that profile membership is associated with players' perceived AI literacy, gaming habits, disciplinary background, personality traits, and application-specific priorities. By shifting attention from isolated acceptance judgments to patterned preference structures, this study provides an exploratory empirical vocabulary for segmenting game AI audiences and offers preliminary design implications for more context-sensitive and player-sensitive AI integration in digital games.