Robust domain adaptation image classification via sparse and low rank representation

被引:7
作者
Tao, JianWen [1 ]
Wen, Shiting [1 ]
Hu, Wenjun [2 ]
机构
[1] Zhejiang Univ, Ningbo Inst Technol, Sch Informat Sci & Engn, Ningbo 315100, Zhejiang, Peoples R China
[2] Huzhou Teachers Coll, Sch Informat & Engn, Huzhou 313000, Peoples R China
基金
国家教育部科学基金资助;
关键词
Robust domain adaptation learning; Low rank representation; Maximum mean discrepancy; Sparse representation; Transfer learning; Semi-supervised learning; Image classification; Robustness; LABEL PROPAGATION; REGULARIZATION;
D O I
10.1016/j.jvcir.2015.09.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Domain adaptation image classification addresses the problem of adapting the image distribution of the source domain to the target domain for an effective learning task, where the classification objective is intended but the data distributions are different. However, corrupted data (e.g. noise and outliers, which exist universally in real-world domains) can cause significant deterioration of the practical performance of existing methods in cross-domain image classification. This motivates us to propose a robust domain adaptation image classification method with sparse and low rank representation. Specifically, we first obtain an optimal Domain Adaptation Sparse and Low Rank Representation (DASLRR) for all the data from both domains by incorporating a distribution adaptation regularization term, which is expected to minimize the distribution discrepancy between the source and target domain, into the existing low rank and sparse representation objective function. Formulating an optimization problem that combines the objective function of the sparse and low rank representation, constrained by distribution adaptation and local consistency, we propose an algorithm that alternates between obtaining an effective dictionary, while preserving the DASLRR to make the new representations robust to the distribution difference. Based on the obtained DASLRR, we then provide a flexible semi-supervised learning framework, which can propagate the labels of labeled data from both domains to unlabeled data from In-Sample as well as Out-of-Sample datasets by simultaneously learning a prediction label matrix and a classifier model. The proposed method can capture the global mixture of the clustering structure (by the sparseness and low rankness) and the locally consistent structure (by the local graph regularization) as well as the distribution difference (by the distribution adaptation) of the domains data. Hence, the proposed method is robust for accurately classifying cross-domain images that may be corrupted by noise or outliers. Extensive experiments demonstrate the effectiveness of our method on several types of images and video datasets. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:134 / 148
页数:15
相关论文
共 48 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 2012, IEEE C COMP VIS PATT
[3]  
[Anonymous], 2011, P ADV NEUR INF PROC
[4]  
[Anonymous], 2007, P ACM MM
[5]  
[Anonymous], ADV NEURAL INF PROCE
[6]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[7]   Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy [J].
Bruzzone, Lorenzo ;
Marconcini, Mattia .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (05) :770-787
[8]   Orthogonal laplacianfaces for face recognition [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Zhang, Hong-Jiang .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (11) :3608-3614
[9]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[10]   Image retrieval: Ideas, influences, and trends of the new age [J].
Datta, Ritendra ;
Joshi, Dhiraj ;
Li, Jia ;
Wang, James Z. .
ACM COMPUTING SURVEYS, 2008, 40 (02)