Centre for Functional MRI of the Brain (FMRIB), Wellcome Centre for Integrative Neuroimaging, Nuffield Department of Clinical Neurosciences, University of Oxford, John Radcliffe Hospital, Headley Way, Oxford, OX3 9DU, UK.
Wellcome Centre for Human Neuroimaging, UCL Institute of Neurology, University College London, 12 Queen Square, London, WC1N 3BG, UK.
Neuroimage. 2020 Oct 1;219:116962. doi: 10.1016/j.neuroimage.2020.116962. Epub 2020 Jun 1.
Nonlinear registration is critical to many aspects of Neuroimaging research. It facilitates averaging and comparisons across multiple subjects, as well as reporting of data in a common anatomical frame of reference. It is, however, a fundamentally ill-posed problem, with many possible solutions which minimise a given dissimilarity metric equally well. We present a regularisation method capable of selectively driving solutions towards those which would be considered anatomically plausible by penalising unlikely lineal, areal and volumetric deformations. This penalty is symmetric in the sense that geometric expansions and contractions are penalised equally, which encourages inverse-consistency. We demonstrate that this method is able to significantly reduce local volume changes and shape distortions compared to state-of-the-art elastic (FNIRT) and plastic (ANTs) registration frameworks. Crucially, this is achieved whilst simultaneously matching or exceeding the registration quality of these methods, as measured by overlap scores of labelled cortical regions. Extensive leveraging of GPU parallelisation has allowed us to solve this highly computationally intensive optimisation problem while maintaining reasonable run times of under half an hour.
非线性配准在神经影像学研究的许多方面都至关重要。它促进了多个主体之间的平均和比较,以及在共同的解剖参考框架中报告数据。然而,这是一个基本的不适定问题,有许多可能的解决方案都能很好地最小化给定的不相似性度量。我们提出了一种正则化方法,能够通过惩罚不太可能的线性、区域和体积变形,有选择地驱动解决方案朝着被认为在解剖上合理的方向发展。这种惩罚在几何膨胀和收缩被同等惩罚的意义上是对称的,这鼓励了逆一致性。我们证明,与最先进的弹性(FNIRT)和塑性(ANTs)配准框架相比,这种方法能够显著减少局部体积变化和形状扭曲。至关重要的是,这是在同时匹配或超过这些方法的配准质量的情况下实现的,这可以通过标记的皮质区域的重叠分数来衡量。充分利用 GPU 并行化,使我们能够解决这个高度计算密集的优化问题,同时保持合理的运行时间在半小时以内。