Automatic Aorta Segmentation with Heavily Augmented, High-Resolution 3-D
ResUNet: Contribution to the SEG.A Challenge
- URL: http://arxiv.org/abs/2310.15827v1
- Date: Tue, 24 Oct 2023 13:28:46 GMT
- Title: Automatic Aorta Segmentation with Heavily Augmented, High-Resolution 3-D
ResUNet: Contribution to the SEG.A Challenge
- Authors: Marek Wodzinski and Henning M\"uller
- Abstract summary: This work presents a contribution by the MedGIFT team to the SEG.A challenge organized during the MICCAI 2023 conference.
We propose a fully automated algorithm based on deep encoder-decoder architecture.
We freely release the source code, pretrained model, and provide access to the algorithm on the Grand-Challenge platform.
- Score: 0.1633301148398433
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Automatic aorta segmentation from 3-D medical volumes is an important yet
difficult task. Several factors make the problem challenging, e.g. the
possibility of aortic dissection or the difficulty with segmenting and
annotating the small branches. This work presents a contribution by the MedGIFT
team to the SEG.A challenge organized during the MICCAI 2023 conference. We
propose a fully automated algorithm based on deep encoder-decoder architecture.
The main assumption behind our work is that data preprocessing and augmentation
are much more important than the deep architecture, especially in low data
regimes. Therefore, the solution is based on a variant of traditional
convolutional U-Net. The proposed solution achieved a Dice score above 0.9 for
all testing cases with the highest stability among all participants. The method
scored 1st, 4th, and 3rd in terms of the clinical evaluation, quantitative
results, and volumetric meshing quality, respectively. We freely release the
source code, pretrained model, and provide access to the algorithm on the
Grand-Challenge platform.
Related papers
- Multi-Class Segmentation of Aortic Branches and Zones in Computed Tomography Angiography: The AortaSeg24 Challenge [55.252714550918824]
AortaSeg24 MICCAI Challenge introduced the first dataset of 100 CTA volumes annotated for 23 clinically relevant aortic branches and zones.
This paper presents the challenge design, dataset details, evaluation metrics, and an in-depth analysis of the top-performing algorithms.
arXiv Detail & Related papers (2025-02-07T21:09:05Z) - Leveraging Frequency Domain Learning in 3D Vessel Segmentation [50.54833091336862]
In this study, we leverage Fourier domain learning as a substitute for multi-scale convolutional kernels in 3D hierarchical segmentation models.
We show that our novel network achieves remarkable dice performance (84.37% on ASACA500 and 80.32% on ImageCAS) in tubular vessel segmentation tasks.
arXiv Detail & Related papers (2024-01-11T19:07:58Z) - The Medical Segmentation Decathlon [37.44481677534694]
State-of-the-art image segmentation algorithms are mature, accurate, and generalize well when retrained on unseen tasks.
A consistent good performance on a set of tasks preserved their good average performance on a different set of previously unseen tasks.
The training of accurate AI segmentation models is now commoditized to non AI experts.
arXiv Detail & Related papers (2021-06-10T13:34:06Z) - Exploring Large Context for Cerebral Aneurysm Segmentation [11.684455292186046]
This paper briefly presents the main technique details of the aneurysm segmentation method in the MICCAI 2020 CADA challenge.
The main contribution is that we configure the 3D U-Net with a large patch size, which can obtain the large context.
Our method ranked second on the MICCAI 2020 CADA testing dataset with an average Jaccard of 0.7593.
arXiv Detail & Related papers (2020-12-30T12:51:43Z) - An Uncertainty-Driven GCN Refinement Strategy for Organ Segmentation [53.425900196763756]
We propose a segmentation refinement method based on uncertainty analysis and graph convolutional networks.
We employ the uncertainty levels of the convolutional network in a particular input volume to formulate a semi-supervised graph learning problem.
We show that our method outperforms the state-of-the-art CRF refinement method by improving the dice score by 1% for the pancreas and 2% for spleen.
arXiv Detail & Related papers (2020-12-06T18:55:07Z) - Volumetric Medical Image Segmentation: A 3D Deep Coarse-to-fine
Framework and Its Adversarial Examples [74.92488215859991]
We propose a novel 3D-based coarse-to-fine framework to efficiently tackle these challenges.
The proposed 3D-based framework outperforms their 2D counterparts by a large margin since it can leverage the rich spatial information along all three axes.
We conduct experiments on three datasets, the NIH pancreas dataset, the JHMI pancreas dataset and the JHMI pathological cyst dataset.
arXiv Detail & Related papers (2020-10-29T15:39:19Z) - AutoML Segmentation for 3D Medical Image Data: Contribution to the MSD
Challenge 2018 [2.9864637081333085]
A 3D convolutional neural network with encoder-decoder architecture was developed and is presented in this paper.
It works on anisotropic voxel-geometries and has anisotropic depth, i.e., the number of down steps is a task-specific parameter.
arXiv Detail & Related papers (2020-05-20T11:47:02Z) - Hybrid Attention for Automatic Segmentation of Whole Fetal Head in
Prenatal Ultrasound Volumes [52.53375964591765]
We propose the first fully-automated solution to segment the whole fetal head in US volumes.
The segmentation task is firstly formulated as an end-to-end volumetric mapping under an encoder-decoder deep architecture.
We then combine the segmentor with a proposed hybrid attention scheme (HAS) to select discriminative features and suppress the non-informative volumetric features.
arXiv Detail & Related papers (2020-04-28T14:43:05Z) - Robust Medical Instrument Segmentation Challenge 2019 [56.148440125599905]
Intraoperative tracking of laparoscopic instruments is often a prerequisite for computer and robotic-assisted interventions.
Our challenge was based on a surgical data set comprising 10,040 annotated images acquired from a total of 30 surgical procedures.
The results confirm the initial hypothesis, namely that algorithm performance degrades with an increasing domain gap.
arXiv Detail & Related papers (2020-03-23T14:35:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.