Density-adaptive registration of pointclouds based on Dirichlet Process Gaussian Mixture Models

被引:1
作者
Jia, Tingting [1 ,4 ]
Taylor, Zeike A. [2 ,3 ]
Chen, Xiaojun [4 ,5 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Biomed Engn, 800 Dongchuan Rd, Shanghai 200240, Peoples R China
[2] Univ Leeds, CISTIB Ctr Computat Imaging & Simulat Technol Biom, Woodhouse Lane, Leeds LS2 9JT, England
[3] Univ Leeds, Inst Med & Biol Engn, Woodhouse Lane, Leeds LS2 9JT, England
[4] Shanghai Jiao Tong Univ, Sch Mech Engn, 800 Dongchuan Rd, Shanghai 200240, Peoples R China
[5] Shanghai Jiao Tong Univ, Inst Med Robot, 800 Dongchuan Rd, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Pointclouds registration; Density adaptive; Variational Bayesian inference; Dirichlet Process Gaussian mixture model; POINT SET REGISTRATION;
D O I
10.1007/s13246-023-01245-4
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
We propose an algorithm for rigid registration of pre- and intra-operative patient anatomy, represented as pointclouds, during minimally invasive surgery. This capability is essential for development of augmented reality systems for guiding such interventions. Key challenges in this context are differences in the point density in the pre- and intra-operative pointclouds, and potentially low spatial overlap between the two. Solutions, correspondingly, must be robust to both of these phenomena. We formulated a pointclouds registration approach which considers the pointclouds after rigid transformation to be observations of a global non-parametric probabilistic model named Dirichlet Process Gaussian Mixture Model. The registration problem is solved by minimizing the Kullback-Leibler divergence in a variational Bayesian inference framework. By this means, all unknown parameters are recursively inferred, including, importantly, the optimal number of mixture model components, which ensures the model complexity efficiently matches that of the observed data. By presenting the pointclouds as KDTrees, both the data and model are expanded in a coarse-to-fine style. The scanning weight of each point is estimated by its neighborhood, imparting the algorithm with robustness to point density variations. Experiments on several datasets with different levels of noise, outliers and pointcloud overlap show that our method has a comparable accuracy, but higher efficiency than existing Gaussian Mixture Model methods, whose performance is sensitive to the number of model components.
引用
收藏
页码:719 / 734
页数:16
相关论文
共 38 条
  • [1] Fast High-Dimensional Filtering Using the Permutohedral Lattice
    Adams, Andrew
    Baek, Jongmin
    Davis, Myers Abraham
    [J]. COMPUTER GRAPHICS FORUM, 2010, 29 (02) : 753 - 762
  • [2] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING
    BENTLEY, JL
    [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517
  • [3] 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
  • [4] An Adaptive Data Representation for Robust Point-Set Registration and Merging
    Campbell, Dylan
    Petersson, Lars
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 4292 - 4300
  • [5] Non-rigid point set registration via coherent spatial mapping
    Chen, Jun
    Ma, Jiayi
    Yang, Changcai
    Ma, Li
    Zheng, Sheng
    [J]. SIGNAL PROCESSING, 2015, 106 : 62 - 72
  • [6] A Probabilistic Framework for Color-Based Point Set Registration
    Danelljan, Martin
    Meneghetti, Giulia
    Khan, Fahad Shahbaz
    Felsberg, Michael
    [J]. 2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, : 1818 - 1826
  • [7] MLMD: Maximum Likelihood Mixture Decoupling for Fast and Accurate Point Cloud Registration
    Eckart, Ben
    Kim, Kihwan
    Troccoli, Alejandro
    Kelly, Alonzo
    Kautz, Jan
    [J]. 2015 INTERNATIONAL CONFERENCE ON 3D VISION, 2015, : 241 - 249
  • [8] HGMR: Hierarchical Gaussian Mixtures for Adaptive 3D Registration
    Eckart, Benjamin
    Kim, Kihwan
    Kautz, Jan
    [J]. COMPUTER VISION - ECCV 2018, PT 15, 2018, 11219 : 730 - 746
  • [9] Eckart B, 2013, IEEE INT C INT ROBOT, P4355, DOI 10.1109/IROS.2013.6696981
  • [10] Evangelidis GD, 2014, LECT NOTES COMPUT SC, V8695, P109, DOI 10.1007/978-3-319-10584-0_8