A Sparse Representation-Based Face Recognition Using Mixed Group Sparsity

Abstract:

Empirical evidence shows that introducing additional structured priors can reduce complexity of coding data, and achieve better performance. To improve the performance of sparse representation-based classification (SRC), the article based on the potential correlations between the elements of dictionary gets a mixed group sparsity which is composed of dynamic group sparsity and fixed-length group sparsity. To solve the structured sparsity efficiently, structured greedy algorithm (structOMP) is redesigned to fit the new structure. The modification includes search space and its neighbor. Finally, three sparse models are compared by experiments of face recognition, and the results show that the mixed group sparsity can improve the face recognition rate of other sparse models by 10% or more in dealing with corrupted data.

• Periodical: Applied Mechanics and Materials (Volumes 602-605)
• Pages: 1660-1665
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.602-605.1660
• Online since: August 2014
• Authors: Ti Jian Cai*, Xiao Ping Fan, Jun Xu
• Keywords: Coding Complexity, Compressed Sensing, Dynamic Group Sparsity, Face Recognition, Structured Greedy Algorithm

References

[1] Wright J, Yang A Y, Ganesh A, Ma Y. Robust face recognition via sparse representation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence , 2009, 31(2): 210-227.

DOI: 10.1109/tpami.2008.79

[2] Yang A Y, Zhou Z, Ma Y, Sastry S S. Towards a Robust Face Recognition System Using Compressive Sensing[C]/Eleventh Annual Conference of the International Speech Communication Association. Makuhari, Chiba: [s. n. ], 2010: 2250-2253.

DOI: 10.21437/interspeech.2010-618

[3] Cai Ti-jian, Fan Xiao-ping, Liu Zhun-xiong. Dense noise face recognition based on sparse representation and algorithm optimization[J]. Journal of Computer Applications, 2012, 32(8): 2313-2315.

DOI: 10.3724/sp.j.1087.2012.02313

[4] Zhang L, Yang M, Feng X, Ma Y, Zhang D. Collaborative representation based classification for face recognition[J]. arXiv preprint arXiv: 1204. 2358, (2012).

[5] Liu Y, Wu F, Zhang Z, Zhuang Y, Yan S. Sparse representation using nonnegative curds and whey[C]. 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2010: 3578-3585.

DOI: 10.1109/cvpr.2010.5539934

[6] Yang Qing-shan, Guo Cheng-an, Jin Ming-lu. Face Recognition Based on Gabor Multi-channel Weighted Optimization and Sparse Representation[J]. Journal of Electronics & Information Technology, 2011, 33(7): 1618-1624.

DOI: 10.3724/sp.j.1146.2010.01280

[7] Zhang L, Zhou W D, Chang P C, Liu J, Yan Z, Wang T, et al. Kernel sparse representation-based classifier[J]. Signal Processing, IEEE Transactions on, 2012, 60(4): 1684-1695.

DOI: 10.1109/tsp.2011.2179539

[8] Yuan X T, Liu X, Yan S. Visual classification with multitask joint sparse representation[J]. IEEE Transactions on Image Processing , 2012, 21(10): 4349-4360.

DOI: 10.1109/tip.2012.2205006

[9] Elhamifar E, Vidal R. Robust classification using structured sparse representation[C]. 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2011: 1873-1879.

DOI: 10.1109/cvpr.2011.5995664

[10] Micchelli C A, Morales J M, Pontil M. Regularizers for structured sparsity[J]. Advances in Computational Mathematics, 2013, 38(3): 455-489.

DOI: 10.1007/s10444-011-9245-9

[11] Huang J, Zhang T, Metaxas D. Learning with structured sparsity[J]. Journal of Machine Learning Research, 2011, 12: 3371-3412.

[12] Martinez A M, Benavente R. The AR Face Database[R]. CVC Technical Report#24, June (1998).

[13] Maleh R. Improved RIP analysis of orthogonal matching pursuit[J]. arXiv preprint arXiv: 1102. 4311, (2011).

[14] Cai Ti-jian, Fan Xiao-ping. Analysis and optimization of greedy pursuit algorithms[J]. Journal of Chinese Computer Systems, in press.