paper-with-me

Papers

Towards Fewer Annotations: Active Learning via Region Impurity and Prediction Uncertainty for Domain Adaptive Semantic Segmentation

2021-11-25 · CVPR 2022 1 · Binhui Xie, Longhui Yuan, Shuang Li, Chi Harold Liu, Xinjing Cheng

Self-training has greatly facilitated domain adaptive semantic segmentation, which iteratively generates pseudo labels on unlabeled target data and retrains the network. However, realistic segmentation datasets are highly imbalanced, pseudo labels are typically biased to the majority classes and basically noisy, leading to an error-prone and suboptimal model. In this paper, we propose a simple region-based active learning approach for semantic segmentation under a domain shift, aiming to automatically query a small partition of image regions to be labeled while maximizing segmentation performance. Our algorithm, Region Impurity and Prediction Uncertainty (RIPU), introduces a new acquisition strategy characterizing the spatial adjacency of image regions along with the prediction confidence. We show that the proposed region-based selection strategy makes more efficient use of a limited budget than image-based or point-based counterparts. Further, we enforce local prediction consistency between a pixel and its nearest neighbors on a source image. Alongside, we develop a negative learning loss to make the features more discriminative. Extensive experiments demonstrate that our method only requires very few annotations to almost reach the supervised performance and substantially outperforms state-of-the-art methods. The code is available at https://github.com/BIT-DA/RIPU.

📄 PDF Abstract BibTeX arXiv:2111.12940

Code (1)

bit-da/ripu 공식 구현 pytorch

Tasks

Active LearningPredictionRepresentation LearningSegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

Data Uncertainty without Prediction Models

2022-04-25 · Bongjoon Park, Eunkyung Koh

Data acquisition processes for machine learning are often costly. To construct a high-performance prediction model with fewer data, a degree of difficulty in prediction is often deployed as the acquisition function in ad…

Active LearningPrediction

Permutation Decision Trees

2023-06-05 · Harikrishnan N B, Arham Jain, Nithin Nagaraj

Decision Tree is a well understood Machine Learning model that is based on minimizing impurities in the internal nodes. The most common impurity measures are Shannon entropy and Gini impurity. These impurity measures are…

feature selection

Decomposition Sampling for Efficient Region Annotations in Active Learning

2025-12-08 · Jingna Qiu, Frauke Wilm, Mathias Öttl, Jonas Utz 외 arxiv

Active learning improves annotation efficiency by selecting the most informative samples for annotation and model training. While most prior work has focused on selecting informative images for classification tasks, we i…

Active Learning

Asymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees

2019-04-29 · David Zimmermann

We investigate how asymmetrizing an impurity function affects the choice of optimal node splits when growing a decision tree for binary classification. In particular, we relax the usual axioms of an impurity function and…

Binary ClassificationGeneral Classification

cRedAnno+: Annotation Exploitation in Self-Explanatory Lung Nodule Diagnosis

2022-10-28 · Jiahao Lu, CHONG YIN, Kenny Erleben, Michael Bachmann Nielsen 외

Recently, attempts have been made to reduce annotation requirements in feature-based self-explanatory models for lung nodule diagnosis. As a representative, cRedAnno achieves competitive performance with considerably red…

Active LearningAttributeContrastive Learning