mlsanityData to 7 Oct 2026

SemiCurv: Semi-Supervised Curvilinear Structure Segmentation

arXiv 2205.08706 ↗First posted 18 May 2022cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Recent work on curvilinear structure segmentation has mostly focused on backbone network design and loss engineering. The challenge of collecting labelled data, an expensive and labor intensive process, has been overlooked. While labelled data is expensive to obtain, unlabelled data is often readily available. In this work, we propose SemiCurv, a semi-supervised learning (SSL) framework for curvilinear structure segmentation that is able to utilize such unlabelled data to reduce the labelling burden. Our framework addresses two key challenges in formulating curvilinear segmentation in a semi-supervised manner. First, to fully exploit the power of consistency based SSL, we introduce a geometric transformation as strong data augmentation and then align segmentation predictions via a differentiable inverse transformation to enable the computation of pixel-wise consistency. Second, the traditional mean square error (MSE) on unlabelled data is prone to collapsed predictions and this issue exacerbates with severe class imbalance (significantly more background pixels). We propose a N-pair consistency loss to avoid trivial predictions on unlabelled data. We evaluate SemiCurv on six curvilinear segmentation datasets, and find that with no more than 5% of the labelled data, it achieves close to 95% of the performance relative to its fully supervised counterpart.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 25 of its 45 references that are in the map. First posted on arXiv 18 May 2022.

Builds on

25 of 45 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  5. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  6. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  7. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  8. 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
  9. 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
  10. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
  11. 2017Generalised Dice overlap as a deep learning loss function for highly unbalanced segmentationscited by 614
  12. 2015Holistically-Nested Edge Detectioncited by 590
13 more
  1. 2017Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning resultscited by 470
  2. 2020Semi-Supervised Semantic Segmentation with Cross-Consistency Trainingcited by 375
  3. 2018An Intriguing Failing of Convolutional Neural Networks and the CoordConv Solutioncited by 302
  4. 2015Semi-Supervised Learning with Ladder Networkscited by 246
  5. 2020ClassMix: Segmentation-Based Data Augmentation for Semi-Supervised Learningcited by 209
  6. 2019Topology-Preserving Deep Image Segmentationcited by 198
  7. 2018Adversarial Learning for Semi-Supervised Semantic Segmentationcited by 173
  8. 2019Transformation Consistent Self-ensembling Model for Semi-supervised Medical Image Segmentationcited by 138
  9. 2016Semi-Supervised Learning with Generative Adversarial Networkscited by 103
  10. 2017Beyond the Pixel-Wise Loss for Topology-Aware Delineationcited by 82
  11. 2019Feature Pyramid and Hierarchical Boosting Network for Pavement Crack Detectioncited by 80
  12. 2018Road Segmentation in SAR Satellite Images with Deep Fully-Convolutional Neural Networkscited by 12
  13. 2019Revisiting CycleGAN for semi-supervised segmentationcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 3; 2026: 1.

6 papers.