计算机应用 ›› 2019, Vol. 39 ›› Issue (10): 3028-3033.DOI: 10.11772/j.issn.1001-9081.2019040681

• 虚拟现实与多媒体计算 • 上一篇    下一篇

基于全局与局部相似性测度的非刚性点集配准

彭磊1,2, 杨秀云3, 张裕飞2, 李光耀1   

  1. 1. 同济大学 电子与信息工程学院, 上海 201804;
    2. 山东第一医科大学(山东省医学科学院) 医学信息工程学院, 山东 泰安 271016;
    3. 山东第一医科大学(山东省医学科学院) 现代教育技术中心, 山东 泰安 271016
  • 收稿日期:2019-04-22 修回日期:2019-06-23 发布日期:2019-08-21 出版日期:2019-10-10
  • 通讯作者: 彭磊
  • 作者简介:彭磊(1977-),男,山东泰安人,副教授,硕士,CCF会员,主要研究方向:医学图像处理、机器学习;杨秀云(1982-),女,山东聊城人,助理工程师,硕士,主要研究方向:医学图像处理;张裕飞(1965-),男,山东微山人,教授,硕士,主要研究方向:医学信息学;李光耀(1965-),男,安徽安庆人,教授,博士,主要研究方向:计算机视觉、图像处理。
  • 基金资助:
    山东省自然科学基金资助项目(ZR2015FL005);泰安市科技发展计划项目(2017GX0045)。

Non-rigid point set registration based on global and local similarity measurement

PENG Lei1,2, YANG Xiuyun3, ZHANG Yufei2, LI Guangyao1   

  1. 1. College of Electronics and Information Engineering, Tongji University, Shanghai 201804, China;
    2. College of Medical Information Engineering, Shandong First Medical University & Shandong Academy of Medical Sciences, Tai'an Shandong 271016, China;
    3. Modern Education Technology Center, Shandong First Medical University & Shandong Academy of Medical Sciences, Tai'an Shandong 271016, China
  • Received:2019-04-22 Revised:2019-06-23 Online:2019-08-21 Published:2019-10-10
  • Supported by:
    This work is partially supported by the Shandong Provincial Natural Science Foundation (ZR2015FL005), the Tai'an Science and Technology Development Program (2017GX0045).

摘要: 非刚性点集配准算法中,能否找到正确的对应关系对配准结果起着至关重要的作用,而通常两个点集中的对应点除了距离比较接近之外还具有相似的邻域结构,因此提出基于全局与局部相似性测度的非刚性点集配准算法。首先,使用一致性点漂移(CPD)算法作为配准框架,采用高斯混合模型对点集进行建模。然后,对全局局部混合距离进行改进,形成全局与局部相似性测度准则。最后,采用期望最大化(EM)算法迭代地求解对应关系和变换公式:在迭代初期局部相似性所占比重较大,从而能够尽快地找到正确的对应关系;随着迭代的进展全局相似性比重逐渐增大,从而确保得到较小的配准误差。实验结果表明,与薄板样条鲁棒点匹配(TPS-RPM)算法、高斯混合模型点集配准(GMMREG)算法、基于L2E估计的鲁棒点匹配算法(RPM-L2E)、基于全局局部混合距离与薄板样条的点集配准算法(GLMDTPS)和CPD算法相比,所提算法的均方根误差(RMSE)分别下降了39.93%、42.45%、32.51%、22.36%和11.76%,说明该算法具有较好的配准效果。

关键词: 点集配准, 图像配准, 非刚性配准, 高斯混合模型, 相似性测度

Abstract: In the non-rigid point set registration algorithm, whether the correct correspondence can be found plays an important role. Generally the corresponding points in two point sets have similar neighborhood structures besides the close distance. Therefore, a non-rigid point set registration algorithm based on global and local similarity measurement was proposed. Firstly, the Coherent Point Drift (CPD) algorithm was used as the registration framework, and the Gaussian mixture model was used to model the point sets. Secondly, the global and local mixture distance was improved to form the global and local similarity measurement criterion. Finally, the correspondence and the transformation formula were solved by the Expectation Maximization (EM) algorithm. In the initial stage of the iteration, the proportion of local similarity was larger so that the correct correspondence was able to be found rapidly; with the progress of the iteration, the proportion of global similarity was increased to ensure the smaller registration error. Experimental results show that compared with the Thin Plate Spline Robust Point Matching (TPS-RPM) algorithm, the Gaussian Mixture Models point set REGistration (GMMREG) algorithm, the Robust Point Matching algorithm based on L2E estimation (RPM-L2E), the Global and Local Mixture Distance and Thin Plate Spline based point set registration algorithm (GLMDTPS) and the CPD algorithm, the proposed algorithm has the Root Mean Squared Error (RMSE) decreased by 39.93%, 42.45%, 32.51%, 22.36% and 11.76% respectively, indicating the proposed algorithm has better registration performance.

Key words: point set registration, image registration, non-rigid registration, Gaussian mixture model, similarity measurement

中图分类号: