Jointly discriminative projection and dictionary learning for domain adaptive collaborative representation-based classification

被引:11
作者
Zheng, Zhichao [1 ]
Sun, Huaijiang [1 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Collaborative representation; Dimensionality reduction; Dictionary learning; Domain adptation; FACE RECOGNITION; KERNEL; OPTIMIZATION;
D O I
10.1016/j.patcog.2019.01.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, collaborative representation-based classification (CRC) methods have shown impressive performance in many recognition tasks. However, when the training data have different distributions with the testing data, the performance of CRC will be degraded significantly. On the other hand, con-catenating training data from different sources as a single data set will affect the performance of CRC, as the shift exists between the different source domains. To address these problems, in this paper, we propose a Jointly Discriminative projection and Dictionary learning for domain adaptive Collaborative Representation-based Classification method (JD(2)-CRC). As the distributions of different source domains may be dissimilar, the data from all domains are projected into a common feature subspace where the latent shared structures can be found. Then a compact dictionary is learned to represent the projected data well. To find the most suitable projection matrices and dictionary for CRC, we design the objective function of JD(2)-CRC,according to the classification rule of CRC in feature subspace, which minimizes the ratio of within-class reconstruction errors over between-class reconstruction errors. Different to traditional optimization methods, an effective optimization procedure is presented based on gradient descent. Thus, the obtained collaborative representations have a better discriminability and suit the classification rule of CRC well. The experimental results demonstrate that the proposed method can achieve superior performance against other state-of-the-art methods. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:325 / 336
页数:12
相关论文
共 59 条
[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]   Efficient classification with sparsity augmented collaborative representation [J].
Akhtar, Naveed ;
Shafait, Faisal ;
Mian, Ajmal .
PATTERN RECOGNITION, 2017, 65 :136-145
[3]  
[Anonymous], 2013, ICML WORKSHOP CHALLE
[4]  
[Anonymous], 2017, IEEE T RELIAB
[5]  
[Anonymous], P 28 AAAI C ART INT
[6]  
[Anonymous], 1990, INTRO STAT PATTERN R
[7]  
[Anonymous], 2017, Proc Mach Learn Res
[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]   Competitive and collaborative representation for classification [J].
Chi, Hongmei ;
Xia, Haifeng ;
Zhang, Lifang ;
Zhang, Chunjiang ;
Tang, Xin .
PATTERN RECOGNITION LETTERS, 2020, 132 :46-55
[10]  
Csurka Gabriela, 2017, ARXIV170205374