University of North Carolina at Chapel Hill, Chapel Hill, USA.
Department of Computer Science, University of Salzburg, Austria.
Neuroimage. 2017 Sep;158:378-396. doi: 10.1016/j.neuroimage.2017.07.008. Epub 2017 Jul 11.
This paper introduces Quicksilver, a fast deformable image registration method. Quicksilver registration for image-pairs works by patch-wise prediction of a deformation model based directly on image appearance. A deep encoder-decoder network is used as the prediction model. While the prediction strategy is general, we focus on predictions for the Large Deformation Diffeomorphic Metric Mapping (LDDMM) model. Specifically, we predict the momentum-parameterization of LDDMM, which facilitates a patch-wise prediction strategy while maintaining the theoretical properties of LDDMM, such as guaranteed diffeomorphic mappings for sufficiently strong regularization. We also provide a probabilistic version of our prediction network which can be sampled during the testing time to calculate uncertainties in the predicted deformations. Finally, we introduce a new correction network which greatly increases the prediction accuracy of an already existing prediction network. We show experimental results for uni-modal atlas-to-image as well as uni-/multi-modal image-to-image registrations. These experiments demonstrate that our method accurately predicts registrations obtained by numerical optimization, is very fast, achieves state-of-the-art registration results on four standard validation datasets, and can jointly learn an image similarity measure. Quicksilver is freely available as an open-source software.
本文介绍了 Quicksilver,一种快速的可变形图像配准方法。Quicksilver 对图像对的配准是通过直接基于图像外观的变形模型的补丁预测来实现的。使用深度编解码器网络作为预测模型。虽然预测策略是通用的,但我们专注于对大变形仿射度量映射(LDDMM)模型的预测。具体来说,我们预测 LDDMM 的动量参数化,这有利于补丁预测策略,同时保持 LDDMM 的理论性质,例如在足够强的正则化下保证保形映射。我们还提供了我们的预测网络的概率版本,该版本可以在测试时进行采样,以计算预测变形中的不确定性。最后,我们引入了一个新的校正网络,该网络大大提高了已有预测网络的预测精度。我们展示了单模态图谱到图像以及单模态/多模态图像到图像配准的实验结果。这些实验表明,我们的方法能够准确预测数值优化得到的配准,速度非常快,在四个标准验证数据集上达到了最先进的配准结果,并且可以联合学习图像相似性度量。Quicksilver 作为开源软件免费提供。