Near-lossless EEG signal compression using a convolutional autoencoder: Case study for 256-channel binocular rivalry dataset

IF 6.3 2区 医学 Q1 BIOLOGY Computers in biology and medicine Pub Date : 2025-05-01 Epub Date: 2025-03-05 DOI:10.1016/j.compbiomed.2025.109888
Martin Kukrál , Duc Thien Pham , Josef Kohout , Štefan Kohek , Marek Havlík , Dominika Grygarová
{"title":"Near-lossless EEG signal compression using a convolutional autoencoder: Case study for 256-channel binocular rivalry dataset","authors":"Martin Kukrál ,&nbsp;Duc Thien Pham ,&nbsp;Josef Kohout ,&nbsp;Štefan Kohek ,&nbsp;Marek Havlík ,&nbsp;Dominika Grygarová","doi":"10.1016/j.compbiomed.2025.109888","DOIUrl":null,"url":null,"abstract":"<div><div>Electroencephalography (EEG) experiments typically generate vast amounts of data due to the high sampling rates and the use of multiple electrodes to capture brain activity. Consequently, storing and transmitting these large datasets is challenging, necessitating the creation of specialized compression techniques tailored to this data type. This study proposes one such method, which at its core uses an artificial neural network (specifically a convolutional autoencoder) to learn the latent representations of modelled EEG signals to perform lossy compression, which gets further improved with lossless corrections based on the user-defined threshold for the maximum tolerable amplitude loss, resulting in a flexible near-lossless compression scheme. To test the viability of our approach, a case study was performed on the 256-channel binocular rivalry dataset, which also describes mostly data-specific statistical analyses and preprocessing steps. Compression results, evaluation metrics, and comparisons with baseline general compression methods suggest that the proposed method can achieve substantial compression results and speed, making it one of the potential research topics for follow-up studies.</div></div>","PeriodicalId":10578,"journal":{"name":"Computers in biology and medicine","volume":"189 ","pages":"Article 109888"},"PeriodicalIF":6.3000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers in biology and medicine","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010482525002392","RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/5 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

Electroencephalography (EEG) experiments typically generate vast amounts of data due to the high sampling rates and the use of multiple electrodes to capture brain activity. Consequently, storing and transmitting these large datasets is challenging, necessitating the creation of specialized compression techniques tailored to this data type. This study proposes one such method, which at its core uses an artificial neural network (specifically a convolutional autoencoder) to learn the latent representations of modelled EEG signals to perform lossy compression, which gets further improved with lossless corrections based on the user-defined threshold for the maximum tolerable amplitude loss, resulting in a flexible near-lossless compression scheme. To test the viability of our approach, a case study was performed on the 256-channel binocular rivalry dataset, which also describes mostly data-specific statistical analyses and preprocessing steps. Compression results, evaluation metrics, and comparisons with baseline general compression methods suggest that the proposed method can achieve substantial compression results and speed, making it one of the potential research topics for follow-up studies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用卷积自编码器的近无损脑电信号压缩:256通道双目竞争数据集的案例研究
由于高采样率和使用多个电极来捕捉大脑活动,脑电图(EEG)实验通常会产生大量数据。因此,存储和传输这些大型数据集是具有挑战性的,需要针对这种数据类型创建专门的压缩技术。本研究提出了一种这样的方法,其核心是使用人工神经网络(特别是卷积自编码器)来学习建模脑电信号的潜在表示进行有损压缩,并根据用户自定义的最大可容忍幅度损失阈值进行无损校正,从而进一步改进该方法,从而形成灵活的近无损压缩方案。为了测试我们方法的可行性,我们对256通道双目竞争数据集进行了案例研究,该数据集还描述了大多数数据特定的统计分析和预处理步骤。压缩结果、评价指标以及与基线一般压缩方法的比较表明,该方法可以获得可观的压缩效果和压缩速度,是后续研究的潜在研究课题之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers in biology and medicine
Computers in biology and medicine 工程技术-工程:生物医学
CiteScore
11.70
自引率
10.40%
发文量
1086
审稿时长
74 days
期刊介绍: Computers in Biology and Medicine is an international forum for sharing groundbreaking advancements in the use of computers in bioscience and medicine. This journal serves as a medium for communicating essential research, instruction, ideas, and information regarding the rapidly evolving field of computer applications in these domains. By encouraging the exchange of knowledge, we aim to facilitate progress and innovation in the utilization of computers in biology and medicine.
期刊最新文献
Forecasting-based biomedical time-series data synthesis for open data and robust AI Precise oxygen therapy to emphysema patients by fuzzy-based gain tuning control of set-point regulated MRAC MIPHEI-ViT: Multiplex immunofluorescence prediction from H&E images using ViT foundation models Deep learning with limited data: a transfer learning approach for transcriptomic survival prediction Noninvasive heart rate estimation using semantic segmentation and parameter optimization on 4K UAV videos
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1