arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.05735eess.IVcs.CVcs.LG
收藏

医疗细分十项全能

The Medical Segmentation Decathlon

King’s College London(伦敦国王学院);German Cancer Research Center (DKFZ)(德国癌症研究中心);University of Heidelberg(海德堡大学);University of Pennsylvania(宾夕法尼亚大学);National Cancer Institute(美国国家癌症研究所);Vanderbilt University(范德堡大学);Radboud University Medical Center(拉德堡德大学医学中心);University of Zurich(苏黎世大学);DeepMind(深度思维)
Michela Antonelli, Annika Reinke, Spyridon Bakas, Keyvan Farahani, AnnetteKopp-Schneider, Bennett A. Landman, Geert Litjens, Bjoern Menze, Olaf Ronneberger, Ron… 展开作者

Michela Antonelli, Annika Reinke, Spyridon Bakas, Keyvan Farahani, AnnetteKopp-Schneider, Bennett A. Landman, Geert Litjens, Bjoern Menze, Olaf Ronneberger, Ronald M. Summers, Bram van Ginneken, Michel Bilello, Patrick Bilic, Patrick F. Christ, Richard K. G. Do, Marc J. Gollub, Stephan H. Heckers, Henkjan Huisman, William R. Jarnagin, Maureen K. McHugo, Sandy Napel, Jennifer S. Goli Pernicka, Kawal Rhode, Catalina Tobon-Gomez, Eugene Vorontsov, Henkjan Huisman, James A. Meakin, Sebastien Ourselin, Manuel Wiesenfarth, Pablo Arbelaez, Byeonguk Bae, Sihong Chen, Laura Daza, Jianjiang Feng, Baochun He, Fabian Isensee, Yuanfeng Ji, Fucang Jia, Namkug Kim, Ildoo Kim, Dorit Merhof, Akshay Pai, Beomhee Park, Mathias Perslev, Ramin Rezaiifar, Oliver Rippel, Ignacio Sarasua, Wei Shen, Jaemin Son, Christian Wachinger, Liansheng Wang, Yan Wang, Yingda Xia, Daguang Xu, Zhanwei Xu, Yefeng Zheng, Amber L. Simpson, Lena Maier-Hein, M. Jorge Cardoso

摘要:

国际挑战赛已经成为对特定任务的图像分析算法进行比较评估的事实标准。分割是迄今为止研究最广泛的医学图像处理任务,但是各种分割挑战通常被孤立地组织,使得算法开发由解决单个特定临床问题的需要驱动。我们假设,一种能够在多个任务上表现良好的方法将很好地推广到以前看不见的任务,并可能优于定制设计的解决方案。为了研究这一假设,我们组织了医学分割十项全能(MSD)-生物医学图像分析挑战,其中算法在众多任务和模式中竞争。基础数据集旨在探索处理医学图像时通常遇到的困难,例如小数据集,不平衡标签,多站点数据和小对象。MSD挑战证实,在一组任务上具有一致良好性能的算法在一组不同的先前未见过的任务上保持了良好的平均性能。此外,通过对MSD获奖者进行两年的监测,我们发现该算法继续很好地推广到广泛的其他临床问题,进一步证实了我们的假设。从这项研究中可以得出三个主要结论:(1)最先进的图像分割算法是成熟的,准确的,并且在对看不见的任务进行重新训练时具有很好的泛化能力;(2)多个任务之间一致的算法性能是算法泛化能力的强有力替代;(3)准确的AI分割模型的训练现在已经商品化为非AI专家。

英文摘要:

International challenges have become the de facto standard for comparative assessment of image analysis algorithms given a specific task. Segmentation is so far the most widely investigated medical image processing task, but the various segmentation challenges have typically been organized in isolation, such that algorithm development was driven by the need to tackle a single specific clinical problem. We hypothesized that a method capable of performing well on multiple tasks will generalize well to a previously unseen task and potentially outperform a custom-designed solution. To investigate the hypothesis, we organized the Medical Segmentation Decathlon (MSD) - a biomedical image analysis challenge, in which algorithms compete in a multitude of both tasks and modalities. The underlying data set was designed to explore the axis of difficulties typically encountered when dealing with medical images, such as small data sets, unbalanced labels, multi-site data and small objects. The MSD challenge confirmed that algorithms with a consistent good performance on a set of tasks preserved their good average performance on a different set of previously unseen tasks. Moreover, by monitoring the MSD winner for two years, we found that this algorithm continued generalizing well to a wide range of other clinical problems, further confirming our hypothesis. Three main conclusions can be drawn from this study: (1) state-of-the-art image segmentation algorithms are mature, accurate, and generalize well when retrained on unseen tasks; (2) consistent algorithmic performance across multiple tasks is a strong surrogate of algorithmic generalizability; (3) the training of accurate AI segmentation models is now commoditized to non AI experts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