Suppr超能文献

弥散磁共振成像连接组学:确定性还是概率性追踪?

Mapping connectomes with diffusion MRI: deterministic or probabilistic tractography?

机构信息

School of Computing and Information Systems, The University of Melbourne, Parkville, Victoria, Australia.

Department of Biomedical Engineering, The University of Melbourne, Parkville, Victoria, Australia.

出版信息

Magn Reson Med. 2019 Feb;81(2):1368-1384. doi: 10.1002/mrm.27471. Epub 2018 Oct 10.

Abstract

PURPOSE

Human connectomics necessitates high-throughput, whole-brain reconstruction of multiple white matter fiber bundles. Scaling up tractography to meet these high-throughput demands yields new fiber tracking challenges, such as minimizing spurious connections and controlling for gyral biases. The aim of this study is to determine which of the two broadest classes of tractography algorithms-deterministic or probabilistic-is most suited to mapping connectomes.

METHODS

This study develops numerical connectome phantoms that feature realistic network topologies and that are matched to the fiber complexity of in vivo diffusion MRI (dMRI) data. The phantoms are utilized to evaluate the performance of tensor-based and multi-fiber implementations of deterministic and probabilistic tractography.

RESULTS

For connectome phantoms that are representative of the fiber complexity of in vivo dMRI, multi-fiber deterministic tractography yields the most accurate connectome reconstructions (F-measure = 0.35). Probabilistic algorithms are hampered by an abundance of false-positive connections, leading to lower specificity (F = 0.19). While omitting connections with the fewest number of streamlines (thresholding) improves the performance of probabilistic algorithms (F = 0.38), multi-fiber deterministic tractography remains optimal when it benefits from thresholding (F = 0.42).

CONCLUSIONS

Multi-fiber deterministic tractography is well suited to connectome mapping, while connectome thresholding is essential when using probabilistic algorithms.

摘要

目的

人类连接组学需要高通量、全脑重建多个白质纤维束。扩展轨迹追踪以满足这些高通量需求会产生新的纤维追踪挑战,例如最小化虚假连接和控制脑回偏差。本研究的目的是确定两种最广泛的轨迹追踪算法类别——确定性或概率性——最适合绘制连接组。

方法

本研究开发了具有真实网络拓扑结构且与体内扩散 MRI(dMRI)数据的纤维复杂性相匹配的数值连接组体模。这些体模用于评估基于张量和多纤维的确定性和概率性轨迹追踪的性能。

结果

对于代表体内 dMRI 纤维复杂性的连接组体模,多纤维确定性追踪产生了最准确的连接组重建(F 分数=0.35)。概率算法受到大量假阳性连接的阻碍,导致特异性较低(F=0.19)。虽然通过减少流线数量(阈值)来排除连接可以提高概率算法的性能(F=0.38),但当多纤维确定性追踪受益于阈值时,它仍然是最优的(F=0.42)。

结论

多纤维确定性追踪非常适合连接组映射,而连接组阈值对于使用概率算法至关重要。

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验