TY - JOUR
T1 - Vesselformer
T2 - 6th International Conference on Medical Imaging with Deep Learning, MIDL 2023
AU - Prabhakar, Chinmay
AU - Shit, Suprosanna
AU - Paetzold, Johannes C.
AU - Ezhov, Ivan
AU - Koner, Rajat
AU - Kofler, Florian Sebastian
AU - Li, Hongwei Bran
AU - Menze, Bjoern H.
N1 - Publisher Copyright:
© 2023 CC-BY 4.0, C. Prabhakar, S. Shit, J.C. Paetzold, I. Ezhov, R. Koner, F.S. Kofler, H.B. Li & B.H. Menze.
PY - 2023
Y1 - 2023
N2 - The reconstruction of graph representations from images (Image-to-Graph) is a frequent task, especially in the case of vessel graph extraction from biomedical images. Traditionally, this problem is tackled by a two-stage process: segmentation followed by skeletonization. However, the ambiguity in the heuristic-based pruning of the centerline graph from the skeleta makes it hard to achieve a compact yet faithful graph representation. Recently, Relationformer proposed an end-to-end solution to extract graphs directly from images. However, it does not consider edge features, particularly radius information, which is crucial in many applications such as flow simulation. Furthermore, Relationformer predicts only patch-based graphs. In this work, we address these two shortcomings. We propose a task-specific token, namely radius-token, which explicitly focuses on capturing radius information between two nodes. Second, we propose an efficient algorithm to infer a large 3D graph from patch inference. Finally, we show experimental results on a synthetic vessel dataset and achieve the first 3D complete graph prediction. Code is available at https://github.com/chinmay5/vesselformer.
AB - The reconstruction of graph representations from images (Image-to-Graph) is a frequent task, especially in the case of vessel graph extraction from biomedical images. Traditionally, this problem is tackled by a two-stage process: segmentation followed by skeletonization. However, the ambiguity in the heuristic-based pruning of the centerline graph from the skeleta makes it hard to achieve a compact yet faithful graph representation. Recently, Relationformer proposed an end-to-end solution to extract graphs directly from images. However, it does not consider edge features, particularly radius information, which is crucial in many applications such as flow simulation. Furthermore, Relationformer predicts only patch-based graphs. In this work, we address these two shortcomings. We propose a task-specific token, namely radius-token, which explicitly focuses on capturing radius information between two nodes. Second, we propose an efficient algorithm to infer a large 3D graph from patch inference. Finally, we show experimental results on a synthetic vessel dataset and achieve the first 3D complete graph prediction. Code is available at https://github.com/chinmay5/vesselformer.
KW - Radius Prediction
KW - Transformer
KW - Vessels Graph Generation
UR - http://www.scopus.com/inward/record.url?scp=85189286275&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85189286275
SN - 2640-3498
VL - 227
SP - 320
EP - 331
JO - Proceedings of Machine Learning Research
JF - Proceedings of Machine Learning Research
Y2 - 10 July 2023 through 12 July 2023
ER -