Author:
Zheng Chengyong,Luo Zhiyu
Abstract
Abstract
Face recognition has been widely used in biometric verification which is a significant issue in system control in computer based communication. Sparse regression classification (SRC) has been an important method for face recognition. SRC assumes its regression coefficients are globally sparse. However, these regression coefficients correspond to a class-specific gallery may be locally dense. In order to get some regression coefficients that are globally sparse and locally dense, sparse group regression (SGR) is introduced in this paper for face recognition. By use of SGR, we expect to get some regression coefficients which are not only sparse as a whole, but also locally dense in some part. Variable splitting and alternating direction method of multipliers (ADMM) are used for solving the problem of SGR. The proposed algorithm, named Sparse Group Regression Classification (SGRC), is extensively evaluated on four standard databases. A comparative study with some state-of-the-art algorithms reflects the efficacy of the proposed approach.
Subject
General Physics and Astronomy
Reference15 articles.
1. Robust face recognition via sparse representation;Wright;IEEE Trans. Pattern Anal. Machine Intell.,2009
2. Linear regression for face recognition;Naseem;IEEE Trans. Pattern Anal. Machine Intell.,2010
3. Kernel linear regression for face recognition;Lu;Neural Computing and Applications,2013
4. Collaborative representation with k-nearest classes for classification;Zheng;Pattern Recognition Letters,2019
5. A new complex valued dictionary learning method for group-sparse representation;Hongxing;Optik,2019