Extracting complex structures from grid-based data is a common key step in automated medical image analysis. The conventional solution to recovering tree-structured geometries typically involves computing the minimal cost path through intermediate representations derived from segmentation masks. However, this methodology has significant limitations in the context of projective imaging of tree-structured 3D anatomical data such as coronary arteries, since there are often overlapping branches in the 2D projection. In this work, we propose a novel approach to predicting tree connectivity structure which reformulates the task as an optimization problem over individual steps of a recursive process. We design and train a two-stage model which leverages the UNet and Transformer architectures and introduces an image-based prompting technique. Our proposed method achieves compelling results on a pair of synthetic datasets, and outperforms a shortest-path baseline.
翻译:从基于网格的数据中提取复杂的结构是自动医学图像分析的一个常见的关键步骤。恢复树木结构的地形的常规解决办法通常涉及通过从隔段面面罩中提取的中间显示器计算最低成本路径。然而,这一方法在诸如冠心动脉等树结构3D解剖学数据的投影成像方面有很大的局限性,因为2D投影中往往有重叠的分支。在这项工作中,我们提出了一种新的预测树连接结构的方法,将这项任务重新定位为对循环过程各个步骤的优化问题。我们设计并培训了两阶段模型,利用UNet和变形器结构,并引入了基于图像的促动技术。我们提出的方法在合成数据集组合上取得了令人信服的结果,并超越了一条最短路径的基线。