# A Revisit Histogram of Oriented Descriptor for Facial Color Image Classification Based on Fusion of Color Information

Authors: Huy Nguyen-Quoc; Vinh Truong Hoang
Journal: Journal of Sensors
 (2021)

---

## Abstract

Histogram of Oriented Gradient (HOG) is a robust descriptor which is widely used in many real-life applications, including human detection, face recognition, object counting, and video surveillance. In order to extract HOG descriptor from color images whose information is three times more than the grayscale images, researchers currently apply the maximum magnitude selection method. This method makes the information of the resulted image is reduced by selecting the maximum magnitudes. However, after we extract HOG using the unselected magnitudes of the maximum magnitude selection method, we observe that the performance is better than using the maximum magnitudes in several cases. Therefore, in this paper, we propose a novel approach for extracting HOG from color images such as Color Component Selection and Color Component Fusion. We also propose the extended kernels in order to improve the performance of HOG. With our new approaches in the color component analysis, the experimental results of several facial benchmark datasets are enhanced with the increment from 3 to 10% of accuracy. Specifically, a 95.92% of precision is achieved on the Face AR database and 75% on the Georgia Face database. The results are better more than 10 times compared with the original HOG approach.


---

## Body

## 1. Introduction

Nowadays, image classification is one of the most extensive fields in computer vision which attracts the attention of many researchers because of its wide range of application in real life such as human detection, facial recognition, object classification, and diagnose diseases in medical. Many local and global image descriptors have been proposed in order to handle this task [1–3]. The key step is to find a robust descriptor which can discriminate classes. A large number of descriptors have been proposed to extract feature from image, including Color Local Binary Pattern (LBP) [4], Scale Invariant Feature Transform (SIFT) [5], Histogram of Oriented Gradients (HOGs) [6], and GIST [7]. Among them, HOG is a successful descriptor with various applications in real life, including pedestrian detection, face recognition, object classification, security, and industrial inspection. For example, Ding et al. [8] fuse HOG features and global normalized histogram for human detection task by the AdaBoost classifier. Qi et al. [9] apply HOG for railway track detection by using region-growing methods. Qingbo et al. [10] combine HOG features and Discriminative Multimanifold Analysis Method (DMAM) for face recognition in few shot learning context. In this approach, facial features were extracted from image patches fusing and then applied DMAM to transform to lower dimensional space. Chowdhury et al. [11] introduced an improved version of HOG for human detection. Nabila et al. [12] present an optimized version of HOG for road car detection. This approach is based on the concatenation of shape features and motion integration. Aytac et al. [13] extract LBP and HOG features from stomach cancer images. Then, multiple reduction techniques are applied to select the most useful attributes. Hmood et al. [14] introduce an improved version of HOG by proposing an approximate windows that can cover whole object, namely, Dynamic-HOG. This method requires less processing time and achieves a higher accuracy for coin classification. Jebril et al. [15] apply HOG for handwritten character recognition from grayscale images transformed from RGB color space. The authors used both R-HOG and C-HOG with different windows. Uddin et al. create another HOG version named T20-HOG with the ability to extract the textural features from seed varieties for identification [16]. A two-stage classification process is proposed by Chandrakala and Devi in combination with HOG descriptors [17]. With the robustness of deep neural networks and the advantage of HOG, Hung created a hybrid combination of HOG and CNN named HOG-CNN approach with promising results [18].Various advancement versions of HOG are proposed in recent years by incorporating with convolutional neural networks (CNNs). Zaffar et al. [19] present CoHOG which is based on CNN in order to extract features from ROI for visual place recognition. Xiong et al. [20] introduce a method for handling depth information of images based on HOG, namely, Histogram of Oriented Depth (HOD) features. The proposed approach is applied for pedestrian detection by combining color image edge information and HOD. Wang et al. [21] present an approach based on HOG and multiorientation computation, namely, MO-HOG. This method combines two-part gradient information to build MO-HOG and applied for facial expression recognition. Pan [22] combines HOG and CNN for facial expression classification. In this approach, HOG features are extracted from CNN’s shallow features. Joshi et al. [23] present a method for selecting optimal parameter for HOG descriptor. A multilevel HOG based on sign language image is applied for several windows size of 30×30 and 20×20. Wang et al. [24] concatenate HOD and the Zernike moment’s features of SAR images for terrain matching.Furthermore, HOG has outperformed other descriptors in the classification stage for grayscale image. However, when we extract HOG from color image, the performance usually degrades seriously. The reason is because the information that the color image contains is three times more than the grayscale image does. Moreover, most descriptors are first designed to perform on grayscale images only. Therefore, color has been well investigated in recent years for extracting HOG features. For example, Hoang et al. [25] extract local image descriptors, including LBP, HOG, and GIST for an application of rice seed image recognition. In this approach, features extracted from independent color component are then fused to form final feature vector. Aslan et al. [26] compare HOG-SVM and CNN for human tracking based on video in occlusion context. Zhou et al. [27] introduce a method for extracting HOG features based on a color filter array. Each Bayer pattern is then applied to convert into three component color images by downsampling operation. A new extension of bin was added to HOG and extracted in HSI color space for removing shadow region. Nhat and Hoang [28] enhance the accuracy of face recognition by the fusion of three popular features (LBP, HOG, and GIST). Duong and Hoang [29] apply to extract rice seed images based on features coded in multiple color spaces using HOG descriptor. Banerji et al. [30] enhance the HOG descriptor by subjecting the image to the Haar wavelet transform to improve the HOG descriptor for image classification. Recently, Z. Zhou and Y. Zhou [31] handle color space information for extracting features, namely, CCS-HOG. They apply a between component color space similarity, combining with HOG for extracting facial features. This approach has been shown its effectiveness in kinship verification. Van and Hoang extract HOG features for coding facial image in different color spaces [32, 33]. The final features are obtained by concatenating all features extracted from each color component. Fekri-Ershad and Tajeripour analyzed the color information of color-texture images for classification using hybrid color LBP [34]. Color-texture can also be analyzed using weighted color order of LBP for classification [35].Although the current researchers have applied maximum magnitude selection method in order to selectively reduce the information of color image so it can meet the requirements of the following stage of HOG extraction process, the performance is not completely optimized. The impact of color component for extracting features is first mentioned in [36] for LBP descriptors. This issue is extensively investigated to incorporate color information by various proposed method in recent years. It can be used by fusing features extracted from each color component independently or jointly [4]. Specifically, better performances are achieved when we use the unselected magnitudes of maximum magnitude selection method. Novel approaches for extracting HOG from color image are Color Component Selection and Color Component Fusion. Furthermore, we also upgrade the kernels in the gradient computation stage by extending it in horizontal and vertical dimensions. The intention is to figure out the connection between surrounding pixels and the computing pixel, whether the surrounding pixels cause any effects on the output performance.The rest of this paper is organized as follows. Section2.1 and Section 3 introduce HOG descriptor with Color Component Selection, Color Component Fusion, and the extended kernels. Then, experimental results are presented in Section 4. Finally, the conclusion and future works are discussed in Section 5.


