Auxiliary Tasks Enhanced Dual-affinity Learning for Weakly Supervised
Semantic Segmentation
- URL: http://arxiv.org/abs/2403.01156v1
- Date: Sat, 2 Mar 2024 10:03:21 GMT
- Title: Auxiliary Tasks Enhanced Dual-affinity Learning for Weakly Supervised
Semantic Segmentation
- Authors: Lian Xu, Mohammed Bennamoun, Farid Boussaid, Wanli Ouyang, Ferdous
Sohel, Dan Xu
- Abstract summary: We propose AuxSegNet+, a weakly supervised auxiliary learning framework to explore the rich information from saliency maps.
We also propose a cross-task affinity learning mechanism to learn pixel-level affinities from the saliency and segmentation feature maps.
- Score: 79.05949524349005
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Most existing weakly supervised semantic segmentation (WSSS) methods rely on
Class Activation Mapping (CAM) to extract coarse class-specific localization
maps using image-level labels. Prior works have commonly used an off-line
heuristic thresholding process that combines the CAM maps with off-the-shelf
saliency maps produced by a general pre-trained saliency model to produce more
accurate pseudo-segmentation labels. We propose AuxSegNet+, a weakly supervised
auxiliary learning framework to explore the rich information from these
saliency maps and the significant inter-task correlation between saliency
detection and semantic segmentation. In the proposed AuxSegNet+, saliency
detection and multi-label image classification are used as auxiliary tasks to
improve the primary task of semantic segmentation with only image-level
ground-truth labels. We also propose a cross-task affinity learning mechanism
to learn pixel-level affinities from the saliency and segmentation feature
maps. In particular, we propose a cross-task dual-affinity learning module to
learn both pairwise and unary affinities, which are used to enhance the
task-specific features and predictions by aggregating both query-dependent and
query-independent global context for both saliency detection and semantic
segmentation. The learned cross-task pairwise affinity can also be used to
refine and propagate CAM maps to provide better pseudo labels for both tasks.
Iterative improvement of segmentation performance is enabled by cross-task
affinity learning and pseudo-label updating. Extensive experiments demonstrate
the effectiveness of the proposed approach with new state-of-the-art WSSS
results on the challenging PASCAL VOC and MS COCO benchmarks.
Related papers
- Enhancing Self-Supervised Learning for Remote Sensing with Elevation
Data: A Case Study with Scarce And High Level Semantic Labels [1.534667887016089]
This work proposes a hybrid unsupervised and supervised learning method to pre-train models applied in Earth observation downstream tasks.
We combine a contrastive approach to pre-train models with a pixel-wise regression pre-text task to predict coarse elevation maps.
arXiv Detail & Related papers (2023-04-13T23:01:11Z) - SLAM: Semantic Learning based Activation Map for Weakly Supervised
Semantic Segmentation [34.996841532954925]
We propose a novel semantic learning based framework for WSSS, named SLAM (Semantic Learning based Activation Map)
We firstly design a semantic encoder to learn semantics of each object category and extract category-specific semantic embeddings from an input image.
Four loss functions, i.e., category-foreground, category-background, activation regularization, and consistency loss are proposed to ensure the correctness, completeness, compactness and consistency of the activation map.
arXiv Detail & Related papers (2022-10-22T11:17:30Z) - Saliency Guided Inter- and Intra-Class Relation Constraints for Weakly
Supervised Semantic Segmentation [66.87777732230884]
We propose a saliency guided Inter- and Intra-Class Relation Constrained (I$2$CRC) framework to assist the expansion of the activated object regions.
We also introduce an object guided label refinement module to take a full use of both the segmentation prediction and the initial labels for obtaining superior pseudo-labels.
arXiv Detail & Related papers (2022-06-20T03:40:56Z) - Leveraging Auxiliary Tasks with Affinity Learning for Weakly Supervised
Semantic Segmentation [88.49669148290306]
We propose a novel weakly supervised multi-task framework called AuxSegNet to leverage saliency detection and multi-label image classification as auxiliary tasks.
Inspired by their similar structured semantics, we also propose to learn a cross-task global pixel-level affinity map from the saliency and segmentation representations.
The learned cross-task affinity can be used to refine saliency predictions and propagate CAM maps to provide improved pseudo labels for both tasks.
arXiv Detail & Related papers (2021-07-25T11:39:58Z) - Learning to Relate Depth and Semantics for Unsupervised Domain
Adaptation [87.1188556802942]
We present an approach for encoding visual task relationships to improve model performance in an Unsupervised Domain Adaptation (UDA) setting.
We propose a novel Cross-Task Relation Layer (CTRL), which encodes task dependencies between the semantic and depth predictions.
Furthermore, we propose an Iterative Self-Learning (ISL) training scheme, which exploits semantic pseudo-labels to provide extra supervision on the target domain.
arXiv Detail & Related papers (2021-05-17T13:42:09Z) - Mining Cross-Image Semantics for Weakly Supervised Semantic Segmentation [128.03739769844736]
Two neural co-attentions are incorporated into the classifier to capture cross-image semantic similarities and differences.
In addition to boosting object pattern learning, the co-attention can leverage context from other related images to improve localization map inference.
Our algorithm sets new state-of-the-arts on all these settings, demonstrating well its efficacy and generalizability.
arXiv Detail & Related papers (2020-07-03T21:53:46Z) - Weakly-Supervised Semantic Segmentation by Iterative Affinity Learning [86.45526827323954]
Weakly-supervised semantic segmentation is a challenging task as no pixel-wise label information is provided for training.
We propose an iterative algorithm to learn such pairwise relations.
We show that the proposed algorithm performs favorably against the state-of-the-art methods.
arXiv Detail & Related papers (2020-02-19T10:32:03Z)
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.