MARS: Model-agnostic Biased Object Removal without Additional Supervision for Weakly-Supervised Semantic Segmentation

• URL: http://arxiv.org/abs/2304.09913v1
• Date: Wed, 19 Apr 2023 18:24:28 GMT
• Title: MARS: Model-agnostic Biased Object Removal without Additional Supervision for Weakly-Supervised Semantic Segmentation
• Abstract summary: Weakly-supervised semantic segmentation aims to reduce labeling costs by training semantic segmentation models using weak supervision. We propose a fully-automatic/model-agnostic biased object removal framework called MARS. We show that MARS consistently improves the performance of various WSSS models by at least 30% without additional supervision.
• Score: 3.997707534484444
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Weakly-supervised semantic segmentation aims to reduce labeling costs by training semantic segmentation models using weak supervision, such as image-level class labels. However, most approaches struggle to produce accurate localization maps and suffer from false predictions in class-related backgrounds (i.e., biased objects), such as detecting a railroad with the train class. Recent methods that remove biased objects require additional supervision for manually identifying biased objects for each problematic class and collecting their datasets by reviewing predictions, limiting their applicability to the real-world dataset with multiple labels and complex relationships for biasing. Following the first observation that biased features can be separated and eliminated by matching biased objects with backgrounds in the same dataset, we propose a fully-automatic/model-agnostic biased removal framework called MARS (Model-Agnostic biased object Removal without additional Supervision), which utilizes semantically consistent features of an unsupervised technique to eliminate biased objects in pseudo labels. Surprisingly, we show that MARS achieves new state-of-the-art results on two popular benchmarks, PASCAL VOC 2012 (val: 77.7%, test: 77.2%) and MS COCO 2014 (val: 49.4%), by consistently improving the performance of various WSSS models by at least 30% without additional supervision.

Related papers

• Dual-Branch Cross-Projection Debiasing through Diffusion-based Disentanglement [66.67463557274358]
  Foundation models trained on biased datasets often rely on spurious correlations between target labels and non-causal attributes.<n>We introduce Confidence-guided Concept Mining (CBCM) to identify reliable spurious attributes without attribute annotations.<n>We propose Dual-branch Cross-projection Debiasing (DCD), a prompt-tuning framework that separates target and spurious representations into two branches.
  arXiv  Detail & Related papers  (2026-06-23T05:28:47Z)
• Bias Leaves a Gradient Trail: Label-Free Bias Identification via Gradient Probes on Concept Decompositions [8.894428198928333]
  We present a bias-label-free, post-hoc method for identifying spurious concepts in frozen vision models.<n>On Colored MNIST and Waterbirds the method recovers concepts aligned with the known spurious cue.<n> suppressing the top-ranked concepts at inference time improves worst-group accuracy by up to 17.9 percentage points.
  arXiv  Detail & Related papers  (2026-05-27T17:39:10Z)
• Towards Fairness under Label Bias in Image Segmentation: Impact, Measurement and Mitigation [10.15221228043609]
  Labeled datasets reflect the biases of their annotation pipelines, which sometimes introduce label bias.<n>We present a data-centric adaptation of Confident Learning to segmentation, allowing detection of label bias directly in the training data.<n>We show how our framework reliably detects and mitigates bias without access to clean labels, achieving equitable performance across experimental conditions.
  arXiv  Detail & Related papers  (2026-05-07T19:47:50Z)
• Classifier-to-Bias: Toward Unsupervised Automatic Bias Detection for Visual Classifiers [25.909153114646692]
  Existing approaches for bias identification rely on datasets containing labels for the task of interest. We present-to-Bias (C2B), the first bias discovery framework that works without access to any labeled data. C2B is training-free, does not require any annotations, has no constraints on the list of biases, and can be applied to any pre-trained model on any classification task.
  arXiv  Detail & Related papers  (2025-04-29T16:19:38Z)
• Object-Focused Data Selection for Dense Prediction Tasks [38.062117168168264]
  We consider the challenge of selecting a representative subset of images for labeling under a constrained annotation budget. We propose object-focused data selection (OFDS) which leverages object-level representations to ensure that the selected image subsets semantically cover the target classes.
  arXiv  Detail & Related papers  (2024-12-13T10:47:05Z)
