A Two-Stage Point Cloud Registration Method for Knee Joint Replacement Navigation*

Wei Minhua, W. Chaoqun, Zhou Haifeng, Cheng Xiao, Kuang Shaolong, Sun Lining
{"title":"A Two-Stage Point Cloud Registration Method for Knee Joint Replacement Navigation*","authors":"Wei Minhua, W. Chaoqun, Zhou Haifeng, Cheng Xiao, Kuang Shaolong, Sun Lining","doi":"10.1109/WRCSARA53879.2021.9612682","DOIUrl":null,"url":null,"abstract":"To resolve the problem that the iterative closest point (ICP) algorithm commonly used in knee joint replacement surgery registration had low registration accuracy and was easy to fall into local optimal solutions. An improved registration method based on feature point clouds was proposed. First, the Harris-3D algorithm was used to extract the feature point cloud of the three-dimensional model of the knee joint. Optical tracking system (OTS) was used to collect the point cloud of the corresponding area of the sawbone. Then, the Sample Consensus Initial Alignment (SAC-IA) algorithm was used to perform coarse registration on two point clouds. The ICP algorithm was used to make the registration matrix converge to an optimal solution. The k-d tree was used to find neighboring points to accelerate the iterative process. Finally, the simulation of the registration method was taken to prove the feasibility of the method. The accuracy of the knee joint surgery navigation registration experiment was carried out with the knee joint femur model as the object. Result shows that the error of the proposed registration algorithm is 2.12mm, while the error of the ICP algorithm is 6.30mm, which verifies the effectiveness of this method.","PeriodicalId":246050,"journal":{"name":"2021 WRC Symposium on Advanced Robotics and Automation (WRC SARA)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 WRC Symposium on Advanced Robotics and Automation (WRC SARA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WRCSARA53879.2021.9612682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To resolve the problem that the iterative closest point (ICP) algorithm commonly used in knee joint replacement surgery registration had low registration accuracy and was easy to fall into local optimal solutions. An improved registration method based on feature point clouds was proposed. First, the Harris-3D algorithm was used to extract the feature point cloud of the three-dimensional model of the knee joint. Optical tracking system (OTS) was used to collect the point cloud of the corresponding area of the sawbone. Then, the Sample Consensus Initial Alignment (SAC-IA) algorithm was used to perform coarse registration on two point clouds. The ICP algorithm was used to make the registration matrix converge to an optimal solution. The k-d tree was used to find neighboring points to accelerate the iterative process. Finally, the simulation of the registration method was taken to prove the feasibility of the method. The accuracy of the knee joint surgery navigation registration experiment was carried out with the knee joint femur model as the object. Result shows that the error of the proposed registration algorithm is 2.12mm, while the error of the ICP algorithm is 6.30mm, which verifies the effectiveness of this method.
膝关节置换术导航的两阶段点云配准方法*
针对膝关节置换术配准中常用的迭代最近点(ICP)算法配准精度低、易陷入局部最优解的问题。提出了一种改进的基于特征点云的配准方法。首先,利用Harris-3D算法提取膝关节三维模型的特征点云;利用光学跟踪系统(OTS)对锯骨对应区域的点云进行采集。然后,采用样本一致性初始对齐(SAC-IA)算法对两个点云进行粗配准;采用ICP算法使配准矩阵收敛到最优解。利用k-d树寻找邻近点,加快迭代过程。最后对该配准方法进行了仿真,验证了该方法的可行性。以膝关节股骨模型为对象,进行膝关节手术导航配准精度实验。结果表明,该配准算法的误差为2.12mm, ICP配准算法的误差为6.30mm,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信