ELDA: Using Edges to Have an Edge on Semantic Segmentation Based UDA

• URL: http://arxiv.org/abs/2211.08888v1
• Date: Wed, 16 Nov 2022 12:49:33 GMT
• Title: ELDA: Using Edges to Have an Edge on Semantic Segmentation Based UDA
• Authors: Ting-Hsuan Liao, Huang-Ru Liao, Shan-Ya Yang, Jie-En Yao, Li-Yuan Tsao, Hsu-Shen Liu, Bo-Wun Cheng, Chen-Hao Chao, Chia-Che Chang, Yi-Chen Lo and Chun-Yi Lee
• Abstract summary: We introduce Edge Learning based Domain Adaptation (ELDA), a framework which incorporates edge information into its training process to serve as a type of domain invariant information. We show that ELDA is able to better separate the feature distributions of different classes.
• Score: 11.985940818257786
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many unsupervised domain adaptation (UDA) methods have been proposed to bridge the domain gap by utilizing domain invariant information. Most approaches have chosen depth as such information and achieved remarkable success. Despite their effectiveness, using depth as domain invariant information in UDA tasks may lead to multiple issues, such as excessively high extraction costs and difficulties in achieving a reliable prediction quality. As a result, we introduce Edge Learning based Domain Adaptation (ELDA), a framework which incorporates edge information into its training process to serve as a type of domain invariant information. In our experiments, we quantitatively and qualitatively demonstrate that the incorporation of edge information is indeed beneficial and effective and enables ELDA to outperform the contemporary state-of-the-art methods on two commonly adopted benchmarks for semantic segmentation based UDA tasks. In addition, we show that ELDA is able to better separate the feature distributions of different classes. We further provide an ablation analysis to justify our design decisions.

Related papers

• Enhancing Domain Adaptation through Prompt Gradient Alignment [16.618313165111793]
  We develop a line of works based on prompt learning to learn both domain-invariant and specific features. We cast UDA as a multiple-objective optimization problem in which each objective is represented by a domain loss. Our method consistently surpasses other prompt-based baselines by a large margin on different UDA benchmarks.
  arXiv  Detail & Related papers  (2024-06-13T17:40:15Z)
• ActiveAD: Planning-Oriented Active Learning for End-to-End Autonomous Driving [96.92499034935466]
  End-to-end differentiable learning for autonomous driving has recently become a prominent paradigm. One main bottleneck lies in its voracious appetite for high-quality labeled data. We propose a planning-oriented active learning method which progressively annotates part of collected raw data.
  arXiv  Detail & Related papers  (2024-03-05T11:39:07Z)
• Open-Set Domain Adaptation with Visual-Language Foundation Models [51.49854335102149]
  Unsupervised domain adaptation (UDA) has proven to be very effective in transferring knowledge from a source domain to a target domain with unlabeled data. Open-set domain adaptation (ODA) has emerged as a potential solution to identify these classes during the training phase.
  arXiv  Detail & Related papers  (2023-07-30T11:38:46Z)
• AVATAR: Adversarial self-superVised domain Adaptation network for TARget domain [11.764601181046496]
  This paper presents an unsupervised domain adaptation (UDA) method for predicting unlabeled target domain data. We propose the Adversarial self-superVised domain Adaptation network for the TARget domain (AVATAR) algorithm. Our proposed model significantly outperforms state-of-the-art methods on three UDA benchmarks.
  arXiv  Detail & Related papers  (2023-04-28T20:31:56Z)
• Deep Unsupervised Domain Adaptation: A Review of Recent Advances and Perspectives [16.68091981866261]
  Unsupervised domain adaptation (UDA) is proposed to counter the performance drop on data in a target domain. UDA has yielded promising results on natural image processing, video analysis, natural language processing, time-series data analysis, medical image analysis, etc.
  arXiv  Detail & Related papers  (2022-08-15T20:05:07Z)
• Learning Feature Decomposition for Domain Adaptive Monocular Depth Estimation [51.15061013818216]
  Supervised approaches have led to great success with the advance of deep learning, but they rely on large quantities of ground-truth depth annotations. Unsupervised domain adaptation (UDA) transfers knowledge from labeled source data to unlabeled target data, so as to relax the constraint of supervised learning. We propose a novel UDA method for MDE, referred to as Learning Feature Decomposition for Adaptation (LFDA), which learns to decompose the feature space into content and style components.
  arXiv  Detail & Related papers  (2022-07-30T08:05:35Z)
• UMAD: Universal Model Adaptation under Domain and Category Shift [138.12678159620248]
  Universal Model ADaptation (UMAD) framework handles both UDA scenarios without access to source data. We develop an informative consistency score to help distinguish unknown samples from known samples. Experiments on open-set and open-partial-set UDA scenarios demonstrate that UMAD exhibits comparable, if not superior, performance to state-of-the-art data-dependent methods.
  arXiv  Detail & Related papers  (2021-12-16T01:22:59Z)
• Effective Label Propagation for Discriminative Semi-Supervised Domain Adaptation [76.41664929948607]
  Semi-supervised domain adaptation (SSDA) methods have demonstrated great potential in large-scale image classification tasks. We present a novel and effective method to tackle this problem by using effective inter-domain and intra-domain semantic information propagation. Our source code and pre-trained models will be released soon.
  arXiv  Detail & Related papers  (2020-12-04T14:28:19Z)
• Multi-source Domain Adaptation in the Deep Learning Era: A Systematic Survey [53.656086832255944]
  Multi-source domain adaptation (MDA) is a powerful extension in which the labeled data may be collected from multiple sources. MDA has attracted increasing attention in both academia and industry.
  arXiv  Detail & Related papers  (2020-02-26T08:07:58Z)

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.