Papers › H-DenseUNet: Hybrid Densely Connected UNet for Liver and Tumor Segmentation from CT Volumes
H-DenseUNet: Hybrid Densely Connected UNet for Liver and Tumor Segmentation from CT Volumes
Xiaomeng Li, Hao Chen, Xiaojuan Qi, Qi Dou, Chi-Wing Fu, Pheng Ann Heng
Liver cancer is one of the leading causes of cancer death. To assist doctors in hepatocellular carcinoma diagnosis and treatment planning, an accurate and automatic liver and tumor segmentation method is highly demanded in the clinical practice. Recently, fully convolutional neural networks (FCNs), including 2D and 3D FCNs, serve as the back-bone in many volumetric image segmentation. However, 2D convolutions can not fully leverage the spatial information along the third dimension while 3D convolutions suffer from high computational cost and GPU memory consumption. To address these issues, we propose a novel hybrid densely connected UNet (H-DenseUNet), which consists of a 2D DenseUNet for efficiently extracting intra-slice features and a 3D counterpart for hierarchically aggregating volumetric contexts under the spirit of the auto-context algorithm for liver and tumor segmentation. We formulate the learning process of H-DenseUNet in an end-to-end manner, where the intra-slice representations and inter-slice features can be jointly optimized through a hybrid feature fusion (HFF) layer. We extensively evaluated our method on the dataset of MICCAI 2017 Liver Tumor Segmentation (LiTS) Challenge and 3DIRCADb Dataset. Our method outperformed other state-of-the-arts on the segmentation results of tumors and achieved very competitive performance for liver segmentation even with a single model.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Lesion Segmentation | Anatomical Tracings of Lesions After Stroke (ATLAS) | 2D Dense-UNet | Dice | 0.4741 | #2 of 5 | Archive leaderboard | report |
| Lesion Segmentation | Anatomical Tracings of Lesions After Stroke (ATLAS) | 2D Dense-UNet | IoU | 0.3559 | #2 of 5 | Archive leaderboard | report |
| Lesion Segmentation | Anatomical Tracings of Lesions After Stroke (ATLAS) | 2D Dense-UNet | Precision | 0.5613 | #2 of 5 | Archive leaderboard | report |
| Lesion Segmentation | Anatomical Tracings of Lesions After Stroke (ATLAS) | 2D Dense-UNet | Recall | 0.4875 | #2 of 5 | Archive leaderboard | report |
| Liver Segmentation | LiTS2017 | H-DenseUnet Liver | Dice | 96.5 | #6 of 9 | Archive leaderboard | report |
| Liver Segmentation | LiTS2017 | H-DenseUnet Lession | Dice | 82.4 | #9 of 9 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections