Latent subspace sparse representation-based unsupervised domain adaptation

Liu Shuai; Hao Sun; Fumin Zhao; Shilin Zhou

doi:10.1117/12.2205702

14 December 2015 Latent subspace sparse representation-based unsupervised domain adaptation

Liu Shuai, Hao Sun, Fumin Zhao, Shilin Zhou

Proceedings Volume 9813, MIPPR 2015: Pattern Recognition and Computer Vision; 981307 (2015) https://doi.org/10.1117/12.2205702
Event: Ninth International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2015), 2015, Enshi, China

Abstract

In this paper, we introduce and study a novel unsupervised domain adaptation (DA) algorithm, called latent subspace sparse representation based domain adaptation, based on the fact that source and target data that lie in different but related low-dimension subspaces. The key idea is that each point in a union of subspaces can be constructed by a combination of other points in the dataset. In this method, we propose to project the source and target data onto a common latent generalized subspace which is a union of subspaces of source and target domains and learn the sparse representation in the latent generalized subspace. By employing the minimum reconstruction error and maximum mean discrepancy (MMD) constraints, the structure of source and target domain are preserved and the discrepancy is reduced between the source and target domains and thus reflected in the sparse representation. We then utilize the sparse representation to build a weighted graph which reflect the relationship of points from the different domains (source-source, source- target, and target-target) to predict the labels of the target domain. We also proposed an efficient optimization method for the algorithm. Our method does not need to combine with any classifiers and therefore does not need train the test procedures. Various experiments show that the proposed method perform better than the competitive state of art subspace-based domain adaptation.

Citation Download Citation

Liu Shuai, Hao Sun, Fumin Zhao, and Shilin Zhou "Latent subspace sparse representation-based unsupervised domain adaptation", Proc. SPIE 9813, MIPPR 2015: Pattern Recognition and Computer Vision, 981307 (14 December 2015); https://doi.org/10.1117/12.2205702

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Detection and tracking algorithms

Machine vision

Computer vision technology

Data modeling

Remote sensing

Satellites

Distance measurement

Show All Keywords

Keywords/Phrases

Search In:

Publication Years