## 2. HOG Descriptor with Color Component Selection and Color Component Fusion

This section briefly introduces HOG computation and the two proposed approaches with Color Component Selection (CCS) and Color Component Fusion (CCF) for HOG descriptor.


### 2.1. HOG Descriptor

Before extracting HOG feature, an imageI is split into three subimages IC1, IC2, and IC3 which are three color components of I. Next, several image processing algorithms are applied on these images in order to reduce noisy for enhancing the performance. After preprocessing step, on each image, gradient magnitude and direction of each pixel are computed by using the horizontal and vertical gradients. The gradient computation of pixel located at coordinate x,y is defined as follows [6]:(1)Δx=Gx−1,y−Gx+1,y,(2)Δy=Gx,y−1−Gx,y+1,(3)Mx,y=Δx2+Δy2,(4)αx,y=arctanΔyΔx,where G is grayscale value of the computing pixel, Δx and Δy represent horizontal and vertical gradients, and Mx,y and αx,y sequentially define gradient magnitude and gradient direction.


### 2.2. Proposed Approaches

Each image then results in a pair of matrices which contains one gradient magnitude matrix and one the gradient direction matrix. So there are three achieved pairs of matrices in total which areMC1 and αC1, MC2 and αC2, and MC3 and αC3. As the following step requires only one pair of matrices, the current task is to figure out which pair of matrices should be selected in order to produce an optimal feature vector. The most popular solution is maximum magnitude selection. This method compares three gradient magnitudes in each pixel. Then, the maximum is chosen for the final magnitude of this pixel. The final direction is also extracted from the same color component with the selected magnitude. The detail of maximum magnitude selection method is illustrated in Figure 1.Figure 1
An illustration of maximum magnitude selection method.After selection step, two final matrices are obtained to meet the requirement of the orientation binning step. In this step, the original image is divided into cells (8×8 per cell) and a 9-bin histogram is built in each cell based on the gradient features of the inner pixels. The bins are ranged from 0 to 180 degrees for unsigned gradient (αunsigned) and from 0 to 360 degrees in case of signed gradient (αsigned). Gradient magnitude of each pixel is added into the corresponding index number of a bin in the histogram. The index number Bidxx,y is then computed by Equation (5) or (6) and used the ceiling value.(5)Bidxx,y=αx,yαunsigned/Bnumαunsigned∈0,180,Bnum=9,or(6)αx,yαunsigned/Bnumαsigned∈0,360,Bnum=9,where Bnum stands for the default number of orientation bins of the histogram and is usually set to 9 by default. αx,y is computed above by Equation (4).For the normalization stage, the original image is then divided into blocks (each block contains2×2 cells which equal to 256×256 pixels). An effective normalization is able to reduce noise and cancel the ill effects. In each block, 50% of the surrounding blocks are overlapped so each cell can be normalized more than once except the cells locate in the corner. Histograms of each block are concatenated and then normalized by using L1-norm, L2-norm, or L1-sqrt. Finally, all normalized histograms are combined together as a feature vector.In practice, we observe that the maximum magnitude selection method is not optimal enough as it may cause information loss. When we use the unselected values of the maximum magnitude selection for HOG extraction, the achieved results are higher than use the maximum magnitude in several experiments. Therefore, we apply Color Component Selection and Color Component Fusion methods to improve the performance. For the Color Component Selection method, instead of considering which magnitude or direction should be selected for the next stage, we choose the final pair of matrices based on the color components. There are three matrices of each kind so nine different pairs of matrices are achieved in total. The orientation binning stage sequentially applies these pairs to proceed. In the end, nine feature vectors are obtained which are corresponding to nine selected pairs. These vectors are then evaluated to find out the best performance. The process of the Color Component Selection method is presented in Figure2. The Color Component Fusion simply takes the achieved vectors and concatenates all of them into a fusion vector.Figure 2
An illustration of the Color Component Selection method.


