arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.09796eess.IVcs.CV

基于多项式特征合成的医学图像分割通用拓扑细化方法

Universal Topology Refinement for Medical Image Segmentation with Polynomial Feature Synthesis

Imperial College London(帝国理工学院);University of Oxford(牛津大学);Klinikum rechts der Isar, Technical University of Munich(慕尼黑工业大学右侧医院);Friedrich-Alexander-Universität Erlangen-Nürnberg(埃尔朗根-纽伦堡弗里德里希-亚历山大大学)

Liu Li, Hanchun Wang, Matthew Baugh, Qiang Ma, Weitong Zhang, Cheng Ouyang, Daniel Rueckert, Bernhard Kainz

AI总结:

针对医学图像分割拓扑正确性不足的问题,提出基于正交多项式基合成拓扑扰动掩码的通用即插即用拓扑细化方法,兼容多种分割流水线,性能优于现有同类方法且可提升现有模型表现。

摘要:

尽管现有医学图像分割方法已实现出色的像素级精度,但它们往往忽略拓扑正确性,导致分割结果无法用于许多下游任务。一种解决方案是在重训练模型时加入拓扑驱动的损失项,但该方法计算成本高,通常不具备实用性。更优的方案是设计一种通用的即插即用拓扑细化方法,能够兼容任意特定领域的分割流水线。直接训练后处理模型来修正拓扑错误通常效果不佳,因为这类模型容易偏向目标分割网络的特定拓扑错误模式,且错误的多样性受限于标注训练集提供的信息,这在小数据集场景下问题尤为突出。\n我们的方法通过训练模型无关的拓扑细化网络解决了这一问题,训练中使用覆盖多种拓扑错误的合成分割数据。受Stone-Weierstrass定理启发,我们通过随机采样正交多项式基的系数来合成拓扑扰动掩码,确保了错误表示的完整性与无偏性。实验中,我们验证了该方法可兼容多种多项式基族,兼具效率与有效性;结果表明,我们的通用即插即用拓扑细化网络性能优于现有的拓扑驱动学习方法和后处理方法。我们还证实,将该方法与基于学习的模型结合可作为简易的附加模块,进一步提升现有方法的性能。

英文摘要:

Although existing medical image segmentation methods provide impressive pixel-wise accuracy, they often neglect topological correctness, making their segmentations unusable for many downstream tasks. One option is to retrain such models whilst including a topology-driven loss component. However, this is computationally expensive and often impractical. A better solution would be to have a versatile plug-and-play topology refinement method that is compatible with any domain-specific segmentation pipeline. Directly training a post-processing model to mitigate topological errors often fails as such models tend to be biased towards the topological errors of a target segmentation network. The diversity of these errors is confined to the information provided by a labelled training set, which is especially problematic for small datasets. Our method solves this problem by training a model-agnostic topology refinement network with synthetic segmentations that cover a wide variety of topological errors. Inspired by the Stone-Weierstrass theorem, we synthesize topology-perturbation masks with randomly sampled coefficients of orthogonal polynomial bases, which ensures a complete and unbiased representation. Practically, we verified the efficiency and effectiveness of our methods as being compatible with multiple families of polynomial bases, and show evidence that our universal plug-and-play topology refinement network outperforms both existing topology-driven learning-based and post-processing methods. We also show that combining our method with learning-based models provides an effortless add-on, which can further improve the performance of existing approaches.

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

↑