Singular value decomposition based virtual representation for face recognition

被引:15
作者
Zhang, Guiying [1 ,2 ]
Zou, Wenbin [3 ]
Zhang, Xianjie [2 ]
Zhao, Yong [4 ]
机构
[1] Guizhou Univ, Coll Comp Sci & Technol, Guiyang, Guizhou, Peoples R China
[2] Zunyi Med Univ, Dept Med Informat Engn, Zunyi, Peoples R China
[3] Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Adv Telecommun & Informat Proc, Shenzhen, Peoples R China
[4] Peking Univ, Key Lab Integrated Microsyst, Shenzhen Grad Sch, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
Virtual samples; Singular value decomposition (SVD); Sparse representation; Face recognition; Image classification; Collaborative representation; SPARSE REPRESENTATION; IMAGE; SVD; PCA;
D O I
10.1007/s11042-017-4627-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Sparse representation, which uses a test sample to represent a linear combination of an entire set of training samples, has achieved great success in face recognition, and it results in good performance when sufficient training samples exist. However, the available number of images of a subject's face is usually limited in real face recognition systems. In this paper, to obtain more facial representations, we propose a novel method that applies singular value decomposition (SVD) to produce virtual images from original images. The obtained virtual images not only enlarge the size of the set of training samples but also represent relatively stable low frequency facial information; thereby improving the robustness and classification accuracy. We also integrate these virtual samples with the original samples, providing more available information for object classification and, consequently, achieving better performance. To the best of our knowledge, this paper is the first work to use the product of a singular value matrix and right singular vectors to generate virtual samples for face recognition. Experiments on the most widely used and challenging benchmark datasets demonstrate that our method obtains better accuracy and is more robust compared with previous methods.
引用
收藏
页码:7171 / 7186
页数:16
相关论文
共 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]   SINGULAR VALUE DECOMPOSITION (SVD) IMAGE-CODING [J].
ANDREWS, HC ;
PATTERSON, CL .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1976, 24 (04) :425-432
[3]  
[Anonymous], PATTERN RECOGNIT LET
[4]  
Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
[5]  
Dollar Piotr, 2009, Integral channel featuresJ
[6]   Nonlocally Centralized Sparse Representation for Image Restoration [J].
Dong, Weisheng ;
Zhang, Lei ;
Shi, Guangming ;
Li, Xin .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2013, 22 (04) :1618-1628
[7]   Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization [J].
Dong, Weisheng ;
Zhang, Lei ;
Shi, Guangming ;
Wu, Xiaolin .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2011, 20 (07) :1838-1857
[8]   For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution [J].
Donoho, David L. .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (07) :907-934
[9]   Image denoising via sparse and redundant representations over learned dictionaries [J].
Elad, Michael ;
Aharon, Michal .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (12) :3736-3745
[10]   Convolutional Sparse Coding for Image Super-resolution [J].
Gu, Shuhang ;
Zuo, Wangmeng ;
Xie, Qi ;
Meng, Deyu ;
Feng, Xiangchu ;
Zhang, Lei .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :1823-1831