## 2.1. HOG Descriptor

Before extracting HOG feature, an imageI is split into three subimages IC1, IC2, and IC3 which are three color components of I. Next, several image processing algorithms are applied on these images in order to reduce noisy for enhancing the performance. After preprocessing step, on each image, gradient magnitude and direction of each pixel are computed by using the horizontal and vertical gradients. The gradient computation of pixel located at coordinate x,y is defined as follows [6]:(1)Δx=Gx−1,y−Gx+1,y,(2)Δy=Gx,y−1−Gx,y+1,(3)Mx,y=Δx2+Δy2,(4)αx,y=arctanΔyΔx,where G is grayscale value of the computing pixel, Δx and Δy represent horizontal and vertical gradients, and Mx,y and αx,y sequentially define gradient magnitude and gradient direction.


## 2.2. Proposed Approaches

Each image then results in a pair of matrices which contains one gradient magnitude matrix and one the gradient direction matrix. So there are three achieved pairs of matrices in total which areMC1 and αC1, MC2 and αC2, and MC3 and αC3. As the following step requires only one pair of matrices, the current task is to figure out which pair of matrices should be selected in order to produce an optimal feature vector. The most popular solution is maximum magnitude selection. This method compares three gradient magnitudes in each pixel. Then, the maximum is chosen for the final magnitude of this pixel. The final direction is also extracted from the same color component with the selected magnitude. The detail of maximum magnitude selection method is illustrated in Figure 1.Figure 1
An illustration of maximum magnitude selection method.After selection step, two final matrices are obtained to meet the requirement of the orientation binning step. In this step, the original image is divided into cells (8×8 per cell) and a 9-bin histogram is built in each cell based on the gradient features of the inner pixels. The bins are ranged from 0 to 180 degrees for unsigned gradient (αunsigned) and from 0 to 360 degrees in case of signed gradient (αsigned). Gradient magnitude of each pixel is added into the corresponding index number of a bin in the histogram. The index number Bidxx,y is then computed by Equation (5) or (6) and used the ceiling value.(5)Bidxx,y=αx,yαunsigned/Bnumαunsigned∈0,180,Bnum=9,or(6)αx,yαunsigned/Bnumαsigned∈0,360,Bnum=9,where Bnum stands for the default number of orientation bins of the histogram and is usually set to 9 by default. αx,y is computed above by Equation (4).For the normalization stage, the original image is then divided into blocks (each block contains2×2 cells which equal to 256×256 pixels). An effective normalization is able to reduce noise and cancel the ill effects. In each block, 50% of the surrounding blocks are overlapped so each cell can be normalized more than once except the cells locate in the corner. Histograms of each block are concatenated and then normalized by using L1-norm, L2-norm, or L1-sqrt. Finally, all normalized histograms are combined together as a feature vector.In practice, we observe that the maximum magnitude selection method is not optimal enough as it may cause information loss. When we use the unselected values of the maximum magnitude selection for HOG extraction, the achieved results are higher than use the maximum magnitude in several experiments. Therefore, we apply Color Component Selection and Color Component Fusion methods to improve the performance. For the Color Component Selection method, instead of considering which magnitude or direction should be selected for the next stage, we choose the final pair of matrices based on the color components. There are three matrices of each kind so nine different pairs of matrices are achieved in total. The orientation binning stage sequentially applies these pairs to proceed. In the end, nine feature vectors are obtained which are corresponding to nine selected pairs. These vectors are then evaluated to find out the best performance. The process of the Color Component Selection method is presented in Figure2. The Color Component Fusion simply takes the achieved vectors and concatenates all of them into a fusion vector.Figure 2
An illustration of the Color Component Selection method.


