A Discrete Fourier Transform method for alignment of visual evoked potentials

Ismet Sahin, N. Yilmazer
{"title":"A Discrete Fourier Transform method for alignment of visual evoked potentials","authors":"Ismet Sahin, N. Yilmazer","doi":"10.1109/CIBCB.2010.5510704","DOIUrl":null,"url":null,"abstract":"In this paper, we consider alignment of visual evoked potentials (EP) in the Discrete Fourier Transform (DFT) domain. Visual EPs have important clues for diagnosing medical problems such as multiple sclerosis and optic neuritis. The amplitude of visual EPs are usually smaller than the amplitude of spontaneous EPs which causes difficulties in reliably finding the latencies and amplitudes of important positive and negative peaks in the evoked responses. Therefore, noise cancellation becomes important for determining the features of interest in these waveforms. A well-known noise cancellation method is averaging multiple evoked potentials. Averaging after alignment of EP waveforms can improve the waveform quality substantially since usually evoked potentials have different characteristics and therefore have different latencies and amplitudes in response to the same visual stimulus. In this paper, we use a time alignment method which simultaneously reduces the spectral differences between all waveforms by minimizing the linearly phase shifted forms of the DFTs of these waveforms. We demonstrate that this method successfully aligns multiple visual EPs and achieves a smooth averaged waveform with reduced noise.","PeriodicalId":340637,"journal":{"name":"2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBCB.2010.5510704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we consider alignment of visual evoked potentials (EP) in the Discrete Fourier Transform (DFT) domain. Visual EPs have important clues for diagnosing medical problems such as multiple sclerosis and optic neuritis. The amplitude of visual EPs are usually smaller than the amplitude of spontaneous EPs which causes difficulties in reliably finding the latencies and amplitudes of important positive and negative peaks in the evoked responses. Therefore, noise cancellation becomes important for determining the features of interest in these waveforms. A well-known noise cancellation method is averaging multiple evoked potentials. Averaging after alignment of EP waveforms can improve the waveform quality substantially since usually evoked potentials have different characteristics and therefore have different latencies and amplitudes in response to the same visual stimulus. In this paper, we use a time alignment method which simultaneously reduces the spectral differences between all waveforms by minimizing the linearly phase shifted forms of the DFTs of these waveforms. We demonstrate that this method successfully aligns multiple visual EPs and achieves a smooth averaged waveform with reduced noise.
视觉诱发电位排列的离散傅立叶变换方法
在本文中,我们考虑了视觉诱发电位(EP)在离散傅立叶变换(DFT)域中的排列。视觉EPs对于诊断多发性硬化症和视神经炎等医学问题具有重要的线索。目视电位的振幅通常小于自发电位的振幅,这导致难以可靠地找到诱发反应中重要的正、负峰的潜伏期和振幅。因此,噪声消除对于确定这些波形中感兴趣的特征变得非常重要。一种著名的消噪方法是对多个诱发电位进行平均。由于通常诱发电位具有不同的特征,因此对相同的视觉刺激具有不同的潜伏期和振幅,因此对EP波形进行排列后的平均可以大大改善波形质量。在本文中,我们使用了一种时间对准方法,通过最小化这些波形的dft的线性相移形式,同时减少了所有波形之间的频谱差异。我们证明了该方法成功地对齐了多个视觉EPs,并获得了平滑的平均波形和降低了噪声。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信