首页> 外文期刊>IEEE Transactions on Image Processing >Evaluation of Optimization Methods for Nonrigid Medical Image Registration Using Mutual Information and B-Splines
【24h】

Evaluation of Optimization Methods for Nonrigid Medical Image Registration Using Mutual Information and B-Splines

机译:基于互信息和B样条的非刚性医学图像配准优化方法评价

获取原文
获取原文并翻译 | 示例
           

摘要

A popular technique for nonrigid registration of medical images is based on the maximization of their mutual information, in combination with a deformation field parameterized by cubic B-splines. The coordinate mapping that relates the two images is found using an iterative optimization procedure. This work compares the performance of eight optimization methods: gradient descent (with two different step size selection algorithms), quasi-Newton, nonlinear conjugate gradient, Kiefer-Wolfowitz, simultaneous perturbation, Robbins-Monro, and evolution strategy. Special attention is paid to computation time reduction by using fewer voxels to calculate the cost function and its derivatives. The optimization methods are tested on manually deformed CT images of the heart, on follow-up CT chest scans, and on MR scans of the prostate acquired using a BFFE, Tl, and T2 protocol. Registration accuracy is assessed by computing the overlap of segmented edges. Precision and convergence properties are studied by comparing deformation fields. The results show that the Robbins-Monro method is the best choice in most applications. With this approach, the computation time per iteration can be lowered approximately 500 times without affecting the rate of convergence by using a small subset of the image, randomly selected in every iteration, to compute the derivative of the mutual information. From the other methods the quasi-Newton and the nonlinear conjugate gradient method achieve a slightly higher precision, at the price of larger computation times.
机译:一种用于医学图像非刚性配准的流行技术是基于其互信息的最大化,并结合由三次B样条参数化的变形场。使用迭代优化过程找到与两个图像相关的坐标映射。这项工作比较了八种优化方法的性能:梯度下降(具有两种不同的步长选择算法),拟牛顿,非线性共轭梯度,Kiefer-Wolfowitz,同时摄动,Robbins-Monro和演化策略。通过使用较少的体素来计算成本函数及其导数,尤其要注意减少计算时间。在使用BFFE,T1和T2协议获取的前列腺的手动变形CT图像,后续CT胸部扫描以及前列腺MR扫描上测试了优化方法。通过计算分段边缘的重叠来评估套准精度。通过比较变形场来研究精度和收敛性。结果表明,Robbins-Monro方法是大多数应用中的最佳选择。通过这种方法,通过使用在每次迭代中随机选择的图像小子集来计算互信息的导数,可以将每次迭代的计算时间减少大约500倍,而不会影响收敛速度。与其他方法相比,拟牛顿法和非线性共轭梯度法以更高的计算时间为代价实现了更高的精度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号