Aug 2026· Neural Networks· Vol 205 Pt B, pp.
109523
· 0 citations· 47 references
Medicine
TL;DR
This work proposes a novel Granular Envelope Contrastive Learning (GECL) method that explicitly models intra-class variations by generating multiple granular envelopes for each class, and jointly reduces domain discrepancy and enhances feature discriminability.
Abstract
Unsupervised domain adaptation (UDA) seeks to transfer knowledge from labeled source data to an unlabeled target domain under distribution shifts. Existing class-aware UDA approaches alleviate negative transfer by leveraging label information. However, they often overlook intra-class diversity and concept shift, limiting their ability to capture fine-grained semantic structures. In this work, we propose a novel Granular Envelope Contrastive Learning (GECL) method that explicitly models intra-class variations by generating multiple granular envelopes for each class. Firstly, a granular envelope generation mechanism is introduced that recursively partitions the feature space based on a local purity criterion. These envelopes act as refined class prototypes, enabling more accurate characterization of class distributions. Secondly, a sample-to-envelope contrastive learning objective is designed to enhance discriminative feature representation. Thirdly, an envelope-guided consistency regularization strategy is employed to enhance the semantic consistency between model predictions and envelope structures. By incorporating these components into an envelope-aware optimization framework, the proposed method jointly reduces domain discrepancy and enhances feature discriminability. Extensive experiments on multiple benchmarks show that our approach achieves state-of-the-art performance across diverse domain shift scenarios, especially under large-scale or high-divergence settings.
Unsupervised Domain Adaptation for Semantic Segmentation (UDA-SS) has seen significant progress in recent years. Existing UDA-SS approaches mostly adopt a pseudo-labeling schema to adapt model in the target domain, but they often overlook the inherent long-tailed data distribution in segmentation. We find that such sca...
Yi-Bo Wang, Rui-Kang Xu, Guang-Cheng Zhu et al.· Proceedings of the Thirty-Fi...· 0 citations
Domain Generalization Semantic Segmentation (DGSS) focuses on generalizing knowledge from labeled source domains to unseen target domains where data is unavailable during the training phase. While conventional methods utilize style randomization or feature normalization to mitigate domain shifts, they often impair feat...
Jin-Hong Zhu, Weiqi Yan, Sheng-Chuan Zhang et al.· 0 citations
This work introduces an optimal transport-based online clustering mechanism to automatically discover latent coarse-grained and fine-grained semantic priors without external supervision and introduces a cross-granularity alignment module that enforces consistency between these discovered latent structures and the targe...
Efficient Unsupervised Domain Adaptation (EUDA) is proposed, a parameter-efficient framework that leverages a frozen DINOv2 backbone as a feature extractor and updates only a lightweight bottleneck and classification head to promote both discriminative learning and cross-domain alignment.
Ali Abedi, Q. M. Jonathan Wu, Ning Zhang et al.· International Journal of Mac...· 9 citations
This paper proposes ADA-CS, a plug-and-play module compatible with any ADA or ASFDA framework, and introduces a CSS metric to quantify the Concept Shift Severity across domains, revealing that non-negligible concept shift exists in many transfer tasks.
Generalized Category Discovery aims to recognize known categories while identifying novel ones within unlabeled data. Existing methods, typically based on self-supervision and contrastive learning, often struggle to capture fine-grained distinctions, relying on superficial visual cues rather than the intrinsic attribut...
Sarah Rastegar, Mina Ghadimi Atigh, Pascal Mettes et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.