检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:顾菊平[1,2] 程天宇 王建平 华亮[1] 赵凤申[1] 蒋凌 Gu Juping;Cheng Tianyu;Wang Jianping;Hua Liang;Zhao Fengshen;Jiang Ling(School of Electrical Engineering,Nantong University,Nantong 226019,China;School of Automation,Nanjing University of Science and Technology,Nanjing 210094,China)
机构地区:[1]南通大学电气工程学院,江苏南通226019 [2]南京理工大学自动化学院,江苏南京210094
出 处:《系统仿真学报》2020年第11期2105-2111,共7页Journal of System Simulation
基 金:National Natural Science Foundation (61673226);Major Natural Science Research Project of Jiangsu Higher Education Institutions (18KJA470003)。
摘 要:针对颅部三维医学图像配准计算量大、配准效率低等问题,提出了一种基于几何特征空间约束的快速配准方法。提取三维轮廓点云,提出了一种基于点云集最优拟合环的特征构造方法,并以每个特征环和每个层的质心用作特征量,通过使用迭代最近点(Iterative Closest Point, ICP)方法完成快速配准。实验结果表明,与传统的ICP算法相比,该方法计算量小,配准精度高,配准速度快。它是一种有效的实时三维配准方法。Aiming at the of large amount of computational data and low registration efficiency in 3 D cranial medical image registration, a fast registration method based on geometric feature space constraints is proposed. The algorithm extracts three-dimensional contour point clusters, and proposes a feature construction method based on the optimal fitting ring of point clusters. The feature rings and the centroids of each layer are used as feature quantities, and the fast registration is completed by using Iterative Closest Point(ICP) method. The experimental results show that the method has less computation amount, high satisfactory registration accuracy and much faster registration speed than the traditional ICP algorithm. It is an effective real-time three-dimensional registration method.
关 键 词:3D医学图像 快速配准 几何特征不变量 迭代最近点
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15