Synthesis linear classifier based analysis dictionary learning for pattern classification

被引:30
作者
Wang, Jiujun [1 ]
Guo, Yanqing [1 ]
Guo, Jun [1 ]
Li, Ming [1 ]
Kong, Xiangwei [1 ]
机构
[1] Dalian Univ Technol, Sch Informat & Commun Engn, Dalian 116024, Peoples R China
基金
中国国家自然科学基金;
关键词
Analysis dictionary learning; Synthesis linear classifier; Pattern classification; SPARSE REPRESENTATION; K-SVD; FACE RECOGNITION; DISCRIMINATIVE DICTIONARY; CONVERGENCE GUARANTEES; ALGORITHM; MINIMIZATION; CATEGORIES; MODELS;
D O I
10.1016/j.neucom.2017.01.041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dictionary learning approaches have been widely applied to solve pattern classification problems and have achieved promising performance. However, most of works aim to learn a discriminative synthesis dictionary and sparse coding coefficients for classification. Until recent years, analysis dictionary learning began to attract interest from researchers. In this paper, we present a novel discriminative analysis dictionary learning frame, named Synthesis Linear Classifier based Analysis Dictionary Learning (SLC-ADL). Firstly, we incorporate a synthesis-linear-classifier-based error term into the basic analysis dictionary learning model, whose classification performance is obviously improved by making full use of the label information. Then, we develop an alternating iterative algorithm to solve the new model and obtain closed-form solutions leading to pretty competitive running efficiency. What is more, we design three classification schemes by fully exploiting the synthesis linear classifier. Finally, extensive comparison experiments on scene categorization, object classification, action recognition and face recognition clearly verify the classification performance of the proposed algorithm. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:103 / 113
页数:11
相关论文
共 50 条
[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], P COMP VIS PATT REC
[3]  
[Anonymous], 2006, Advances in Neural Information Processing Systems, DOI DOI 10.7551/MITPRESS/7503.001.0001
[4]  
[Anonymous], 2008, 2008 IEEE C COMP VIS, DOI DOI 10.1109/CVPR.2008.4587652
[5]  
[Anonymous], 24 CVC
[6]  
[Anonymous], P AS C PATT REC ACPR
[7]   Proximal alternating linearized minimization for nonconvex and nonsmooth problems [J].
Bolte, Jerome ;
Sabach, Shoham ;
Teboulle, Marc .
MATHEMATICAL PROGRAMMING, 2014, 146 (1-2) :459-494
[8]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[9]   Large margin nearest neighbor classifiers [J].
Domeniconi, C ;
Gunopulos, D ;
Peng, J .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2005, 16 (04) :899-909
[10]   K-SVD Meets Transform Learning: Transform K-SVD [J].
Eksioglu, Ender M. ;
Bayir, Ozden .
IEEE SIGNAL PROCESSING LETTERS, 2014, 21 (03) :347-351