Abstract
In this paper, three initializing methods for the Non-negative Sparse Coding are proposed for the disguised face recognition task in two scenarios: sunglasses or scarves. They aim to overcome previous sparse coding methods’ difficulty, which is the requirement for a comprehensive training set. This means spending much more effort for collecting images and matching, which is not practical in many real world applications. To build a training set from a limited database containing one neutral facial images per person, a number of training images are derived from one image in the database using one of the three following partitioning methods: (1) grid-based partitioning, (2) horizontal partitioning and (3) geometric partitioning. Experiment results will show that these initialization methods facilitate Non-negative sparse coding algorithm to converge much faster compared to previous methods. Furthermore, trained features are more localized and more distinct. This leads to faster recognition time with comparable recognition results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Olshausen, B., Field, D.: Emergence of simple-cell receptive field properties by learning a sparse code for natural images. J. Nature 381, 607–609 (1996)
Bhavin, S., Levine, M.: Face recognition using localized features based on non-negative sparse coding. J. Machine Vision and Application 18, 107–122 (2007)
Lee, D., Seung, S.: Algorithms for non-negative matrix factorization. In: 13th Advances in Neural Information Processing Systems, pp. 556–562. MIT Press (2000)
ISO/IEC JTC1 SC17 WG3/TF1 for ICAO-NTWG: History, interoperability and implementation, Machine readable travel documents. International Civil Aviation Organization (2007)
Le, T., Truong, H., Dang, K., Duong, D.: Using Genetic Algorithms to Find Reliable Set of Coefficients for Face Recognition. J. Information Technologies and Communications (JITC) 1(6(26), 124–133 (2011)
Wright, J., Yang, A., Ganesh, A., Sastry, S., Ma, Y.: Robust face recognition via sparse representation. In: IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 210–227. IEEE Press, Washington, DC (2009)
Martinez, M., Benavente, R.: The AR face database, www2.ece.ohio-state.edu/~aleix/ARdatabase.html
Nguyen, M., Le, Q., Pham, V., Tran, T., Le, B.: Multi-scale Sparse Representation for Robust Face Recognition. In: 3rd International Conference on Knowledge and Systems Engineering, Hanoi, Vietnam, pp. 195–199 (2011)
Yang, M., Zhang, L., Yang, J., Zhang, D.: Robust sparse coding for face recognition. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 625–632. IEEE Press (2011)
Elhamifar, E., Vidal, R.: Robust Classification using Structured Sparse Representation. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1873–1879. IEEE Press (2011)
Huang, K., Aviyente, S.: Sparse representation for signal classification. In: Advances in Neural Information Processing Systems (2006)
Hoyer, P.: Probabilistic Models of Early Vision. Ph.D. Thesis. Helsinki University of Technology (2002)
Hoyer, P.: Non-Negative Sparse Coding. In: 7th IEEE Workshop on Neural Networks for Signal Processing, pp. 557–565. IEEE Press (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, K.D., Le, T.H. (2013). Local Region Partitioning for Disguised Face Recognition Using Non-negative Sparse Coding. In: Nguyen, N., Trawiński, B., Katarzyniak, R., Jo, GS. (eds) Advanced Methods for Computational Collective Intelligence. Studies in Computational Intelligence, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34300-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-34300-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34299-8
Online ISBN: 978-3-642-34300-1
eBook Packages: EngineeringEngineering (R0)