Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Cross-Domain Recognition by Identifying Joint Subspaces of Source Domain and Target Domain

Journal Article · · IEEE Transactions on Cybernetics
 [1];  [2];  [3];  [1];  [4];  [5];  [1]
  1. Univ. of South Carolina, Columbia, SC (United States). Dept. of Computer Science and Engineering
  2. Chongqing Univ. (China)
  3. IBM Almaden Research Center, San Jose, CA (United States); Univ. of South Carolina, Columbia, SC (United States)
  4. Univ. of Houston, TX (United States)
  5. Univ. of Macau (China)
This paper introduces here a new method to solve the cross-domain recognition problem. Different from the traditional domain adaption methods which rely on a global domain shift for all classes between the source and target domains, the proposed method is more flexible to capture individual class variations across domains. By adopting a natural and widely used assumption that the data samples from the same class should lay on an intrinsic low-dimensional subspace, even if they come from different domains, the proposed method circumvents the limitation of the global domain shift, and solves the cross-domain recognition by finding the joint subspaces of the source and target domains. Specifically, given labeled samples in the source domain, we construct a subspace for each of the classes. Then we construct subspaces in the target domain, called anchor subspaces, by collecting unlabeled samples that are close to each other and are highly likely to belong to the same class. The corresponding class label is then assigned by minimizing a cost function which reflects the overlap and topological structure consistency between subspaces across the source and target domains, and within the anchor subspaces, respectively. We further combine the anchor subspaces to the corresponding source subspaces to construct the joint subspaces. Subsequently, one-versus-rest support vector machine classifiers are trained using the data samples belonging to the same joint subspaces and applied to unlabeled data in the target domain. We evaluate the proposed method on two widely used datasets: 1) object recognition dataset for computer vision tasks and 2) sentiment classification dataset for natural language processing tasks. Comparison results demonstrate that the proposed method outperforms the comparison methods on both datasets.
Research Organization:
Chongqing Univ. (China); Univ. of Macau (China); Univ. of South Carolina, Columbia, SC (United States)
Sponsoring Organization:
Air Force Office of Scientific Research (AFOSR); Army Research Laboratory (ARL); National Natural Science Foundation of China (NSFC); National Science Foundation (NSF); Research Grants of University of Macau (China); Science and Technology Development Fund of Macau (China); USDOE Office of Science (SC)
Grant/Contract Number:
SC0012704
OSTI ID:
1491680
Report Number(s):
BNL--210903-2019-JAAM
Journal Information:
IEEE Transactions on Cybernetics, Journal Name: IEEE Transactions on Cybernetics Journal Issue: 4 Vol. 47; ISSN 2168-2267
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

References (38)

Speeded-Up Robust Features (SURF) journal June 2008
Multiview Hessian discriminative sparse coding for image annotation journal January 2014
How Does the Brain Solve Visual Object Recognition? journal February 2012
Unbiased look at dataset bias conference June 2011
Discriminative Subspace Clustering conference June 2013
Generalized Domain-Adaptive Dictionaries conference June 2013
Semi-supervised Domain Adaptation with Instance Constraints conference June 2013
Subspace Interpolation via Dictionary Learning for Unsupervised Domain Adaptation conference June 2013
Transfer Joint Matching for Unsupervised Domain Adaptation conference June 2014
Domain Adaptation on the Statistical Manifold conference June 2014
Beyond the shortest path: Unsupervised domain adaptation by Sampling Subspaces along the Spline Flow conference June 2015
Fisher Discrimination Dictionary Learning for sparse representation conference November 2011
Domain adaptation for object recognition: An unsupervised approach conference November 2011
Frustratingly Easy NBNN Domain Adaptation conference December 2013
Unsupervised Visual Domain Adaptation Using Subspace Alignment conference December 2013
Cross-domain recognition by identifying compact joint subspaces conference September 2015
Visual Domain Adaptation: A survey of recent advances journal May 2015
Flowing on Riemannian Manifold: Domain Adaptation by Shifting Covariance journal December 2014
Learning to Rank Using User Clicks and Visual Features for Image Retrieval journal April 2015
Rating Knowledge Sharing in Cross-Domain Collaborative Filtering journal May 2015
Manifold Regularized Multitask Learning for Semi-Supervised Multilabel Image Classification journal February 2013
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding journal May 2014
Decomposition-Based Transfer Distance Metric Learning for Image Classification journal September 2014
A Survey on Transfer Learning journal October 2010
Domain Adaptation via Transfer Component Analysis journal February 2011
Transductive Face Sketch-Photo Synthesis journal September 2013
Lambertian reflectance and linear subspaces journal February 2003
Asymmetric bagging and random subspace for support vector machines-based relevance feedback in image retrieval journal July 2006
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition journal October 2007
Domain Transfer Multiple Kernel Learning journal March 2012
Unsupervised Adaptation Across Domain Shifts by Generating Intermediate Data Representations journal November 2014
Sparse Subspace Clustering: Algorithm, Theory, and Applications journal November 2013
Feature Space Independent Semi-Supervised Domain Adaptation via Kernel Matching journal January 2015
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation journal November 2006
Grassmann discriminant analysis: a unifying view on subspace-based learning conference January 2008
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation journal June 2003
Metrics and models for handwritten character recognition journal February 1998
Domain adaptation with structural correspondence learning conference January 2006