Abstract
In this paper, a strategy is proposed to deal with a challenging research topic, occluded face recognition. Our approach relies on sparse representation on downsampled input image to first locate unoccluded face parts, and then exploits the linear discriminant ability of those pixels to identify the input subject. The advantages and novelties of our method include, 1) since the sparse representation based occlusion detection is conducted on dowsampled image, our algorithm is much faster than classic SRC; 2) the discriminant information learned from training samples is combined with sparse representation to recognize occluded face for the first time. The verification experiments are conducted on both simulated block occlusion images and genuine occluded images.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Turk M A, Pentland A P. Face recognition using eigenfaces. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Maui, 1991. 586–591
Belhumeur P N, Hespanha J P, Kriegman D J. Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Patt Anal Mach Intell, 1997, 19: 711–720
Oh H J, Lee K M, Lee S U. Occlusion invariant face recognition using selective local non-negative matrix factorization basis images. Image Vision Comput, 2008, 26: 1515–1523
Jia H, Martinez A M. Face recognition with occlusion in the training and testing sets. In: Proceedings of the IEEE International Conference on Automatic Face & Gesture Recognition, Amsterdam, 2008. 1–6
He R, Zheng W, Hu B. Maximum correntropy criterion for robust face recognition. IEEE Trans Patt Anal Mach Intell, 2011, 33: 1561–1576
He R, Hu B, Zheng W, et al. Two-stage sparse representation for robust recognition on large-scale database. In: Proceedings of 24th AAAI Conference on Artificial Intelligence, Atlanta, 2010. 475–480
Yang M, Zhang L. Gabor feature based sparse representation for face recognition with gabor occlusion dictionary. In: Proceedings of the 11th European Conference on Computer Vision. Berlin/Heidelberg: Springer-Verlag, 2010. 448–461
Wright J, Yang A Y, Ganesh A, et al. Robust face recognition via sparse representation. IEEE Trans Patt Anal Mach Intell, 2008, 31: 210–227
Candès E J, Wakin M B. An introduction to compressive sampling. IEEE Signal Process Mag, 2008, 25: 21–30
Candès E J, Romberg J. l1-magic: recovery of sparse signals via convex programming. 2005. http://www.acm.caltech.edu/l1magic/downloads/l1magic.pdf
Theodoridis S, Koutroumbas K. Pattern Recognition. 3rd ed. Academic Press, 2006
Lee K C, Ho J, Kriegman D. Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans Patt Anal Mach Intell, 2005, 27: 684–698
Samaria F S, Harter A C. Parameterisation of a stochastic model for human face identification. In: Proceedings of the IEEE Workshop on Applications of Computer Vision, Sarasota, 1994. 138–142
Zhou Z H, Wagner A, Mobahi H, et al. Face recognition with contiguous occlusion using markov random fields In: Proceedings of IEEE International Conference on Computer Vision, Kyoto, 2009. 1050–1057
Martınez A M, Benavente R. The AR Face Database. CVC Technical Report 24, 1998
Yang A Y, Sastry S S, Ganesh A, et al. Fast L1-minimization algorithms and an application in robust face recognition: a review. In: Proceedings of the 17th IEEE International Conference on Image Processing, Hong Kong, 2010. 1849–1852
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y., Meng, L., Feng, J. et al. Downsampling sparse representation and discriminant information aided occluded face recognition. Sci. China Inf. Sci. 57, 1–8 (2014). https://doi.org/10.1007/s11432-013-4856-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-013-4856-z