SurgT challenge: Benchmark of soft-tissue trackers for robotic surgery

人工智能 计算机科学 深度学习 水准点(测量) BitTorrent跟踪器 分割 基本事实 标杆管理 跳跃式监视 公制(单位) 计算机视觉 机器学习 眼动 运营管理 大地测量学 营销 经济 业务 地理
作者
João Cartucho,Alistair Weld,Samyakh Tukra,Haozheng Xu,Hiroyuki Matsuzaki,Taiyo Ishikawa,Minjun Kwon,Yong Eun Jang,Kwang-Ju Kim,Gwang Lee,Bizhe Bai,Lüder A. Kahrs,Lars Boecking,Simeon Allmendinger,Leopold Müller,Yitong Zhang,Yueming Jin,Sophia Bano,Francisco Vasconcelos,Wolfgang Reiter,Jonas Hajek,Bruno Silva,Estêvão Lima,João L. Vilaça,Sandro Queirós,Stamatia Giannarou
出处
期刊:Medical Image Analysis [Elsevier]
卷期号:91: 102985-102985 被引量:2
标识
DOI:10.1016/j.media.2023.102985
摘要

This paper introduces the “SurgT: Surgical Tracking” challenge which was organised in conjunction with the 25th International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI 2022). There were two purposes for the creation of this challenge: (1) the establishment of the first standardised benchmark for the research community to assess soft-tissue trackers; and (2) to encourage the development of unsupervised deep learning methods, given the lack of annotated data in surgery. A dataset of 157 stereo endoscopic videos from 20 clinical cases, along with stereo camera calibration parameters, have been provided. Participants were assigned the task of developing algorithms to track the movement of soft tissues, represented by bounding boxes, in stereo endoscopic videos. At the end of the challenge, the developed methods were assessed on a previously hidden test subset. This assessment uses benchmarking metrics that were purposely developed for this challenge, to verify the efficacy of unsupervised deep learning algorithms in tracking soft-tissue. The metric used for ranking the methods was the Expected Average Overlap (EAO) score, which measures the average overlap between a tracker’s and the ground truth bounding boxes. Coming first in the challenge was the deep learning submission by ICVS-2Ai with a superior EAO score of 0.617. This method employs ARFlow to estimate unsupervised dense optical flow from cropped images, using photometric and regularization losses. Second, Jmees with an EAO of 0.583, uses deep learning for surgical tool segmentation on top of a non-deep learning baseline method: CSRT. CSRT by itself scores a similar EAO of 0.563. The results from this challenge show that currently, non-deep learning methods are still competitive. The dataset and benchmarking tool created for this challenge have been made publicly available at https://surgt.grand-challenge.org/. This challenge is expected to contribute to the development of autonomous robotic surgery and other digital surgical technologies.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
2秒前
秋雪瑶应助直率天亦采纳,获得10
3秒前
3秒前
5秒前
清脆断秋完成签到 ,获得积分10
5秒前
5秒前
摇槐米发布了新的文献求助10
5秒前
cctv18应助lwzx采纳,获得10
5秒前
5秒前
烟雨江南完成签到,获得积分10
6秒前
7秒前
7秒前
朴素的山灵完成签到,获得积分20
7秒前
唠叨的翠萱完成签到 ,获得积分10
9秒前
SHAM完成签到,获得积分10
9秒前
爆米花应助石文采纳,获得10
10秒前
个性的紫菜应助小破网采纳,获得20
10秒前
11秒前
CWNU_HAN应助rainsy采纳,获得30
11秒前
shinysparrow举报水论文行者求助涉嫌违规
11秒前
双马尾小男生2完成签到,获得积分10
12秒前
等待醉波完成签到,获得积分10
12秒前
12秒前
发生了什么树完成签到,获得积分10
12秒前
Lucas应助巨石朵拉采纳,获得10
12秒前
13秒前
从容乌发布了新的文献求助10
14秒前
无限问薇发布了新的文献求助10
17秒前
17秒前
ao发布了新的文献求助20
17秒前
19秒前
ll发布了新的文献求助10
19秒前
一一发布了新的文献求助30
20秒前
摇槐米完成签到,获得积分10
21秒前
21秒前
xuxiaoxu完成签到,获得积分20
22秒前
23秒前
lurenjia009发布了新的文献求助10
24秒前
27秒前
高分求助中
The three stars each : the Astrolabes and related texts 1070
Manual of Clinical Microbiology, 4 Volume Set (ASM Books) 13th Edition 1000
Sport in der Antike 800
De arte gymnastica. The art of gymnastics 600
少脉山油柑叶的化学成分研究 530
Sport in der Antike Hardcover – March 1, 2015 500
Boris Pesce - Gli impiegati della Fiat dal 1955 al 1999 un percorso nella memoria 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2405486
求助须知:如何正确求助?哪些是违规求助? 2103696
关于积分的说明 5309706
捐赠科研通 1831232
什么是DOI,文献DOI怎么找? 912415
版权声明 560646
科研通“疑难数据库(出版商)”最低求助积分说明 487794