Please use this identifier to cite or link to this item:
|Title:||Supervised sparse patch coding towards misalignment-robust face recognition||Authors:||Lang, C.
Supervised sparse coding
|Issue Date:||2011||Citation:||Lang, C.,Cheng, B.,Feng, S.,Yuan, X. (2011). Supervised sparse patch coding towards misalignment-robust face recognition. Proceedings - 6th International Conference on Image and Graphics, ICIG 2011 : 599-604. ScholarBank@NUS Repository. https://doi.org/10.1109/ICIG.2011.87||Abstract:||We address the challenging problem of face recognition under the scenarios where both training and test data are possibly contaminated with spatial misalignments. A supervised sparse coding framework is developed in this paper towards a practical solution to misalignment-robust face recognition. Each given probe face image is then uniformly divided into a set of local patches. We propose to sparsely reconstruct each probe image patch from the patches of all gallery images, and at the same time the reconstructions for all patches of the probe image are regularized by one term towards enforcing sparsity on the subjects of those selected patches. The derived reconstruction coefficients by ℓ 1-norm minimization are then utilized to fuse the subject information of the patches for identifying the probe face. Such a supervised sparse coding framework provides a unique solution to face recognition. Extensive face recognition experiments on three benchmark face datasets demonstrate the advantages of the proposed framework over holistic sparse coding and conventional subspace learning based algorithms in terms of robustness to spatial misalignments and image occlusions. © 2011 IEEE.||Source Title:||Proceedings - 6th International Conference on Image and Graphics, ICIG 2011||URI:||http://scholarbank.nus.edu.sg/handle/10635/71902||ISBN:||9780769545417||DOI:||10.1109/ICIG.2011.87|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
checked on Apr 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.