• Home
  • Search
  • Modeling Sequential Domain Shift through Estimation of Optimal Sub-spaces for Categorization
  • Open Access IconOpen Access
  • Cite Icon3
  • https://doi.org/10.5244/c.28.103Copy DOI Icon

Modeling Sequential Domain Shift through Estimation of Optimal Sub-spaces for Categorization

  • Jan 1, 2014
  • Suranjana Samanta +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Domain adaptation (DA) is the process in which labeled training samples available from one domain is used to improve the performance of statistical tasks performed on test samples drawn from a different domain. The domain from which the training samples are obtained is termed as the source domain, and the counterpart consisting of the test samples is termed as the target domain. Few unlabeled training samples are also taken from the target domain in order to approximate its distribution. In this paper, we propose a new method of unsupervised DA, where a set of domain invariant sub-spaces are estimated using the geometrical and statistical properties of the source and target domains. This is a modification of the work done by Gopalan et al. [2], where the geodesic path from the principal components of the source to that of the target is considered in the Grassmann manifold, and the intermediary points are sampled to represent the incremental change in the geometric properties of the data in source and target domains. Instead of the geodesic path, we consider an alternate path of shortest length between the principal components of source and target, with the property that the intermediary sample points on the path form domain invariant sub-spaces using the concept of Maximum Mean Discrepancy (MMD) [3]. Thus we model the change in the geometric properties of data in both the domains sequentially, in a manner such that the distributions of projected data from both the domains always remain similar along the path. The entire formulation is done in the kernel space which makes it more robust to non-linear transformations. Let X and Y be the source and target domains having nX and nY number of instances respectively. If Φ(.) is a universal kernel function, then in kernel space the source and target domains are Φ(X) ∈ RnX×d and Φ(Y ) ∈ RnX×d respectively. Let KXX and KYY be the kernel gram matrices of Φ(X) and Φ(Y ) respectively. Let D = [X ;Y ] denote the combined source and target domain data, and the corresponding data in kernel space is given as Φ(D). The kernel gram matrix formed using D is given by

Similar Papers
  • Book Chapter
  • Citations8

Domain Adaptation for Eye Segmentation

  • Jan 01, 2020
  • Yiru Shen +2
  • Research Article
  • Citations37

Unsupervised Adversarial Domain Adaptation Network for Semantic Segmentation

  • Dec 26, 2019
  • IEEE Geoscience and Remote Sensing Letters
  • Wei Liu +1
  • Research Article
  • Citations294

Unsupervised Domain Adaptation for Face Anti-Spoofing

  • Jul 01, 2018
  • IEEE Transactions on Information Forensics and Security
  • Haoliang Li +5
  • Research Article
  • Citations16

Overcoming learning bias via Prototypical Feature Compensation for source-free domain adaptation

  • Sep 17, 2024
  • Pattern Recognition
  • Zicheng Pan +3
  • Research Article
  • Citations7

Unsupervised Domain Expansion for Visual Categorization

  • Nov 12, 2021
  • ACM Transactions on Multimedia Computing, Communications, and Applications
  • Jie Wang +4
  • Research Article
  • Citations31

Improving the Transferability of Deep Learning Models for Crop Yield Prediction: A Partial Domain Adaptation Approach

  • Sep 16, 2023
  • Remote Sensing
  • Yuchi Ma +3
  • Conference Article
  • Citations692

Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptation

  • Jul 01, 2017
  • Hongliang Yan +5
  • Research Article
  • Citations4

Bi-adapting kernel learning for unsupervised domain adaptation

  • Jul 27, 2019
  • Neurocomputing
  • Zengmao Wang +4
  • Research Article
  • Citations45

Universal multi-Source domain adaptation for image classification

  • Aug 14, 2021
  • Pattern Recognition
  • Yueming Yin +3
  • Research Article
  • Citations6

Cross-Domain Urban Land Use Classification via Scenewise Unsupervised Multisource Domain Adaptation With Transformer

  • Jan 01, 2024
  • IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
  • Mengmeng Li +3
  • Research Article
  • Citations51

A MultiKernel Domain Adaptation Method for Unsupervised Transfer Learning on Cross-Source and Cross-Region Remote Sensing Data Classification

  • Jan 17, 2020
  • IEEE Transactions on Geoscience and Remote Sensing
  • Wei Liu +1
  • PDF
  • Research Article
  • Citations16

Unsupervised Black-Box Model Domain Adaptation for Brain Tumor Segmentation.

  • Jun 02, 2022
  • Frontiers in neuroscience
  • Xiaofeng Liu +6
  • Research Article

Improving Unsupervised Domain Adaptation via Multiple Adversarial Learning

  • Oct 01, 2023
  • 電腦學刊
  • Yu-Dong Cao Yu-Dong Cao +2
  • Research Article
  • Citations8

Discovering and incorporating latent target-domains for domain adaptation

  • Jul 02, 2020
  • Pattern Recognition
  • Haoliang Li +2
  • Research Article
  • Citations52

Deep Asymmetric Transfer Network for Unbalanced Domain Adaptation

  • Apr 25, 2018
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Daixin Wang +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.