• TrajSSL: Trajectory-Enhanced Semi-Supervised 3D Object Detection [59.498894868956306]
  Pseudo-labeling approaches to semi-supervised learning adopt a teacher-student framework. We leverage pre-trained motion-forecasting models to generate object trajectories on pseudo-labeled data. Our approach improves pseudo-label quality in two distinct manners.
  arXiv  Detail & Related papers  (2024-09-17T05:35:00Z)
• Multi-clue Consistency Learning to Bridge Gaps Between General and Oriented Object in Semi-supervised Detection [26.486535389258965]
  We experimentally find three gaps between general and oriented object detection in semi-supervised learning. We propose a Multi-clue Consistency Learning (MCL) framework to bridge these gaps. Our proposed MCL can achieve state-of-the-art performance in the semi-supervised oriented object detection task.
  arXiv  Detail & Related papers  (2024-07-08T13:14:25Z)
• Memory Consistency Guided Divide-and-Conquer Learning for Generalized Category Discovery [56.172872410834664]
  Generalized category discovery (GCD) aims at addressing a more realistic and challenging setting of semi-supervised learning. We propose a Memory Consistency guided Divide-and-conquer Learning framework (MCDL) Our method outperforms state-of-the-art models by a large margin on both seen and unseen classes of the generic image recognition.
  arXiv  Detail & Related papers  (2024-01-24T09:39:45Z)
• Learning Confident Classifiers in the Presence of Label Noise [5.829762367794509]
  This paper proposes a probabilistic model for noisy observations that allows us to build a confident classification and segmentation models. Our experiments show that our algorithm outperforms state-of-the-art solutions for the considered classification and segmentation problems.
  arXiv  Detail & Related papers  (2023-01-02T04:27:25Z)
• Resolving Semantic Confusions for Improved Zero-Shot Detection [6.72910827751713]
  We propose a generative model incorporating a triplet loss that acknowledges the degree of dissimilarity between classes. A cyclic-consistency loss is also enforced to ensure that generated visual samples of a class highly correspond to their own semantics.
  arXiv  Detail & Related papers  (2022-12-12T18:11:48Z)
• Adversarial Dual-Student with Differentiable Spatial Warping for Semi-Supervised Semantic Segmentation [70.2166826794421]
  We propose a differentiable geometric warping to conduct unsupervised data augmentation. We also propose a novel adversarial dual-student framework to improve the Mean-Teacher. Our solution significantly improves the performance and state-of-the-art results are achieved on both datasets.
  arXiv  Detail & Related papers  (2022-03-05T17:36:17Z)
• Debiased Learning from Naturally Imbalanced Pseudo-Labels for Zero-Shot and Semi-Supervised Learning [27.770473405635585]
  This work studies the bias issue of pseudo-labeling, a natural phenomenon that widely occurs but often overlooked by prior research. We observe heavy long-tailed pseudo-labels when a semi-supervised learning model FixMatch predicts labels on the unlabeled set even though the unlabeled data is curated to be balanced. Without intervention, the training model inherits the bias from the pseudo-labels and end up being sub-optimal.
  arXiv  Detail & Related papers  (2022-01-05T07:40:24Z)
• General Greedy De-bias Learning [163.65789778416172]
  We propose a General Greedy De-bias learning framework (GGD), which greedily trains the biased models and the base model like gradient descent in functional space. GGD can learn a more robust base model under the settings of both task-specific biased models with prior knowledge and self-ensemble biased model without prior knowledge.
  arXiv  Detail & Related papers  (2021-12-20T14:47:32Z)
• Semi-Automatic Data Annotation guided by Feature Space Projection [117.9296191012968]
  We present a semi-automatic data annotation approach based on suitable feature space projection and semi-supervised label estimation. We validate our method on the popular MNIST dataset and on images of human intestinal parasites with and without fecal impurities. Our results demonstrate the added-value of visual analytics tools that combine complementary abilities of humans and machines for more effective machine learning.
  arXiv  Detail & Related papers  (2020-07-27T17:03:50Z)
• Joint Visual and Temporal Consistency for Unsupervised Domain Adaptive Person Re-Identification [64.37745443119942]
  This paper jointly enforces visual and temporal consistency in the combination of a local one-hot classification and a global multi-class classification. Experimental results on three large-scale ReID datasets demonstrate the superiority of proposed method in both unsupervised and unsupervised domain adaptive ReID tasks.
  arXiv  Detail & Related papers  (2020-07-21T14:31:27Z)

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.