Deep LOGISMOS: Deep Learning Graph-based 3D Segmentation of Pancreatic Tumors on CT scans
Not on the map. Why?
Abstract (arXiv)
This paper reports Deep LOGISMOS approach to 3D tumor segmentation by incorporating boundary information derived from deep contextual learning to LOGISMOS - layered optimal graph image segmentation of multiple objects and surfaces. Accurate and reliable tumor segmentation is essential to tumor growth analysis and treatment selection. A fully convolutional network (FCN), UNet, is first trained using three adjacent 2D patches centered at the tumor, providing contextual UNet segmentation and probability map for each 2D patch. The UNet segmentation is then refined by Gaussian Mixture Model (GMM) and morphological operations. The refined UNet segmentation is used to provide the initial shape boundary to build a segmentation graph. The cost for each node of the graph is determined by the UNet probability maps. Finally, a max-flow algorithm is employed to find the globally optimal solution thus obtaining the final segmentation. For evaluation, we applied the method to pancreatic tumor segmentation on a dataset of 51 CT scans, among which 30 scans were used for training and 21 for testing. With Deep LOGISMOS, DICE Similarity Coefficient (DSC) and Relative Volume Difference (RVD) reached 83.2+-7.8% and 18.6+-17.4% respectively, both are significantly improved (p<0.05) compared with contextual UNet and/or LOGISMOS alone.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Jan 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1; 2026: 1.
5 papers.
- 2021Act Like a Radiologist: Towards Reliable Multi-view Correspondence Reasoning for Mammogram Mass Detectioncited by 22
- 2022Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Visioncited by 2
- 2025A Dual-Task Synergy-Driven Generalization Framework for Pancreatic Cancer Segmentation in CT Scanscited by 2
- 2023Neural Network Reconstruction of the Left Atrium using Sparse Catheter Pathscited by 0
- 2026Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithmcited by 0
- 2026Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm13 May 2026
- 2025A Dual-Task Synergy-Driven Generalization Framework for Pancreatic Cancer Segmentation in CT Scans3 May 2025
- 2023Neural Network Reconstruction of the Left Atrium using Sparse Catheter Paths4 Nov 2023
- 2022Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision1 Feb 2022
- 2021Act Like a Radiologist: Towards Reliable Multi-view Correspondence Reasoning for Mammogram Mass Detection21 May 2021