IVCVLGAug 6, 2021

Uncertainty-Based Dynamic Graph Neighborhoods For Medical Segmentation

arXiv:2108.03117v13 citations
Originality Incremental advance
AI Analysis

This work provides an incremental improvement for medical image analysis by enhancing segmentation accuracy in a specific domain.

The paper tackles the problem of refining medical image segmentation by addressing random edge assignment and independent training in graph-based post-processing, resulting in improved quantitative measures for pancreas segmentation from CT images.

In recent years, deep learning based methods have shown success in essential medical image analysis tasks such as segmentation. Post-processing and refining the results of segmentation is a common practice to decrease the misclassifications originating from the segmentation network. In addition to widely used methods like Conditional Random Fields (CRFs) which focus on the structure of the segmented volume/area, a graph-based recent approach makes use of certain and uncertain points in a graph and refines the segmentation according to a small graph convolutional network (GCN). However, there are two drawbacks of the approach: most of the edges in the graph are assigned randomly and the GCN is trained independently from the segmentation network. To address these issues, we define a new neighbor-selection mechanism according to feature distances and combine the two networks in the training procedure. According to the experimental results on pancreas segmentation from Computed Tomography (CT) images, we demonstrate improvement in the quantitative measures. Also, examining the dynamic neighbors created by our method, edges between semantically similar image parts are observed. The proposed method also shows qualitative enhancements in the segmentation maps, as demonstrated in the visual results.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes