高级检索

    融合多种特征点信息的最小生成树医学图像配准

    Minimum Spanning Tree Fusing Multi-Feature Point Information for Medical Image Registration

    • 摘要: 针对医学图像配准鲁棒性强、准确性高和速度快的要求,提出了一种基于融合多种特征点信息的最小生成树医学图像配准算法.该算法首先提取3种特征点,Harris-Laplace,Laplacian of Gaussian和网格点;然后使用遗传算法去除特征点集的冗余,并通过对位映射构建无向完全图顶点集合;进而使用改进的Kruskal算法来构造最小生成树;最后使用得到的最小生成树估计Rényi熵.该算法较好地解决了在噪声数据中使用最小生成树估计Rényi熵面临的特征点不稳定导致鲁棒性低和构造最小生成树遇到的速度瓶颈.实验结果表明:在图像含有噪声、灰度不均匀以及初始误配范围较大的情况下,该算法在达到良好配准精度的同时,具有较强的鲁棒性和较快的速度.

       

      Abstract: Medical image registration is a fundamental task in image process, and widely used for diagnosing disease, panning treatment, guiding surgery and studying disease progression. For medical image registration of high robustness, high accuracy and speed requirements, this paper proposes a minimum spanning tree (MST) algorithm of fusing multi-feature point information for medical image registration. This algorithm extracts three kinds of feature points from image: Harris-Laplace points, Laplacian of Gaussian points, and grid points. Then genetic algorithm is used for point selection; and by choosing appropriate cost function, the redundancy can be reduced in a great measure. The selected points are then used in building a vertices set of undirected complete graph by location-mapped method. Finally, MST is constructed by modified Kruskal algorithm, which estimates Rényi entropy directly. The new algorithm has solved the low robustness brought by the instability of extraction of feature points and the speed bottleneck problem when using MST to estimate the Rényi entropy. Experimental results show that in the images with noise, non-uniform intensity and large scope of the initial misalignment case, the proposed algorithm achieves better robustness and higher speed while maintaining good registration accuracy, compared with the conventional area-based and feature-based registration methods.

       

    /

    返回文章
    返回