Structure-Constrained Low-Rank and Partial Sparse Representation with Sample Selection for image classification

被引:16
作者
Liu, Yang [1 ]
Li, Xueming [1 ,3 ]
Liu, Chenyu [2 ]
Liu, Haixu [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Digital Multimedia & Design Arts, Beijing 100876, Peoples R China
[2] Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Beijing 100876, Peoples R China
[3] Beijing Key Lab Network Syst & Network Culture, Beijing, Peoples R China
关键词
Sparse coding; Low-rank; Dictionary learning; Image classification; Structured sparsity; FACE RECOGNITION; K-SVD; DICTIONARY; ALGORITHM;
D O I
10.1016/j.patcog.2016.01.026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel Structure-Constrained Low-Rank and Partial Sparse Representation algorithm for image classification. First, a Structure-Constrained Low-Rank Dictionary Learning (SCLRDL) algorithm is proposed, which imposes both structure and low-rank restriction on the coefficient matrix. Second, under the assumption that the coefficient of test sample is sparse and correlated with the learned representation of training samples, we propose a Low-Rank and Partial Sparse Representation (LRPSR) algorithm which concatenates training samples and test sample to form a data matrix and finds a low-rank and sparse representation of the data matrix over learned dictionary by low-rank matrix recovery technique. Finally, we design a Sample Selection (SS) procedure to accelerate LRPSR. Experimental results on Caltech 101 and Caltech 256 show that our method outperforms most sparse or low rank based image classification algorithm proposed recently. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:5 / 13
页数:9
相关论文
共 53 条
[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], 2003, IEEE WORKSH STAT COM
[3]  
[Anonymous], 2014, CONSTRAINED OPTIMIZA
[4]  
[Anonymous], 2000, Pattern Classification, DOI DOI 10.1007/978-3-319-57027-3_4
[5]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[6]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[7]   Support Vector Guided Dictionary Learning [J].
Cai, Sijia ;
Zuo, Wangmeng ;
Zhang, Lei ;
Feng, Xiangchu ;
Wang, Ping .
COMPUTER VISION - ECCV 2014, PT IV, 2014, 8692 :624-639
[8]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[9]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[10]  
Chen CF, 2012, PROC CVPR IEEE, P2618, DOI 10.1109/CVPR.2012.6247981