Interactive segmentation using U-Net with weight map and dynamic user interactions
Not on the map. Why?
Abstract (arXiv)
Interactive segmentation has recently attracted attention for specialized tasks where expert input is required to further enhance the segmentation performance. In this work, we propose a novel interactive segmentation framework, where user clicks are dynamically adapted in size based on the current segmentation mask. The clicked regions form a weight map and are fed to a deep neural network as a novel weighted loss function. To evaluate our loss function, an interactive U-Net (IU-Net) model which applies both foreground and background user clicks as the main method of interaction is employed. We train and validate on the BCV dataset, while testing on spleen and colon cancer CT images from the MSD dataset to improve the overall segmentation accuracy in comparison to the standard U-Net using our weighted loss function. Applying dynamic user click sizes increases the overall accuracy by 5.60% and 10.39% respectively by utilizing only a single user interaction.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 8 references that are in the map. First posted on arXiv 18 Nov 2021.
Builds on
7 of 8 references.
References · 7
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2019A large annotated medical image dataset for the development and evaluation of segmentation algorithmscited by 371
- 2018A Novel Focal Tversky loss function with improved Attention U-Net for lesion segmentationcited by 171
- 2017DeepIGeoS: A Deep Interactive Geodesic Framework for Medical Image Segmentationcited by 110
- 2017Interactive Medical Image Segmentation using Deep Learning with Image-specific Fine-tuningcited by 110
- 2019Interactive segmentation of medical images through fully convolutional neural networkscited by 29
- 2018Multiclass Weighted Loss for Instance Segmentation of Cluttered Cellscited by 10
Built on by
Citing papers per year: 2023: 2.
2 papers.