PATTERN RECOGNITION | 卷:48 |
Mixed-norm sparse representation for multi view face recognition | |
Article | |
Zhang, Xin1  Duc-Son Pham2  Venkatesh, Svetha1  Liu, Wanquan2  Dinh Phung1  | |
[1] Deakin Univ, Ctr Pattern Recognit & Data Analyt, Geelong, Vic 3217, Australia | |
[2] Curtin Univ Technol, Dept Comp, Perth, WA, Australia | |
关键词: Multi-pose face recognition; Sparse representation classification; ADMM; Group sparse representation; Multi-task learning; Joint dynamic sparse representation classification; Unsupervised learning; Convex optimization; Robust face recognition; | |
DOI : 10.1016/j.patcog.2015.02.022 | |
来源: Elsevier | |
【 摘 要 】
Face recognition with multiple views is a challenging research problem. Most of the existing works have focused on extracting shared information among multiple views to improve recognition. However, when the pose variation is too large or missing, 'shared information' may not be properly extracted, leading to poor recognition results. In this paper, we propose a novel method for face recognition with multiple view images to overcome the large pose variation and missing pose issue. By introducing a novel mixed norm, the proposed method automatically selects candidates from the gallery to best represent a group of highly correlated face images in a query set to improve classification accuracy. This mixed norm combines the advantages of both sparse representation based classification (SRC) and joint sparse representation based classification (JSRC). A trade off between the l(1) norm from SRC and l(2,1) norm from JSRC is introduced to achieve this goal. Due to this property, the proposed method decreases the influence when a face image is unseen and has large pose variation in the recognition process. And when some face images with a certain degree of unseen pose variation appear, this mixed norm will find an optimal representation for these query images based on the shared information induced from multiple views. Moreover, we also address an open problem in robust sparse representation and classification which is using l(1) norm on the loss function to achieve a robust solution. To solve this formulation, we derive a simple, yet provably convergent algorithm based on the powerful alternative directions method of multipliers (ADMM) framework. We provide extensive comparisons which demonstrate that our method outperforms other state-of-the-arts algorithms on CMU-PIE, Yale B and Multi-PIE databases for multi-view face recognition. (C) 2015 Elsevier Ltd. All rights reserved.
【 授权许可】
Free
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
10_1016_j_patcog_2015_02_022.pdf | 1551KB | download |