Suppr超能文献

Spike 排序算法评估:在人类丘脑底核记录和模拟中的应用。

Evaluation of Spike Sorting Algorithms: Application to Human Subthalamic Nucleus Recordings and Simulations.

机构信息

Department of Neurology, University Hospital Cologne, Germany; Institute of Neuroscience and Medicine (INM-6) and Institute for Advanced Simulation (IAS-6) and JARA BRAIN Institute I (INM-10), Jülich Research Centre, Germany.

Institute of Neuroscience and Medicine (INM-6) and Institute for Advanced Simulation (IAS-6) and JARA BRAIN Institute I (INM-10), Jülich Research Centre, Germany.

出版信息

Neuroscience. 2019 Aug 21;414:168-185. doi: 10.1016/j.neuroscience.2019.07.005. Epub 2019 Jul 9.

Abstract

An important prerequisite for the analysis of spike synchrony in extracellular recordings is the extraction of single-unit activity from the multi-unit signal. To identify single units, potential spikes are separated with respect to their potential neuronal origins ('spike sorting'). However, different sorting algorithms yield inconsistent unit assignments, which seriously influences subsequent spike train analyses. We aim to identify the best sorting algorithm for subthalamic nucleus recordings of patients with Parkinson's disease (experimental data ED). Therefore, we apply various prevalent algorithms offered by the 'Plexon Offline Sorter' and evaluate the sorting results. Since this evaluation leaves us unsure about the best algorithm, we apply all methods again to artificial data (AD) with known ground truth. AD consists of pairs of single units with different shape similarity embedded in the background noise of the ED. The sorting evaluation depicts a significant influence of the respective methods on the single unit assignments. We find a high variability in the sortings obtained by different algorithms that increases with single units shape similarity. We also find significant differences in the resulting firing characteristics. We conclude that Valley-Seeking algorithms produce the most accurate result if the exclusion of artifacts as unsorted events is important. If the latter is less important ('clean' data) the K-Means algorithm is a better option. Our results strongly argue for the need of standardized validation procedures based on ground truth data. The recipe suggested here is simple enough to become a standard procedure.

摘要

分析细胞外记录中的尖峰同步性的一个重要前提是从多单位信号中提取单单位活动。为了识别单单位,根据它们潜在的神经元起源来分离潜在的尖峰(“尖峰排序”)。然而,不同的排序算法产生不一致的单元分配,这严重影响后续的尖峰序列分析。我们的目标是为帕金森病患者的丘脑底核记录(实验数据 ED)确定最佳排序算法。因此,我们应用“Plexon 离线排序器”提供的各种流行算法,并评估排序结果。由于这种评估使我们对最佳算法不确定,我们再次将所有方法应用于具有已知真实情况的人工数据(AD)。AD 由嵌入在 ED 背景噪声中的不同形状相似性的一对单单位组成。排序评估描述了各自方法对单单位分配的显著影响。我们发现不同算法获得的排序具有很高的可变性,随着单单位形状相似性的增加而增加。我们还发现了在产生的点火特性方面的显著差异。我们得出的结论是,如果排除伪影作为未排序事件很重要,则 Valley-Seeking 算法会产生最准确的结果。如果后者不太重要(“干净”数据),则 K-Means 算法是更好的选择。我们的结果强烈表明需要基于真实数据的标准化验证程序。这里建议的方法足够简单,可以成为标准程序。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验