Learning Kernel Extended Dictionary for Face Recognition

• Published in: IEEE transaction on neural networks and learning systems Vol. 28; no. 5; pp. 1082 - 1094
• Main Authors: Huang, Ke-Kun, Dai, Dao-Qing, Ren, Chuan-Xian, Lai, Zhao-Rong
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.05.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Atomic properties; Dictionaries; Discriminant analysis; Face; Face occlusion; Face recognition; Feature extraction; Kernel; kernel discriminant analysis (KDA); Kernels; Occlusion; Pattern recognition; Probes; sparse representation classifier (SRC); Training; Variation
• ISSN: 2162-237X; 2162-2388
• DOI: 10.1109/TNNLS.2016.2522431

A sparse representation classifier (SRC) and a kernel discriminant analysis (KDA) are two successful methods for face recognition. An SRC is good at dealing with occlusion, while a KDA does well in suppressing intraclass variations. In this paper, we propose kernel extended dictionary (KED) for face recognition, which provides an efficient way for combining KDA and SRC. We first learn several kernel principal components of occlusion variations as an occlusion model, which can represent the possible occlusion variations efficiently. Then, the occlusion model is projected by KDA to get the KED, which can be computed via the same kernel trick as new testing samples. Finally, we use structured SRC for classification, which is fast as only a small number of atoms are appended to the basic dictionary, and the feature dimension is low. We also extend KED to multikernel space to fuse different types of features at kernel level. Experiments are done on several large-scale data sets, demonstrating that not only does KED get impressive results for nonoccluded samples, but it also handles the occlusion well without overfitting, even with a single gallery sample per subject.