Towards Novel Target Discovery Through Open-Set Domain Adaptation

• URL: http://arxiv.org/abs/2105.02432v1
• Date: Thu, 6 May 2021 04:22:29 GMT
• Title: Towards Novel Target Discovery Through Open-Set Domain Adaptation
• Authors: Taotao Jing, Hong Liu, Zhengming Ding
• Abstract summary: Open-set domain adaptation (OSDA) considers that the target domain contains samples from novel categories unobserved in external source domain. We propose a novel framework to accurately identify the seen categories in target domain, and effectively recover the semantic attributes for unseen categories.
• Score: 73.81537683043206
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Open-set domain adaptation (OSDA) considers that the target domain contains samples from novel categories unobserved in external source domain. Unfortunately, existing OSDA methods always ignore the demand for the information of unseen categories and simply recognize them as "unknown" set without further explanation. This motivates us to understand the unknown categories more specifically by exploring the underlying structures and recovering their interpretable semantic attributes. In this paper, we propose a novel framework to accurately identify the seen categories in target domain, and effectively recover the semantic attributes for unseen categories. Specifically, structure preserving partial alignment is developed to recognize the seen categories through domain-invariant feature learning. Attribute propagation over visual graph is designed to smoothly transit attributes from seen to unseen categories via visual-semantic mapping. Moreover, two new cross-main benchmarks are constructed to evaluate the proposed framework in the novel and practical challenge. Experimental results on open-set recognition and semantic recovery demonstrate the superiority of the proposed method over other compared baselines.

Related papers

• Robust Saliency-Aware Distillation for Few-shot Fine-grained Visual Recognition [57.08108545219043]
  Recognizing novel sub-categories with scarce samples is an essential and challenging research topic in computer vision. Existing literature addresses this challenge by employing local-based representation approaches. This article proposes a novel model, Robust Saliency-aware Distillation (RSaD), for few-shot fine-grained visual recognition.
  arXiv  Detail & Related papers  (2023-05-12T00:13:17Z)
• Zero-Knowledge Zero-Shot Learning for Novel Visual Category Discovery [20.37459249095808]
  We propose a new problem setting named Zero-Knowledge Zero-Shot Learning (ZK-ZSL) ZK-ZSL assumes no prior knowledge of novel classes and aims to classify seen and unseen samples. We show that our method's superior performance in classification and semantic recovery on four benchmark datasets.
  arXiv  Detail & Related papers  (2023-02-09T03:40:50Z)
• Open Set Domain Recognition via Attention-Based GCN and Semantic Matching Optimization [8.831857715361624]
  This work presents an end-to-end model based on attention-based GCN and semantic matching optimization. Experimental results validate that the proposed model not only has superiority on recognizing the images of known and unknown classes, but also can adapt to various openness of the target domain.
  arXiv  Detail & Related papers  (2021-05-11T12:05:36Z)
• MeGA-CDA: Memory Guided Attention for Category-Aware Unsupervised Domain Adaptive Object Detection [80.24165350584502]
  We propose Memory Guided Attention for Category-Aware Domain Adaptation. The proposed method consists of employing category-wise discriminators to ensure category-aware feature alignment. The method is evaluated on several benchmark datasets and is shown to outperform existing approaches.
  arXiv  Detail & Related papers  (2021-03-07T01:08:21Z)
• Adversarial Dual Distinct Classifiers for Unsupervised Domain Adaptation [67.83872616307008]
  Unversarial Domain adaptation (UDA) attempts to recognize the unlabeled target samples by building a learning model from a differently-distributed labeled source domain. In this paper, we propose a novel Adrial Dual Distincts Network (AD$2$CN) to align the source and target domain data distribution simultaneously with matching task-specific category boundaries. To be specific, a domain-invariant feature generator is exploited to embed the source and target data into a latent common space with the guidance of discriminative cross-domain alignment.
  arXiv  Detail & Related papers  (2020-08-27T01:29:10Z)
• Domain Adaptive Semantic Segmentation Using Weak Labels [115.16029641181669]
  We propose a novel framework for domain adaptation in semantic segmentation with image-level weak labels in the target domain. We develop a weak-label classification module to enforce the network to attend to certain categories. In experiments, we show considerable improvements with respect to the existing state-of-the-arts in UDA and present a new benchmark in the WDA setting.
  arXiv  Detail & Related papers  (2020-07-30T01:33:57Z)
• Exploring Category-Agnostic Clusters for Open-Set Domain Adaptation [138.29273453811945]
  We present Self-Ensembling with Category-agnostic Clusters (SE-CC) -- a novel architecture that steers domain adaptation with category-agnostic clusters in target domain. clustering is performed over all the unlabeled target samples to obtain the category-agnostic clusters, which reveal the underlying data space structure peculiar to target domain.
  arXiv  Detail & Related papers  (2020-06-11T16:19:02Z)

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.