## 3. Extended Kernels for HOG Extraction

In order to speed the gradient computation process up, researchers used kernels which are illustrated in Figure3. By filtering the image with these kernels, the horizontal gradient Δx and vertical gradient Δy are computed faster than calculating based on Equations (1) and (2). We define these original kernels are kernels with R=1. As we sequentially extend the kernels through horizontal and vertical dimension, the parameter R also increases. Figure 3 describes specifically the kernels which parameter R in range from 1 to 4. Then, the achieved horizontal and vertical gradients are divided by parameter R.Figure 3
An illustration of original kernels and extended kernels.


## 4. Experiments

### 4.1. Dataset Description

The proposed approaches are evaluated on four common facial databases, including AR, Georgia, CLV, and MUCT (see Figure4). In order to experiment the proposed approaches, these databases are split into 50% of training and 50% of testing. However, databases, such as Georgia, CLV, and MUCT, have an odd number of images per class. For instance, the MUCT dataset includes 3 images in each class so we decide to randomly split one image for training and the other two for testing in order to make the training more challenging. The 1-NN classifier is employed to evaluate the classification performance, and accuracy metric is employed to measure the performance on testing set. The summary of those databases is presented in Table 1.Figure 4
The four datasets used to evaluate the proposed approach.
(a)
AR dataset(b)
Georgia dataset(c)
CLV dataset(d)
MUCT datasetTable 1
Description of experimental dataset.
DatasetImage sizeClassTraining setTesting setTotalAR165×1201001,3001,3002,600CLV256×256111333444777Georgia128×12850350400750MUCT256×256199199398597


### 4.2. Experimental Setup

As our proposed approaches are designed to fit in every three-component color images, we also experiment them in several well-known color spaces, including HSV, ISH, I1I2I3, and YCbCr. These spaces are frequently applied for pattern recognition [4]. According to Section 2, each image after applying Color Component Selection results in 10 different feature vectors, including 9 different vectors and one fusion vector which is extracted by the Color Component Fusion method. These results are then deployed to a 1-NN classifier for evaluating. Moreover, we set the kernels with R from 1 to 5, respectively, for comparison. The experiments are implemented by Matlab 2017b and conducted on a PC with a configuration of a CPU I3 8100 3.60 GHz and 8 GBs of RAM.


### 4.3. Results

