首页> 外文期刊>Journal of Neuroscience Methods >Wiener filter deconvolution of overlapping evoked potentials.
【24h】

Wiener filter deconvolution of overlapping evoked potentials.

机译:重叠诱发电位的维纳滤波器反卷积。

获取原文
获取原文并翻译 | 示例
           

摘要

Evoked potentials (EPs) typically contain components that last up to several seconds. In order to save time and study adaptation effects, stimuli are often presented at high stimulation rates. Unfortunately, such protocols often suffer from a response overlap problem. Techniques based on Continuous Loop Averaging Deconvolution (CLAD) have been developed to formulate circular convolution to restore the source EP. These techniques, however, are sensitive to the additive noise and do not perform well when stimulus sequences with poor noise attenuation properties are chosen. This study offers a solution to this problem by applying Wiener theory to obtain an optimal filter that adapts the ratio of noise-to-signal by estimating the power spectra of both noise and signal using non-parametric or parametric methods. Experiments are conducted on simulation data and Auditory Evoked potentials (AEPs) acquired from human subjects to demonstrate the validity of the proposed theory. The results show that the Wiener deconvolution method improves the quality of the responses acquired with sequences with poor noise attenuation in the presence of high noise levels compared to the straight CLAD method. The results are comparable to responses obtained by conventional and Maximum Length Sequence (MLS) methods.
机译:诱发电位(EPs)通常包含持续数秒的成分。为了节省时间和研究适应性效应,通常以高刺激率呈现刺激。不幸的是,这样的协议经常遭受响应重叠的问题。已经开发了基于连续循环平均反卷积(CLAD)的技术来制定循环卷积以恢复源EP。但是,这些技术对加性噪声敏感,并且在选择具有较差的噪声衰减特性的刺激序列时效果不佳。这项研究通过应用维纳理论来获得最佳滤波器,从而通过使用非参数或参数方法估计噪声和信号的功率谱来适应噪声与信号的比率,从而提供了解决方案。对模拟数据和从人类受试者获得的听觉诱发电位(AEP)进行了实验,以证明所提出理论的有效性。结果表明,与纯CLAD方法相比,在高噪声水平下,维纳反卷积方法提高了具有较弱噪声衰减的序列所获取响应的质量。结果与通过常规方法和最大长度序列(MLS)方法获得的响应相当。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号