Abstract
The Kidney and Kidney Tumor Segmentation Challenge 2021 (KiTS21) released a kidney CT dataset with 300 patients. Unlike KiTS19, KiTS21 provided a cyst category. Therefore, the segmentation of kidneys, tumors, and cysts will be able to assess the complexity and aggressiveness of kidney mass. Deep learning models can save medical resources, but 3D models still have some disadvantages, such as the high cost of computing resources. This paper proposes a scheme that saves computing resources and achieves the segmentation of kidney mass in two steps. First, we preprocess the kidney volume data using the automatic down-sampling method of 3D images, reducing the volume while preserving the feature information. Second, we finely segment kidneys, tumors, and cysts using the AgDenseU-Net (Attention gate DenseU-Net) 2.5D model. KiTS21 proposed using Hierarchical Evaluation Classes (HECs) to compute a metric for the superset: the HEC of kidney considers kidneys, tumors, and cysts as the foreground to compute segmentation performance; the HEC of kidney mass considers both tumor and cyst as the foreground classes; the HEC of tumor considers tumor as the foreground only. For KiTS21, our model achieved a dice score of 0.971 for the kidney, 0.883 for the mass, and 0.815 for the tumor. In addition, we also tested segmentation results without HECs, and our model achieved a dice score of 0.950 for the kidney, 0.878 for the tumor, and 0.746 for the cyst. The results demonstrate that the method proposed in this paper can be used as a reference for kidney tumor segmentation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.