The experimental results are presented by charts in Figures5–8. By converting in many color spaces and increasing parameter R, the performance of maximum magnitude selection method has been upgraded. Furthermore, the Color Component Selection and the Color Component Fusion have also outperformed the maximum magnitude selection method according to the charts. For the AR database, the highest achieved accuracy is 95.92% which is 0.54% more than the highest accuracy can be achieved by using the maximum magnitude selection method, and this result is obtained by the Color Component Fusion with R=5 kernels, and the used color space is ISH. For the Georgia database, when we apply the Color Component Fusion method combined with R=1 kernels and YCbCr color space, the achieved result is 75.00%. This is the highest accuracy in all experiments on the Georgia database. Better performance is also obtained in experiment for the MUCT database and even in experiment with the CLV database which is the most challenging image set. Generally, we observe that the best results are mostly achieved with Fusion approach in comparing with other approaches, which can tell the promising performance of our proposed approaches.Figure 5
Different values of extended kernels for HOG by CCS and CCF on AR dataset.Figure 6
Different values of extended kernels for HOG by CCS and CCF on Georgia dataset.Figure 7
Different values of extended kernels for HOG by CCS and CCF on CLV dataset.Figure 8
Different values of extended kernels for HOG by CCS and CCF on MUCT dataset.Several of best cases are reported in Tables2–5. In these tables, the Max magnitude abbreviation stands for maximum magnitude selection method while Fusion abbreviation stands for Color Component Fusion method. We found that the best accuracy obtained for AR dataset is 95.92% by using Fusion approach. Similarly, this approach achieves 75.00%, 49.77%, and 93.47% for Georgia, CLV, and MUCT datasets, respectively. Note that the performance of each color space is different according to the feature extraction methods. Moreover, the increment of parameter R in the extended kernels has also improved several experimental results. In most cases, the accuracy when applying R=5 kernels is higher compared to the others. However, there are also several cases where highest precision is achieved with R=1 so we cannot yet tell if the higher the parameter R of kernels, the higher accuracy we can achieve. But we believe that these results are the foundation of the advantageous effectiveness of kernel size in HOG performance, which leads us to study deeper about it in the future.Table 2
Several experimental cases on the AR database.
Color spaceRARMax magnitudeC2C2C2C3FusionC1C2C3C1RGB192.6987.0091.2389.7785.4690.62293.4688.4693.1592.9287.8592.77394.5488.7793.8593.6988.8593.69494.9289.1594.3894.3889.0894.54594.3889.8593.6994.4689.2393.77HSV192.6284.6984.0074.8582.7786.31294.4687.1590.3883.5486.3190.08394.4688.1592.4686.3887.5492.15494.5488.6994.2387.3187.8593.77594.6989.0094.7787.9287.6294.15ISH192.0892.7782.0872.2389.2388.69294.7794.5488.1581.7792.7792.85394.8594.7792.1585.8593.8594.23495.3894.4693.6987.2394.0095.08594.6994.6294.2387.6994.0895.92YCbCr192.7792.3886.1585.5493.1591.31294.0094.1590.1591.0094.8593.77394.5494.1591.5492.3195.1594.31494.7794.3891.3892.5494.9294.69594.5494.0890.7791.6994.9294.62I1I2I3193.0893.1589.6278.2393.3192.00293.7794.4693.0887.3195.6994.23394.4694.6993.3189.3895.0895.38494.5494.6293.0090.3195.3195.62594.6294.8593.0091.5495.3195.69Table 3
Several experimental cases on the Georgia database.
Color spaceRGeorgiaMax magnitudeC1C1C2C3FusionC2C3C2C2RGB165.7567.0065.7566.5066.2566.50266.0067.5066.5068.2568.2567.75366.7568.7569.2568.7568.5069.00467.0068.7569.2568.7569.7569.00567.0068.5067.5068.2569.2568.00HSV169.2567.0063.5064.0047.0070.00265.0067.7559.0064.7552.5069.50364.5065.7555.0064.7556.7569.00465.0067.2556.2565.2558.2571.25564.2568.2558.7568.0062.5072.75ISH169.0068.7563.2566.5047.2570.50266.2566.7558.0064.7549.7570.25364.7566.0058.7565.2554.0069.50465.0065.7555.7566.5056.2570.50565.7567.7556.7565.5059.2572.50YCbCr166.2565.7571.5066.5068.5075.00268.2568.0068.7565.7565.7572.75368.2565.5065.5063.7565.0072.50469.0065.0064.5064.2563.5071.00569.0065.7563.5063.7564.7570.00I1I2I3166.2567.7556.2567.2568.0072.00267.7567.5061.5066.0065.0070.25368.5065.5059.5064.2564.7570.00468.5065.0059.7563.7564.0070.50568.7565.5060.0064.0063.5069.75Table 4
Several experimental cases on the CLV database.
Color spaceRCLVMax magnitudeC1C1C1C3C3FusionC1C2C3C2C3RGB147.7547.5249.7748.6548.6549.1049.55247.5245.9547.7547.0747.5248.2047.75347.9746.8548.4248.6547.9748.4248.42447.5247.7548.2047.3048.4246.8548.42547.0747.0748.6547.9747.7547.3048.87HSV146.8547.7546.4045.5042.1244.8248.42245.5046.4046.1745.0543.9245.5048.20345.5046.8546.1745.0544.1444.8248.42445.2747.5246.6244.8245.0543.4749.32545.7247.3047.3045.2745.9543.0249.10ISH146.4048.6547.3045.9541.8944.5949.32245.5048.4245.9544.8242.7945.5048.65345.5048.4246.6243.9242.3444.1448.42445.0547.3045.7244.3743.4742.7948.42546.1748.8745.7245.9543.4742.3448.20YCbCr149.1048.8743.9245.0542.1246.6247.97247.7548.6543.6947.3044.3746.6247.97347.7548.6544.8247.9745.9546.6248.87447.9747.9745.7249.1045.0546.8548.87549.3248.8745.2749.1044.8246.4048.20I1I2I3148.8748.6544.8244.1446.4043.9249.32248.4248.4246.8544.5947.5243.4748.65348.2048.4247.5246.1746.8543.2448.42448.2047.3047.7545.7246.6241.8949.10548.6548.8747.3045.2746.1741.8948.65Table 5
Several experimental cases on the MUCT database.
Color spaceRMUCTMax magnitudeC1C1C1C2C3FusionC1C2C3C1C2RGB191.7192.2191.7192.7192.4692.2192.21291.4692.7192.4692.2192.7191.9692.21391.7192.4692.9692.2191.7192.9692.96491.9691.7192.7192.4691.9692.7192.96592.2191.7192.4692.4692.2192.9692.71HSV190.9592.4692.7190.2090.2088.9493.22289.9592.7192.7191.4691.2188.9493.47389.4592.2191.4691.7191.7189.4593.47488.9491.7191.4691.2192.2189.4592.96588.9491.7191.9690.7092.4688.9493.22ISH190.2092.2192.9689.4589.9586.1893.47289.2092.2191.9691.4690.2088.6992.96389.2092.9691.7191.7191.7189.2093.47488.4492.7191.9691.4692.4688.1993.22588.9492.4692.4690.7091.9688.9493.22YCbCr192.7192.2191.2189.9589.4591.4692.96292.4691.9692.4691.9690.9592.2192.96392.7192.7192.9692.2191.2191.7192.46492.4692.9692.4691.9691.2190.9592.21592.4692.4691.4690.9591.7190.7091.96I1I2I3192.7192.2190.9588.1989.7090.2092.46292.2192.2192.9690.4590.7091.2192.96392.7192.9692.4690.9591.4691.7193.22492.7192.7191.7190.4591.9690.2092.71592.4692.4690.9590.2091.9690.4592.71


