Domain-Adaptive Deep Joint Source-Channel Coding for Image Classification

• URL: http://arxiv.org/abs/2607.28907v1
• Date: Fri, 31 Jul 2026 00:11:16 GMT
• Title: Domain-Adaptive Deep Joint Source-Channel Coding for Image Classification
• Abstract summary: We study single-source domain adaptation for task-oriented Deep J SCC.<n>We propose a domain-adaptive framework that combines pseudo-label-based class-level adversarial alignment with supervised contrastive learning on confidence-filtered target samples.
• Score: 17.84601469865839
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep joint source--channel coding (Deep JSCC) enables visual semantic transmission by mapping inputs directly to channel symbols and task outputs, but its performance can deteriorate under distribution shifts between training and deployment domains. We study single-source domain adaptation for task-oriented Deep JSCC and formulate a classification-capacity-invariance (CCI) function to characterize how the available channel capacity and class-conditional cross-domain invariance affect target domain classification accuracy. A scalar linear analysis of source-domain-optimal solutions and a controlled shallow nonlinear validation show that target domain classification accuracy can vary non-monotonically with the invariance constraint and with available capacity along separate control paths obtained by varying the transmitted dimension or CSNR. We then propose a domain-adaptive Deep JSCC framework that combines pseudo-label-based class-level adversarial alignment with supervised contrastive learning on confidence-filtered target samples. Experiments on digit and PACS datasets over AWGN and Rayleigh fading channels demonstrate improved target domain generalization without introducing additional inference-time networks. On SVHN $\rightarrow$ MNIST, the proposed method achieves 98.15\% target-domain accuracy at a CSNR of 10 dB.

Related papers

• Adaptive Betweenness Clustering for Semi-Supervised Domain Adaptation [108.40945109477886]
  We propose a novel SSDA approach named Graph-based Adaptive Betweenness Clustering (G-ABC) for achieving categorical domain alignment. Our method outperforms previous state-of-the-art SSDA approaches, demonstrating the superiority of the proposed G-ABC algorithm.
  arXiv  Detail & Related papers  (2024-01-21T09:57:56Z)
• DARNet: Bridging Domain Gaps in Cross-Domain Few-Shot Segmentation with Dynamic Adaptation [20.979759016826378]
  Few-shot segmentation (FSS) aims to segment novel classes in a query image by using only a small number of supporting images from base classes. In cross-domain FSS, leveraging features from label-rich domains for resource-constrained domains poses challenges due to domain discrepancies. This work presents a Dynamically Adaptive Refine (DARNet) method that aims to balance generalization and specificity for CD-FSS.
  arXiv  Detail & Related papers  (2023-12-08T03:03:22Z)
• Bi-discriminator Domain Adversarial Neural Networks with Class-Level Gradient Alignment [87.8301166955305]
  We propose a novel bi-discriminator domain adversarial neural network with class-level gradient alignment. BACG resorts to gradient signals and second-order probability estimation for better alignment of domain distributions. In addition, inspired by contrastive learning, we develop a memory bank-based variant, i.e. Fast-BACG, which can greatly shorten the training process.
  arXiv  Detail & Related papers  (2023-10-21T09:53:17Z)
• Adaptive Semantic Consistency for Cross-domain Few-shot Classification [27.176106714652327]
  Cross-domain few-shot classification (CD-FSC) aims to identify novel target classes with a few samples. We propose a simple plug-and-play Adaptive Semantic Consistency framework, which improves cross-domain robustness. The proposed ASC enables explicit transfer of source domain knowledge to prevent the model from overfitting the target domain.
  arXiv  Detail & Related papers  (2023-08-01T15:37:19Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• Semi-supervised Domain Adaptive Structure Learning [72.01544419893628]
  Semi-supervised domain adaptation (SSDA) is a challenging problem requiring methods to overcome both 1) overfitting towards poorly annotated data and 2) distribution shift across domains. We introduce an adaptive structure learning method to regularize the cooperation of SSL and DA.
  arXiv  Detail & Related papers  (2021-12-12T06:11:16Z)
• TDACNN: Target-domain-free Domain Adaptation Convolutional Neural Network for Drift Compensation in Gas Sensors [6.451060076703026]
  In this paper, deep learning based on a target-domain-free domain adaptation convolutional neural network (TDACNN) is proposed. The main concept is that CNNs extract not only the domain-specific features of samples but also the domain-invariant features underlying both the source and target domains. Experiments on two datasets drift under different settings demonstrate the superiority of TDACNN compared with several state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-10-14T16:30:17Z)
• Coarse to Fine: Domain Adaptive Crowd Counting via Adversarial Scoring Network [58.05473757538834]
  This paper proposes a novel adversarial scoring network (ASNet) to bridge the gap across domains from coarse to fine granularity. Three sets of migration experiments show that the proposed methods achieve state-of-the-art counting performance.
  arXiv  Detail & Related papers  (2021-07-27T14:47:24Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation using Structurally Regularized Deep Clustering [119.88565565454378]
  Unsupervised domain adaptation (UDA) is to learn classification models that make predictions for unlabeled data on a target domain. We propose a hybrid model of Structurally Regularized Deep Clustering, which integrates the regularized discriminative clustering of target data with a generative one. Our proposed H-SRDC outperforms all the existing methods under both the inductive and transductive settings.
  arXiv  Detail & Related papers  (2020-12-08T08:52:00Z)

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.