Low-rank analysis-synthesis dictionary learning with adaptively ordinal locality

被引:17
作者
Li, Zhengming [1 ]
Zhang, Zheng [2 ,3 ]
Qin, Jie [4 ]
Li, Sheng [5 ]
Cai, Hongmin [6 ]
机构
[1] Guangdong Polytech Normal Univ, Ind Training Ctr, Guangzhou 510665, Guangdong, Peoples R China
[2] Harbin Inst Technol, Biocomp Res Ctr, Shenzhen 518055, Peoples R China
[3] Univ Queensland, Sch Informat Technol & Elect Engn, Brisbane, Qld 4072, Australia
[4] Swiss Fed Inst Technol, Comp Vis Lab, CH-8092 Zurich, Switzerland
[5] Univ Georgia, Dept Comp Sci, Athens, GA 30602 USA
[6] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Low-rank; Analysis dictionary learning; Synthesis dictionary learning; Object classification; Ordinal locality; OVERCOMPLETE DICTIONARIES; FACE RECOGNITION; K-SVD; ROBUST; CLASSIFICATION; ALGORITHM; MODELS;
D O I
10.1016/j.neunet.2019.07.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Analysis dictionary learning (ADL) has been successfully applied to a variety of learning systems. However, the ordinal locality of analysis dictionary has rarely been explored in constructing discriminative terms. In this paper, a discriminative low-rank analysis-synthesis dictionary learning (LR-ASDL) algorithm with the adaptively ordinal locality is proposed for object classification. Specifically, we first explicitly introduce the relations between the analysis atoms and profiles (i.e., row vectors of the coefficients matrix). That is, the similarity between two profiles depends on that between the corresponding analysis atoms. Moreover, an adaptively ordinal locality preserving(AOLP) term is constructed by simultaneously exploiting the profiles and analysis atoms, which can be learned in a supervised way. In this way, the neighborhood correlations between analysis atoms and the highorder ranking information of each analysis atom's neighbors can be simultaneously preserved in the learning process. Particularly, this helps to uncover the intrinsic underlying data factors and inherit the geometry structure information of training samples. Furthermore, the low-rank model is imposed on the synthesis atoms to further facilitate the learned dictionaries to be more discriminative. Extensive experimental results on eight databases demonstrate that the LR-ASDL algorithm clearly outperforms some analysis and synthesis dictionary learning algorithms using deep and hand-crafted features. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:93 / 112
页数:20
相关论文
共 78 条
[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]   Joint Discriminative Bayesian Dictionary and Classifier Learning [J].
Akhtar, Naveed ;
Mian, Ajmal ;
Porikli, Fatih .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :3919-3928
[3]   Efficient classification with sparsity augmented collaborative representation [J].
Akhtar, Naveed ;
Shafait, Faisal ;
Mian, Ajmal .
PATTERN RECOGNITION, 2017, 65 :136-145
[4]  
[Anonymous], 2010, 100920105055 ARXIV
[5]  
[Anonymous], IEEE T NEURAL NETWOR
[6]  
[Anonymous], ADV NEURAL INFORM PR
[7]   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
[8]   Extreme learning machine and adaptive sparse representation for image classification [J].
Cao, Jiuwen ;
Zhang, Kai ;
Luo, Minxia ;
Yin, Chun ;
Lai, Xiaoping .
NEURAL NETWORKS, 2016, 81 :91-102
[9]  
Chang C. C., 2011, ACM T INTEL SYST TEC, V2, P1, DOI DOI 10.1145/1961189.1961199
[10]  
Deng J, 2009, PROC CVPR IEEE, P248, DOI 10.1109/CVPRW.2009.5206848