Mining of Single-Class by Active Learning for Semantic Segmentation

Hugues Lambert, Emma Slade
7/18/2023
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

Several Active Learning (AL) policies require retraining a target model several times in order to identify the most informative samples and rarely offer the option to focus on the acquisition of samples from underrepresented classes. Here the Mining of Single-Class by Active Learning (MiSiCAL) paradigm is introduced where an AL policy is constructed through deep reinforcement learning and exploits quantity-accuracy correlations to build datasets on which high-performance models can be trained with regards to specific classes. MiSiCAL is especially helpful in the case of very large batch sizes since it does not require repeated model training sessions as is common in other AL methods. This is thanks to its ability to exploit fixed representations of the candidate data points. We find that MiSiCAL is able to outperform a random policy on 150 out of 171 COCO10k classes, while the strongest baseline only outperforms random on 101 classes.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lambert2023mining,
  title  = {Mining of Single-Class by Active Learning for Semantic Segmentation},
  author = {Hugues Lambert and Emma Slade},
  year   = {2023},
  eprint = {2307.09109},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.09109v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.09109.svg)](https://codeofpaper.com/paper/2307.09109)

Discussion