Skull Point Cloud Registration Method Based on Curvature Maps

被引:2
|
作者
Yang Wen [1 ]
Zhou Mingquan [1 ]
Guo Bao [1 ]
Geng Guohua [1 ]
Liu Xiaoning [1 ]
Liu Yangyang [1 ]
机构
[1] Northwest Univ, Coll Informat Sci & Technol, Xian 710127, Shaanxi, Peoples R China
关键词
image processing; skull registration; regional curvature map; singular value decomposition; dynamic iterative coefficient; iterative closest point algorithm; ALGORITHM; CURVES;
D O I
10.3788/AOS202040.1610002
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
This paper presents a new skull point cloud registration method based on curvature maps to improve the registration accuracy and convergence speed of the skull point cloud model. First, a three-dimensional shape block centered on the feature points and containing its adjacent points is extracted from the skull point cloud, and all the points arc projected onto the two-dimensional plane. Furthermore, the projection points arc quantized into the corresponding units in the two-dimensional supporting area, and the weighted curvature is encoded as curvature distribution images to construct the region curvature map descriptors of the feature points. Then, matching point pairs arc established by matching points with similar local shapes based on regional curvature map descriptors, and the rigid body transformation relationship between skull point clouds is calculated using the singular value decomposition method to realize skull coarse registration. Finally, the iterative closest point (ICP) algorithm is improved by introducing dynamic iteration coefficients and used to achieve fine skull registration. The experiment results demonstrate that the proposed rough registration method is an effective initial registration method. Compared with the original ICP algorithm, the improved ICP algorithm increases the registration accuracy and convergence speed by approximately 11% and 37%, respectively, and reduces the time-consumption by approximately 31 %. The bunny point cloud model is used to verify the generalization ability of the proposed method. The results demonstrate that the registration effects of the improved ICP algorithm arc better than those of the original ICP algorithm.
引用
收藏
页数:11
相关论文
共 30 条
  • [1] ANDONI A, 2006, 2006 47 ANN IEEE S F
  • [2] LEAST-SQUARES FITTING OF 2 3-D POINT SETS
    ARUN, KS
    HUANG, TS
    BLOSTEIN, SD
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (05) : 699 - 700
  • [3] Attia M, 2017, 2017 INT C HIGH PERF
  • [4] A METHOD FOR REGISTRATION OF 3-D SHAPES
    BESL, PJ
    MCKAY, ND
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) : 239 - 256
  • [5] Cao Zhengcai, 2014, [自动化学报, Acta Automatica Sinica], V40, P2356
  • [6] Chum O, 2003, LECT NOTES COMPUT SC, V2781, P236
  • [7] Probability iterative closest point algorithm for m-D point set registration with noise
    Du, Shaoyi
    Liu, Juan
    Zhang, Chunjia
    Zhu, Jihua
    Li, Ke
    [J]. NEUROCOMPUTING, 2015, 157 : 187 - 198
  • [8] Neighboring constraint-based pairwise point cloud registration algorithm
    Geng, Nan
    Ma, Fufeng
    Yang, Huijun
    Li, Boyang
    Zhang, Zhiyi
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2016, 75 (24) : 16763 - 16780
  • [9] High-Precision Registration of Point Clouds Based on Sphere Feature Constraints
    Huang, Junhui
    Wang, Zhao
    Gao, Jianmin
    Huang, Youping
    Towers, David Peter
    [J]. SENSORS, 2017, 17 (01):
  • [10] Pseudo-spherical normal Darboux images of curves on a timelike surface in three dimensional Lorentz-Minkowski space
    Izumiya, Shyuichi
    Nabarro, Ana Claudia
    Sacramento, Andrea de Jesus
    [J]. JOURNAL OF GEOMETRY AND PHYSICS, 2015, 97 : 105 - 118