首页> 美国卫生研究院文献>Frontiers in Neuroinformatics >Memory-Efficient Analysis of Dense Functional Connectomes
【2h】

Memory-Efficient Analysis of Dense Functional Connectomes

机译:记忆功能分析密集的功能连接。

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

摘要

The functioning of the human brain relies on the interplay and integration of numerous individual units within a complex network. To identify network configurations characteristic of specific cognitive tasks or mental illnesses, functional connectomes can be constructed based on the assessment of synchronous fMRI activity at separate brain sites, and then analyzed using graph-theoretical concepts. In most previous studies, relatively coarse parcellations of the brain were used to define regions as graphical nodes. Such parcellated connectomes are highly dependent on parcellation quality because regional and functional boundaries need to be relatively consistent for the results to be interpretable. In contrast, dense connectomes are not subject to this limitation, since the parcellation inherent to the data is used to define graphical nodes, also allowing for a more detailed spatial mapping of connectivity patterns. However, dense connectomes are associated with considerable computational demands in terms of both time and memory requirements. The memory required to explicitly store dense connectomes in main memory can render their analysis infeasible, especially when considering high-resolution data or analyses across multiple subjects or conditions. Here, we present an object-based matrix representation that achieves a very low memory footprint by computing matrix elements on demand instead of explicitly storing them. In doing so, memory required for a dense connectome is reduced to the amount needed to store the underlying time series data. Based on theoretical considerations and benchmarks, different matrix object implementations and additional programs (based on available Matlab functions and Matlab-based third-party software) are compared with regard to their computational efficiency. The matrix implementation based on on-demand computations has very low memory requirements, thus enabling analyses that would be otherwise infeasible to conduct due to insufficient memory. An open source software package containing the created programs is available for download.
机译:人脑的功能依赖于复杂网络中众多单个单元的相互作用和整合。为了确定特定认知任务或精神疾病的网络配置特征,可以基于在单独的大脑部位的同步功能磁共振成像活动的评估来构建功能连接体,然后使用图论概念进行分析。在大多数先前的研究中,大脑的相对较粗的碎片被用来将区域定义为图形节点。由于区域和功能的边界需要相对一致才能使结果可解释,因此这种有小块的连接体高度依赖于小块的质量。相反,密集的连接组不受此限制,因为数据固有的拆分用于定义图形节点,还允许对连接模式进行更详细的空间映射。但是,就时间和内存需求而言,密集的连接组与相当大的计算需求相关。在主存储器中显式存储密集连接组所需的存储器可能使其分析变得不可行,尤其是在考虑高分辨率数据或跨多个主题或条件的分析时。在这里,我们提出了一种基于对象的矩阵表示形式,该矩阵表示形式通过按需计算矩阵元素(而不是显式存储它们)来实现非常低的内存占用。这样,密集连接器所需的内存将减少为存储基础时间序列数据所需的内存。基于理论上的考虑和基准,比较了不同的矩阵对象实现和其他程序(基于可用的Matlab函数和基于Matlab的第三方软件)的计算效率。基于按需计算的矩阵实现对内存的要求非常低,因此可以进行由于内存不足而无法进行的分析。包含创建的程序的开源软件包可以下载。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号