Weakly-Supervised Cross-Domain Segmentation of Electron Microscopy with Sparse Point Annotation

• URL: http://arxiv.org/abs/2404.00667v1
• Date: Sun, 31 Mar 2024 12:22:23 GMT
• Title: Weakly-Supervised Cross-Domain Segmentation of Electron Microscopy with Sparse Point Annotation
• Authors: Dafei Qiu, Shan Xiong, Jiajin Yi, Jialin Peng,
• Abstract summary: We introduce a multitask learning framework to leverage correlations among the counting, detection, and segmentation tasks. We develop a cross-position cut-and-paste for label augmentation and an entropy-based pseudo-label selection. The proposed model is capable of significantly outperforming UDA methods and produces comparable performance as the supervised counterpart.
• Score: 1.124958340749622
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurate segmentation of organelle instances from electron microscopy (EM) images plays an essential role in many neuroscience researches. However, practical scenarios usually suffer from high annotation costs, label scarcity, and large domain diversity. While unsupervised domain adaptation (UDA) that assumes no annotation effort on the target data is promising to alleviate these challenges, its performance on complicated segmentation tasks is still far from practical usage. To address these issues, we investigate a highly annotation-efficient weak supervision, which assumes only sparse center-points on a small subset of object instances in the target training images. To achieve accurate segmentation with partial point annotations, we introduce instance counting and center detection as auxiliary tasks and design a multitask learning framework to leverage correlations among the counting, detection, and segmentation, which are all tasks with partial or no supervision. Building upon the different domain-invariances of the three tasks, we enforce counting estimation with a novel soft consistency loss as a global prior for center detection, which further guides the per-pixel segmentation. To further compensate for annotation sparsity, we develop a cross-position cut-and-paste for label augmentation and an entropy-based pseudo-label selection. The experimental results highlight that, by simply using extremely weak annotation, e.g., 15\% sparse points, for model training, the proposed model is capable of significantly outperforming UDA methods and produces comparable performance as the supervised counterpart. The high robustness of our model shown in the validations and the low requirement of expert knowledge for sparse point annotation further improve the potential application value of our model.

Related papers

• Better Sampling, towards Better End-to-end Small Object Detection [7.7473020808686694]
  Small object detection remains unsatisfactory due to limited characteristics and high density and mutual overlap. We propose methods enhancing sampling within an end-to-end framework. Our model demonstrates a significant enhancement, achieving a 2.9% increase in average precision (AP) over the state-of-the-art (SOTA) on the VisDrone dataset.
  arXiv  Detail & Related papers  (2024-05-17T04:37:44Z)
• Few-Shot Learning for Annotation-Efficient Nucleus Instance Segmentation [50.407071700154674]
  We propose to formulate annotation-efficient nucleus instance segmentation from the perspective of few-shot learning (FSL) Our work was motivated by that, with the prosperity of computational pathology, an increasing number of fully-annotated datasets are publicly accessible. Extensive experiments on a couple of publicly accessible datasets demonstrate that SGFSIS can outperform other annotation-efficient learning baselines.
  arXiv  Detail & Related papers  (2024-02-26T03:49:18Z)
• Small Object Detection via Coarse-to-fine Proposal Generation and Imitation Learning [52.06176253457522]
  We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning. CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
  arXiv  Detail & Related papers  (2023-08-18T13:13:09Z)
• Few-Shot Point Cloud Semantic Segmentation via Contrastive Self-Supervision and Multi-Resolution Attention [6.350163959194903]
  We propose a contrastive self-supervision framework for few-shot learning pretrain. Specifically, we implement a novel contrastive learning approach with a learnable augmentor for a 3D point cloud. We develop a multi-resolution attention module using both the nearest and farthest points to extract the local and global point information more effectively.
  arXiv  Detail & Related papers  (2023-02-21T07:59:31Z)
• Domain Adaptive Segmentation of Electron Microscopy with Sparse Point Annotations [2.5137859989323537]
  We develop a highly annotation-efficient approach with competitive performance. We focus on weakly-supervised domain adaptation (WDA) with a type of extremely sparse and weak annotation. We show that our model with only 15% point annotations can achieve comparable performance as supervised models.
  arXiv  Detail & Related papers  (2022-10-24T10:50:37Z)
• Active Pointly-Supervised Instance Segmentation [106.38955769817747]
  We present an economic active learning setting, named active pointly-supervised instance segmentation (APIS) APIS starts with box-level annotations and iteratively samples a point within the box and asks if it falls on the object. The model developed with these strategies yields consistent performance gain on the challenging MS-COCO dataset.
  arXiv  Detail & Related papers  (2022-07-23T11:25:24Z)
• WSSOD: A New Pipeline for Weakly- and Semi-Supervised Object Detection [75.80075054706079]
  We propose a weakly- and semi-supervised object detection framework (WSSOD) An agent detector is first trained on a joint dataset and then used to predict pseudo bounding boxes on weakly-annotated images. The proposed framework demonstrates remarkable performance on PASCAL-VOC and MSCOCO benchmark, achieving a high performance comparable to those obtained in fully-supervised settings.
  arXiv  Detail & Related papers  (2021-05-21T11:58:50Z)
• Towards Robust Partially Supervised Multi-Structure Medical Image Segmentation on Small-Scale Data [123.03252888189546]
  We propose Vicinal Labels Under Uncertainty (VLUU) to bridge the methodological gaps in partially supervised learning (PSL) under data scarcity. Motivated by multi-task learning and vicinal risk minimization, VLUU transforms the partially supervised problem into a fully supervised problem by generating vicinal labels. Our research suggests a new research direction in label-efficient deep learning with partial supervision.
  arXiv  Detail & Related papers  (2020-11-28T16:31:00Z)
• A Weakly-Supervised Semantic Segmentation Approach based on the Centroid Loss: Application to Quality Control and Inspection [6.101839518775968]
  We propose and assess a new weakly-supervised semantic segmentation approach making use of a novel loss function. The performance of the approach is evaluated against datasets from two different industry-related case studies.
  arXiv  Detail & Related papers  (2020-10-26T09:08:21Z)
• Weakly Supervised Deep Nuclei Segmentation Using Partial Points Annotation in Histopathology Images [51.893494939675314]
  We propose a novel weakly supervised segmentation framework based on partial points annotation. We show that our method can achieve competitive performance compared to the fully supervised counterpart and the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-07-10T15:41:29Z)
• Adversarial-Prediction Guided Multi-task Adaptation for Semantic Segmentation of Electron Microscopy Images [5.027571997864707]
  We introduce an adversarial-prediction guided multi-task network to learn the adaptation of a well-trained model for use on a novel unlabeled target domain. Since no label is available on target domain, we learn an encoding representation not only for the supervised segmentation on source domain but also for unsupervised reconstruction of the target data.
  arXiv  Detail & Related papers  (2020-04-05T09:18:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.