一种用于完善机器人辅助手术 MIS 图像中推定匹配特征的快速稳健方法

IF 3.4 Q2 ENGINEERING, BIOMEDICAL
Muhammad Reza Pourshahabi;M. Omair Ahmad;M. N. S. Swamy
{"title":"一种用于完善机器人辅助手术 MIS 图像中推定匹配特征的快速稳健方法","authors":"Muhammad Reza Pourshahabi;M. Omair Ahmad;M. N. S. Swamy","doi":"10.1109/TMRB.2024.3369769","DOIUrl":null,"url":null,"abstract":"Robotic-assisted minimally invasive surgery (MIS) has a very important place in the landscape of modern surgical practices. Simultaneous localization and mapping (SLAM), 3D visualization, augmented reality, image registration and mosaicking are some of the image processing operations, which are often feature-based, used in robotic-assisted surgery. Feature matching refinement (FMR) is a crucial task in such operations. FMR is more critical, in cases where the percentage of true matches is very low, which is generally the case for MIS images. Since real-time is a requisite of MIS tasks, an FMR scheme must be very fast. In this paper we propose a very fast and accurate FMR scheme. The main idea used in developing the proposed scheme is on deciding the size of a local neighborhood and on devising a mechanism for checking feature topology preservation in the local neighborhood. To assess the effectiveness of the proposed scheme, we compare its performance with that of several state-of-the-art methods on different MIS image datasets, which shows its superiority in terms of both the processing time and performance.","PeriodicalId":73318,"journal":{"name":"IEEE transactions on medical robotics and bionics","volume":null,"pages":null},"PeriodicalIF":3.4000,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Very Fast and Robust Method for Refinement of Putative Matches of Features in MIS Images for Robotic-Assisted Surgery\",\"authors\":\"Muhammad Reza Pourshahabi;M. Omair Ahmad;M. N. S. Swamy\",\"doi\":\"10.1109/TMRB.2024.3369769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Robotic-assisted minimally invasive surgery (MIS) has a very important place in the landscape of modern surgical practices. Simultaneous localization and mapping (SLAM), 3D visualization, augmented reality, image registration and mosaicking are some of the image processing operations, which are often feature-based, used in robotic-assisted surgery. Feature matching refinement (FMR) is a crucial task in such operations. FMR is more critical, in cases where the percentage of true matches is very low, which is generally the case for MIS images. Since real-time is a requisite of MIS tasks, an FMR scheme must be very fast. In this paper we propose a very fast and accurate FMR scheme. The main idea used in developing the proposed scheme is on deciding the size of a local neighborhood and on devising a mechanism for checking feature topology preservation in the local neighborhood. To assess the effectiveness of the proposed scheme, we compare its performance with that of several state-of-the-art methods on different MIS image datasets, which shows its superiority in terms of both the processing time and performance.\",\"PeriodicalId\":73318,\"journal\":{\"name\":\"IEEE transactions on medical robotics and bionics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on medical robotics and bionics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10445304/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, BIOMEDICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on medical robotics and bionics","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10445304/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, BIOMEDICAL","Score":null,"Total":0}
引用次数: 0

摘要

机器人辅助微创手术(MIS)在现代外科手术中占有非常重要的地位。同时定位和绘图(SLAM)、三维可视化、增强现实、图像注册和镶嵌是机器人辅助手术中使用的一些图像处理操作,这些操作通常基于特征。特征匹配细化(FMR)是此类操作中的一项关键任务。在真实匹配率非常低的情况下,FMR 就显得更为重要,而 MIS 图像通常就是这种情况。由于实时性是 MIS 任务的必要条件,因此 FMR 方案必须非常快速。在本文中,我们提出了一种非常快速和准确的 FMR 方案。开发该方案的主要思路是决定局部邻域的大小,并设计一种机制来检查局部邻域中特征拓扑结构的保持情况。为了评估所提方案的有效性,我们在不同的 MIS 图像数据集上比较了该方案与几种最先进方法的性能,结果显示该方案在处理时间和性能方面都更胜一筹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Very Fast and Robust Method for Refinement of Putative Matches of Features in MIS Images for Robotic-Assisted Surgery
Robotic-assisted minimally invasive surgery (MIS) has a very important place in the landscape of modern surgical practices. Simultaneous localization and mapping (SLAM), 3D visualization, augmented reality, image registration and mosaicking are some of the image processing operations, which are often feature-based, used in robotic-assisted surgery. Feature matching refinement (FMR) is a crucial task in such operations. FMR is more critical, in cases where the percentage of true matches is very low, which is generally the case for MIS images. Since real-time is a requisite of MIS tasks, an FMR scheme must be very fast. In this paper we propose a very fast and accurate FMR scheme. The main idea used in developing the proposed scheme is on deciding the size of a local neighborhood and on devising a mechanism for checking feature topology preservation in the local neighborhood. To assess the effectiveness of the proposed scheme, we compare its performance with that of several state-of-the-art methods on different MIS image datasets, which shows its superiority in terms of both the processing time and performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.80
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信