Abstract
In order to make an efficient face recognition algorithm with real time processing, we should design good feature extraction and classification methods by considering both low computational costs and high classification performance. Among various feature extraction methods, the histogram of oriented gradient (HOG) feature shows good classification performance to classify human faces. However, high-dimensional features such as HOG feature waste lot of memory and computational time. some parts of HOG features for occluded face regions have negative effects in classifying face images, especially occluded face images. Therefore, we should select variable HOG features not only to reduce the computational costs but also to enhance classification performance. In this paper, we applied the greedy algorithm to effectively select the good features within traditional HOG feature. In order to compare the proposed feature extraction with the conventional HOG feature, we fixed classification method such as compressive sensing technique for selected features. Experimental results show that the proposed feature extraction has better classification performance than the traditional HOG features for face datasets with partial occlusion and/or various illumination conditions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pun, K.H., Moon, Y.S., Tsang, C.C., Chow, C.T., Chan, S.M.: A face recognition embedded system. In: Defense and Security. International Society for Optics and Photonics (2005)
Farahat, A.K., Ghodsi, A., Kamel, M.S.: An efficient greedy method for unsupervised feature selection. In: 11th IEEE International Conference on Data Mining (ICDM). IEEE (2011)
Vafaie, H., Imam, I.F.: Feature selection methods: genetic algorithms vs. greedy-like search. In: Proceedings of International Conference on Fuzzy and Intelligent Control Systems (1994)
Xu, L., Yan, P., Chang, T.: Best first strategy for feature selection. In: 9th International Conference on Pattern Recognition. IEEE (1988)
Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics 39(3), 653–684 (2000)
Dalal, N., Triggs, B.: Histograms of oriented gradients for human detection. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE (2005)
Dalal, N., Triggs, B., Schmid, C.: Human detection using oriented histograms of flow and appearance. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 428–441. Springer, Heidelberg (2006)
Déniz, O., Bueno, G., Salido, J., De la Torre, F.: Face recognition using histograms of oriented gradients. Pattern Recognit. Lett. 32(12), 1598–1603 (2011)
Albiol, A., Monzo, D., Martin, A., Sastre, J., Albiol, A.: Face recognition using HOG–EBGM. Pattern Recognit. Lett. 29(10), 1537–1543 (2008)
Shi, Q., Eriksson, A., van den Hengel, A., Shen, C.: Is face recognition really a compressive sensing problem? In: IEEE Conference on Computer Vision and Pattern Recognition, IEEE (2011)
Martinez, A.M.: The AR face database. CVC Technical Report, vol. 24 (1998)
Lee, K.-C., Ho, J., Kriegman, D.J.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 684–698 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, Y., Jeong, S., Lee, M. (2013). Feature Selection for HOG Descriptor Based on Greedy Algorithm. In: Lee, M., Hirose, A., Hou, ZG., Kil, R.M. (eds) Neural Information Processing. ICONIP 2013. Lecture Notes in Computer Science, vol 8228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42051-1_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-42051-1_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42050-4
Online ISBN: 978-3-642-42051-1
eBook Packages: Computer ScienceComputer Science (R0)