4.7 Article

Mapping registration sensitivity in MR mouse brain images

期刊

NEUROIMAGE
卷 82, 期 -, 页码 226-236

出版社

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.neuroimage.2013.06.004

关键词

Deformation based morphometry; Evaluation; MRI; Neuroanatomy; Atrophy simulation; Mouse brain

资金

  1. Canada Foundation for Innovation under the auspices of Compute Canada
  2. Government of Ontario
  3. Ontario Research Fund - Research Excellence
  4. University of Toronto
  5. Canadian Institutes of Health Research (CIHR)

向作者/读者索取更多资源

Nonlinear registration algorithms provide a way to estimate structural (brain) differences based on magnetic resonance images. Their ability to align images of different individuals and across modalities has been well-researched, but the bounds of their sensitivity with respect to the recovery of salient morphological differences between groups are unclear. Here we develop a novel approach to simulate deformations on MR brain images to evaluate the ability of two registration algorithms to extract structural differences corresponding to biologically plausible atrophy and expansion. We show that at a neuroanatomical level registration accuracy is influenced by the size and compactness of structures, but do so differently depending on how much change is simulated. The size of structures has a small influence on the recovered accuracy. There is a trend for larger structures to be recovered more accurately, which becomes only significant as the amount of simulated change is large. More compact structures can be recovered more accurately regardless of the amount of simulated change. Both tested algorithms underestimate the full extent of the simulated atrophy and expansion. Finally we show that when multiple comparisons are corrected for at a voxelwise level, a very low rate of false positives is obtained. More interesting is that true positive rates average around 40%, indicating that the simulated changes are not fully recovered. Simulation experiments were run using two fundamentally different registration algorithms and we identified the same results, suggesting that our findings are generalizable across different classes of nonlinear registration algorithms. (C) 2013 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据