首页> 美国卫生研究院文献>Frontiers in Neuroinformatics >Topological Filtering of Dynamic Functional Brain Networks Unfolds Informative Chronnectomics: A Novel Data-Driven Thresholding Scheme Based on Orthogonal Minimal Spanning Trees (OMSTs)
【2h】

Topological Filtering of Dynamic Functional Brain Networks Unfolds Informative Chronnectomics: A Novel Data-Driven Thresholding Scheme Based on Orthogonal Minimal Spanning Trees (OMSTs)

机译:动态功能性脑网络的拓扑过滤展现了信息化的慢性切除术:一种基于正交最小生成树(OMST)的新型数据驱动阈值方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The human brain is a large-scale system of functionally connected brain regions. This system can be modeled as a network, or graph, by dividing the brain into a set of regions, or “nodes,” and quantifying the strength of the connections between nodes, or “edges,” as the temporal correlation in their patterns of activity. Network analysis, a part of graph theory, provides a set of summary statistics that can be used to describe complex brain networks in a meaningful way. The large-scale organization of the brain has features of complex networks that can be quantified using network measures from graph theory. The adaptation of both bivariate (mutual information) and multivariate (Granger causality) connectivity estimators to quantify the synchronization between multichannel recordings yields a fully connected, weighted, (a)symmetric functional connectivity graph (FCG), representing the associations among all brain areas. The aforementioned procedure leads to an extremely dense network of tens up to a few hundreds of weights. Therefore, this FCG must be filtered out so that the “true” connectivity pattern can emerge. Here, we compared a large number of well-known topological thresholding techniques with the novel proposed data-driven scheme based on orthogonal minimal spanning trees (OMSTs). OMSTs filter brain connectivity networks based on the optimization between the global efficiency of the network and the cost preserving its wiring. We demonstrated the proposed method in a large EEG database (N = 101 subjects) with eyes-open (EO) and eyes-closed (EC) tasks by adopting a time-varying approach with the main goal to extract features that can totally distinguish each subject from the rest of the set. Additionally, the reliability of the proposed scheme was estimated in a second case study of fMRI resting-state activity with multiple scans. Our results demonstrated clearly that the proposed thresholding scheme outperformed a large list of thresholding schemes based on the recognition accuracy of each subject compared to the rest of the cohort (EEG). Additionally, the reliability of the network metrics based on the fMRI static networks was improved based on the proposed topological filtering scheme. Overall, the proposed algorithm could be used across neuroimaging and multimodal studies as a common computationally efficient standardized tool for a great number of neuroscientists and physicists working on numerous of projects.
机译:人脑是功能连接的大脑区域的大规模系统。通过将大脑分为一组区域或“节点”,并将节点或“边缘”之间的连接强度量化为它们的模式的时间相关性,可以将该系统建模为网络或图形。活动。网络分析是图论的一部分,提供了一组摘要统计信息,可用于以有意义的方式描述复杂的大脑网络。大脑的大规模组织具有复杂网络的特征,可以使用图论中的网络度量对其进行量化。通过对双变量(相互信息)和多变量(Granger因果关系)连接估计器进行调整以量化多通道记录之间的同步,可以产生完全连接的,加权的(a)对称功能连接图(FCG),代表所有大脑区域之间的关联。前述过程导致数十到数百重量的极其密集的网络。因此,必须过滤掉此FCG,以便出现“真实”的连接模式。在这里,我们将大量众所周知的拓扑阈值处理技术与基于正交最小生成树(OMST)的新型数据驱动方案进行了比较。 OMST根据网络的整体效率与保留其布线成本之间的优化来过滤大脑连接网络。我们采用时变方法,其主要目标是提取可以完全区分每个特征的特征,从而在具有睁眼(EO)和闭眼(EC)任务的大型EEG数据库(N = 101个受试者)中演示了该方法其余部分的主题。此外,在第二次fMRI静止状态活动的多次扫描研究中,评估了该方案的可靠性。我们的结果清楚地表明,基于每个受试者的识别准确度,与同类研究(EEG)的其余部分相比,拟议的阈值方案胜过大量的阈值方案。此外,基于提出的拓扑过滤方案,提高了基于功能磁共振成像静态网络的网络指标的可靠性。总体而言,所提出的算法可以在神经成像和多峰研究中用作对许多项目工作的大量神经科学家和物理学家通用的计算有效的标准化工具。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号