首页 | 本学科首页   官方微博 | 高级检索  
     检索      

融合梯度信息的最小生成树医学图像配准
引用本文:张少敏,ZHI Li-jia,支力佳,赵大哲,赵宏.融合梯度信息的最小生成树医学图像配准[J].东北大学学报(自然科学版),2010,31(10):1393-1396.
作者姓名:张少敏  ZHI Li-jia  支力佳  赵大哲  赵宏
作者单位:东北大学,信息科学与工程学院,辽宁,沈阳,110004;东北大学,医学影像计算教育部重点实验室,辽宁,沈阳,110004;东北大学,信息科学与工程学院,辽宁,沈阳,110004;东北大学,医学影像计算教育部重点实验室,辽宁,沈阳,110004;东北大学,信息科学与工程学院,辽宁,沈阳,110004;东北大学,医学影像计算教育部重点实验室,辽宁,沈阳,110004;东北大学,信息科学与工程学院,辽宁,沈阳,110004;东北大学,医学影像计算教育部重点实验室,辽宁,沈阳,110004;东北大学,信息科学与工程学院,辽宁,沈阳,110004;东北大学,医学影像计算教育部重点实验室,辽宁,沈阳,110004
基金项目:辽宁省重大科技计划项目 
摘    要:针对传统的均匀子采样的最小生成树配准方法对采样率敏感,导致配准鲁棒性降低的问题,提出了一种融合梯度信息的最小生成树医学图像配准算法.该算法首先提取均匀子采样点集,并在此基础上构造最小生成树;然后使用最小生成树来估计Rényi熵;最后将图像间的边缘梯度信息融入到配准框架中.通过在公共数据集RREP上,与传统的基于均匀子采样的最小生成树配准算法和基于归一化互信息配准算法相比,提出的算法在达到良好配准精度的同时,具有更平滑的配准函数和较强的鲁棒性.

关 键 词:医学图像配准  最小生成树  Rényi    图像梯度

Minimum Spanning Tree Integrated with Gradient Information for Medical Image Registration
ZHANG Shao-min,ZHI Li-jia,ZHAO Da-zhe,ZHAO Hong.Minimum Spanning Tree Integrated with Gradient Information for Medical Image Registration[J].Journal of Northeastern University(Natural Science),2010,31(10):1393-1396.
Authors:ZHANG Shao-min  ZHI Li-jia  ZHAO Da-zhe  ZHAO Hong
Institution:(1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) Key Laboratory of Medical Image Computing(Ministry of Education), Northeastern University, Shenyang 110004, China
Abstract:The conventional MST (minimum spanning tree) image registration based on uniform sub-sampling is so sensitive to sampling rate that the registration robustness is thus reduced. To solve the problem, MST integrated with gradient information is proposed as a medical image registration algorithm. In the algorithm, the uniform sub-sampling point set is extracted to form MST, which is used to estimate the Re´nyi entropy directly. As a result, the edge gradient information between images is integrated into the registration framework. Comparison results of the images obtained from Vanderbilt retrospective registration project (RREP) showed that the algorithm proposed can provide smoother registration function and better robustness than both the MST registration algorithm based on conventional uniform sub-sampling and the registration algorithm based on normalized mutual information (NMI).
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号