## 4.1. Dataset Description

The proposed approaches are evaluated on four common facial databases, including AR, Georgia, CLV, and MUCT (see Figure4). In order to experiment the proposed approaches, these databases are split into 50% of training and 50% of testing. However, databases, such as Georgia, CLV, and MUCT, have an odd number of images per class. For instance, the MUCT dataset includes 3 images in each class so we decide to randomly split one image for training and the other two for testing in order to make the training more challenging. The 1-NN classifier is employed to evaluate the classification performance, and accuracy metric is employed to measure the performance on testing set. The summary of those databases is presented in Table 1.Figure 4
The four datasets used to evaluate the proposed approach.
(a)
AR dataset(b)
Georgia dataset(c)
CLV dataset(d)
MUCT datasetTable 1
Description of experimental dataset.
DatasetImage sizeClassTraining setTesting setTotalAR165×1201001,3001,3002,600CLV256×256111333444777Georgia128×12850350400750MUCT256×256199199398597


## 4.2. Experimental Setup

As our proposed approaches are designed to fit in every three-component color images, we also experiment them in several well-known color spaces, including HSV, ISH, I1I2I3, and YCbCr. These spaces are frequently applied for pattern recognition [4]. According to Section 2, each image after applying Color Component Selection results in 10 different feature vectors, including 9 different vectors and one fusion vector which is extracted by the Color Component Fusion method. These results are then deployed to a 1-NN classifier for evaluating. Moreover, we set the kernels with R from 1 to 5, respectively, for comparison. The experiments are implemented by Matlab 2017b and conducted on a PC with a configuration of a CPU I3 8100 3.60 GHz and 8 GBs of RAM.


