mlsanityData to 7 Oct 2026

BEDS: Bagging ensemble deep segmentation for nucleus segmentation with testing stage stain augmentation

arXiv 2102.08990 ↗First posted 17 Feb 2021cs.CV cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Reducing outcome variance is an essential task in deep learning based medical image analysis. Bootstrap aggregating, also known as bagging, is a canonical ensemble algorithm for aggregating weak learners to become a strong learner. Random forest is one of the most powerful machine learning algorithms before deep learning era, whose superior performance is driven by fitting bagged decision trees (weak learners). Inspired by the random forest technique, we propose a simple bagging ensemble deep segmentation (BEDs) method to train multiple U-Nets with partial training data to segment dense nuclei on pathological images. The contributions of this study are three-fold: (1) developing a self-ensemble learning framework for nucleus segmentation; (2) aggregating testing stage augmentation with self-ensemble learning; and (3) elucidating the idea that self-ensemble and testing stage stain augmentation are complementary strategies for a superior segmentation performance. Implementation Detail: https://github.com/xingli1102/BEDs.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 6 of its 11 references that are in the map. First posted on arXiv 17 Feb 2021.

Builds on

6 of 11 references.

References · 6

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  3. 2016Image-to-Image Translation with Conditional Adversarial Networkscited by 4,510
  4. 2018No New-Netcited by 61
  5. 2017Ensembles of Multiple Models and Architectures for Robust Brain Tumour Segmentationcited by 58
  6. 2020Dataset of Segmented Nuclei in Hematoxylin and Eosin Stained Histopathology Images of 10 Cancer Typescited by 16

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 2.

3 papers.