TY - GEN
T1 - Feature selection for HOG descriptor based on greedy algorithm
AU - Choi, Yonghwa
AU - Jeong, Sungmoon
AU - Lee, Minho
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Face recognition
KW - Feature selection
KW - Greedy algorithm
KW - Histogram of oriented gradient
UR - http://www.scopus.com/inward/record.url?scp=84893387593&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-42051-1_52
DO - 10.1007/978-3-642-42051-1_52
M3 - Conference contribution
AN - SCOPUS:84893387593
SN - 9783642420504
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 417
EP - 424
BT - Neural Information Processing - 20th International Conference, ICONIP 2013, Proceedings
T2 - 20th International Conference on Neural Information Processing, ICONIP 2013
Y2 - 3 November 2013 through 7 November 2013
ER -