## 4.3. Results

The experimental results are presented by charts in Figures5–8. By converting in many color spaces and increasing parameter R, the performance of maximum magnitude selection method has been upgraded. Furthermore, the Color Component Selection and the Color Component Fusion have also outperformed the maximum magnitude selection method according to the charts. For the AR database, the highest achieved accuracy is 95.92% which is 0.54% more than the highest accuracy can be achieved by using the maximum magnitude selection method, and this result is obtained by the Color Component Fusion with R=5 kernels, and the used color space is ISH. For the Georgia database, when we apply the Color Component Fusion method combined with R=1 kernels and YCbCr color space, the achieved result is 75.00%. This is the highest accuracy in all experiments on the Georgia database. Better performance is also obtained in experiment for the MUCT database and even in experiment with the CLV database which is the most challenging image set. Generally, we observe that the best results are mostly achieved with Fusion approach in comparing with other approaches, which can tell the promising performance of our proposed approaches.Figure 5
Different values of extended kernels for HOG by CCS and CCF on AR dataset.Figure 6
Different values of extended kernels for HOG by CCS and CCF on Georgia dataset.Figure 7
Different values of extended kernels for HOG by CCS and CCF on CLV dataset.Figure 8
Different values of extended kernels for HOG by CCS and CCF on MUCT dataset.Several of best cases are reported in Tables2–5. In these tables, the Max magnitude abbreviation stands for maximum magnitude selection method while Fusion abbreviation stands for Color Component Fusion method. We found that the best accuracy obtained for AR dataset is 95.92% by using Fusion approach. Similarly, this approach achieves 75.00%, 49.77%, and 93.47% for Georgia, CLV, and MUCT datasets, respectively. Note that the performance of each color space is different according to the feature extraction methods. Moreover, the increment of parameter R in the extended kernels has also improved several experimental results. In most cases, the accuracy when applying R=5 kernels is higher compared to the others. However, there are also several cases where highest precision is achieved with R=1 so we cannot yet tell if the higher the parameter R of kernels, the higher accuracy we can achieve. But we believe that these results are the foundation of the advantageous effectiveness of kernel size in HOG performance, which leads us to study deeper about it in the future.Table 2
Several experimental cases on the AR database.
Color spaceRARMax magnitudeC2C2C2C3FusionC1C2C3C1RGB192.6987.0091.2389.7785.4690.62293.4688.4693.1592.9287.8592.77394.5488.7793.8593.6988.8593.69494.9289.1594.3894.3889.0894.54594.3889.8593.6994.4689.2393.77HSV192.6284.6984.0074.8582.7786.31294.4687.1590.3883.5486.3190.08394.4688.1592.4686.3887.5492.15494.5488.6994.2387.3187.8593.77594.6989.0094.7787.9287.6294.15ISH192.0892.7782.0872.2389.2388.69294.7794.5488.1581.7792.7792.85394.8594.7792.1585.8593.8594.23495.3894.4693.6987.2394.0095.08594.6994.6294.2387.6994.0895.92YCbCr192.7792.3886.1585.5493.1591.31294.0094.1590.1591.0094.8593.77394.5494.1591.5492.3195.1594.31494.7794.3891.3892.5494.9294.69594.5494.0890.7791.6994.9294.62I1I2I3193.0893.1589.6278.2393.3192.00293.7794.4693.0887.3195.6994.23394.4694.6993.3189.3895.0895.38494.5494.6293.0090.3195.3195.62594.6294.8593.0091.5495.3195.69Table 3
Several experimental cases on the Georgia database.
Color spaceRGeorgiaMax magnitudeC1C1C2C3FusionC2C3C2C2RGB165.7567.0065.7566.5066.2566.50266.0067.5066.5068.2568.2567.75366.7568.7569.2568.7568.5069.00467.0068.7569.2568.7569.7569.00567.0068.5067.5068.2569.2568.00HSV169.2567.0063.5064.0047.0070.00265.0067.7559.0064.7552.5069.50364.5065.7555.0064.7556.7569.00465.0067.2556.2565.2558.2571.25564.2568.2558.7568.0062.5072.75ISH169.0068.7563.2566.5047.2570.50266.2566.7558.0064.7549.7570.25364.7566.0058.7565.2554.0069.50465.0065.7555.7566.5056.2570.50565.7567.7556.7565.5059.2572.50YCbCr166.2565.7571.5066.5068.5075.00268.2568.0068.7565.7565.7572.75368.2565.5065.5063.7565.0072.50469.0065.0064.5064.2563.5071.00569.0065.7563.5063.7564.7570.00I1I2I3166.2567.7556.2567.2568.0072.00267.7567.5061.5066.0065.0070.25368.5065.5059.5064.2564.7570.00468.5065.0059.7563.7564.0070.50568.7565.5060.0064.0063.5069.75Table 4
Several experimental cases on the CLV database.
Color spaceRCLVMax magnitudeC1C1C1C3C3FusionC1C2C3C2C3RGB147.7547.5249.7748.6548.6549.1049.55247.5245.9547.7547.0747.5248.2047.75347.9746.8548.4248.6547.9748.4248.42447.5247.7548.2047.3048.4246.8548.42547.0747.0748.6547.9747.7547.3048.87HSV146.8547.7546.4045.5042.1244.8248.42245.5046.4046.1745.0543.9245.5048.20345.5046.8546.1745.0544.1444.8248.42445.2747.5246.6244.8245.0543.4749.32545.7247.3047.3045.2745.9543.0249.10ISH146.4048.6547.3045.9541.8944.5949.32245.5048.4245.9544.8242.7945.5048.65345.5048.4246.6243.9242.3444.1448.42445.0547.3045.7244.3743.4742.7948.42546.1748.8745.7245.9543.4742.3448.20YCbCr149.1048.8743.9245.0542.1246.6247.97247.7548.6543.6947.3044.3746.6247.97347.7548.6544.8247.9745.9546.6248.87447.9747.9745.7249.1045.0546.8548.87549.3248.8745.2749.1044.8246.4048.20I1I2I3148.8748.6544.8244.1446.4043.9249.32248.4248.4246.8544.5947.5243.4748.65348.2048.4247.5246.1746.8543.2448.42448.2047.3047.7545.7246.6241.8949.10548.6548.8747.3045.2746.1741.8948.65Table 5
Several experimental cases on the MUCT database.
Color spaceRMUCTMax magnitudeC1C1C1C2C3FusionC1C2C3C1C2RGB191.7192.2191.7192.7192.4692.2192.21291.4692.7192.4692.2192.7191.9692.21391.7192.4692.9692.2191.7192.9692.96491.9691.7192.7192.4691.9692.7192.96592.2191.7192.4692.4692.2192.9692.71HSV190.9592.4692.7190.2090.2088.9493.22289.9592.7192.7191.4691.2188.9493.47389.4592.2191.4691.7191.7189.4593.47488.9491.7191.4691.2192.2189.4592.96588.9491.7191.9690.7092.4688.9493.22ISH190.2092.2192.9689.4589.9586.1893.47289.2092.2191.9691.4690.2088.6992.96389.2092.9691.7191.7191.7189.2093.47488.4492.7191.9691.4692.4688.1993.22588.9492.4692.4690.7091.9688.9493.22YCbCr192.7192.2191.2189.9589.4591.4692.96292.4691.9692.4691.9690.9592.2192.96392.7192.7192.9692.2191.2191.7192.46492.4692.9692.4691.9691.2190.9592.21592.4692.4691.4690.9591.7190.7091.96I1I2I3192.7192.2190.9588.1989.7090.2092.46292.2192.2192.9690.4590.7091.2192.96392.7192.9692.4690.9591.4691.7193.22492.7192.7191.7190.4591.9690.2092.71592.4692.4690.9590.2091.9690.4592.71


## 5. Conclusion

In this paper, we propose novel approaches to extract HOG descriptor from color images such as the Color Component Selection method and Color Component Fusion in order to improve the classification performance. In our observation, we recognize that the proposed methods outperform the current maximum magnitude selection method in face classification task, especially the Color Component Fusion method. The color space conversion and extended kernels also efficiently improve the accuracy of the classification. However, in several cases, the extended kernels still cause the accuracy to decrease. The Color Component Selection method requires a long time to finish the extraction from every available case, and the Color Component Fusion may cause computer memory issues due to its deep dimension. Therefore, our future work is to figure out the optimal pair of matrices without experimenting all cases to enhance the inference speed. Feature selection methods are also recommended to reduce the vector dimension. Several CNN-related works are considered to combine with the proposed approaches for further improvement.



---

*Source: 6296505-2021-11-30.xml*