UM
Robust face recognition via occlusion dictionary learning
Weihua Ou1; Xinge You1; Dacheng Tao2; Pengyue Zhang1; Yuanyan Tang1,3; Ziqi Zhu1
2014-04
Source PublicationPattern Recognition
ISSN0031-3203
Volume47Issue:4Pages:1559-1572
Abstract

Sparse representation based classification (SRC) has recently been proposed for robust face recognition. To deal with occlusion, SRC introduces an identity matrix as an occlusion dictionary on the assumption that the occlusion has sparse representation in this dictionary. However, the results show that SRC's use of this occlusion dictionary is not nearly as robust to large occlusion as it is to random pixel corruption. In addition, the identity matrix renders the expanded dictionary large, which results in expensive computation. In this paper, we present a novel method, namely structured sparse representation based classification (SSRC), for face recognition with occlusion. A novel structured dictionary learning method is proposed to learn an occlusion dictionary from the data instead of an identity matrix. Specifically, a mutual incoherence of dictionaries regularization term is incorporated into the dictionary learning objective function which encourages the occlusion dictionary to be as independent as possible of the training sample dictionary. So that the occlusion can then be sparsely represented by the linear combination of the atoms from the learned occlusion dictionary and effectively separated from the occluded face image. The classification can thus be efficiently carried out on the recovered non-occluded face images and the size of the expanded dictionary is also much smaller than that used in SRC. The extensive experiments demonstrate that the proposed method achieves better results than the existing sparse representation based face recognition methods, especially in dealing with large region contiguous occlusion and severe illumination variation, while the computational cost is much lower. 

KeywordFace Recognition Mutual Incoherence Occlusion Dictionary Learning Structured Sparse Representation
DOIhttps://doi.org/10.1016/j.patcog.2013.10.017
URLView the original
Indexed BySCI
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS IDWOS:000331669300002
PublisherELSEVIER SCI LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, OXON, ENGLAND
The Source to ArticleScopus
Fulltext Access
Citation statistics
Cited Times [WOS]:112   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionUniversity of Macau
Corresponding AuthorXinge You
Affiliation1.Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
2.Center for Quantum Computation and Intelligent Systems, Faculty of Engineering and Information Technology, University of Technology Sydney, 235 Jones Street, Ultimo, NSW 2007, Australia
3.Faculty of Science and Technology, University of Macau, Macau, China
Recommended Citation
GB/T 7714
Weihua Ou,Xinge You,Dacheng Tao,et al. Robust face recognition via occlusion dictionary learning[J]. Pattern Recognition,2014,47(4):1559-1572.
APA Weihua Ou,Xinge You,Dacheng Tao,Pengyue Zhang,Yuanyan Tang,&Ziqi Zhu.(2014).Robust face recognition via occlusion dictionary learning.Pattern Recognition,47(4),1559-1572.
MLA Weihua Ou,et al."Robust face recognition via occlusion dictionary learning".Pattern Recognition 47.4(2014):1559-1572.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Weihua Ou]'s Articles
[Xinge You]'s Articles
[Dacheng Tao]'s Articles
Baidu academic
Similar articles in Baidu academic
[Weihua Ou]'s Articles
[Xinge You]'s Articles
[Dacheng Tao]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Weihua Ou]'s Articles
[Xinge You]'s Articles
[Dacheng Tao]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.