# A Novel Statistical Feature Analysis-Based Global and Local Method for Face Recognition

Authors: Mohammed Ahmed Talab; Suryanti Awang; Mohd Dilshad Ansari
Journal: International Journal of Optics
 (2020)

---

## Abstract

Face recognition from an image/video has been a fast-growing area in research community, and a sizeable number of face recognition techniques based on texture analysis have been developed in the past few years. Further, these techniques work well on gray-scale and colored images, but very few techniques deal with binary and low-resolution images. As the binary image is becoming the preferred format for low face resolution analysis, there is a need for further studies to provide a complete solution for the image-based face recognition system with a higher accuracy rate. To overcome the limitation of the existing methods in extracting distinctive features in low-resolution images due to the contrast between the face and background, we propose a statistical feature analysis technique to fill the gaps. To achieve this, the proposed technique integrates the binary-level occurrence matrix (BLCM) and the fuzzy local binary pattern (FLBP) named FBLCM to extract global and local features of the face from binary and low-resolution images. The purpose of FBLCM is to distinctively improve performance of edge sharpness between black and white pixels in the binary image and to extract significant data relating to the features of the face pattern. Experimental results on Yale and FEI datasets validate the superiority of the proposed technique over the other top-performing feature analysis methods. The developed technique has achieved the accuracy of 94.54% when a random forest classifier is used, hence outperforming other techniques such as the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP), respectively.


---

## Body

## 1. Introduction

Face recognition is among the most important applications of pattern recognition and image processing. Thus, research on face recognition has increased due to its significance and potential to be deployed in threat-based applications [1]. In terms of characteristics of biometrics, face recognition is universally accepted by humans in allowing a system to recognize them using their face. Thus, face recognition has been deployed in surveillance applications as well as human-computer interaction (HCI) [2]. However, development in the face recognition domain has been limited due to issues such as fast computation results required in deploying the face recognition system for surveillance operations [3]. This issue has resulted to limiting the potential of deploying the face recognition system in a real-time environment, which also resulted in a different outcome than expected in the test database conditions [4]. In this paper, we will not discuss further about this issue since our aim is not to overcome the computational time.Feature extraction techniques in the feature extraction phase have been actively explored in the face recognition field. It is because the phase is essential in determining the face recognition performance [5]. Some researchers designed the feature extraction techniques to exploit available information from existing co-occurrence matrices or extract the face features based on the matrix-oriented feature [6–8]. However, feature extraction technique of an image is more efficient when a technique that is based on distinctive matching patterns is taken into consideration [9, 10]. For that reason, global and local feature extraction techniques of the face are widely implemented by researchers. The global and local features have some advantages. The advantages of global features are the extraction approach which entails complete or subarea assessment of the original image [11]. Thus, the method is deployed with respect to the texture measurement method which collects the global characteristics of a particular picture and utilized overall characteristics in the face identification operations. The method uses recognition that is found on the characteristics that are derived from the entire face. Overall, the global feature extraction involves the shape of the faces and how the faces are able to lessen vagueness by highlighting all likely options of the symmetrical area of the images.Recently, Karczmarek et al. [12] introduced a recent multicriteria decision theory concept of a new, generalized form of Choquet integral function and its application, in particular to the problem of face classification based on the aggregation of classifiers. Such a function may be constructed by a simple replacement of the product used under the Choquet integral sign by any t-norm. Bao et al. [13] proposed a novel quaternion-based colour model with enhanced fuzzy parameterized discriminant analysis to perform face recognition. The proposed method represented and classified colour images by using an improved fuzzy quaternion-based discriminant (FQD) model, which is effective for colour image feature representation, extraction, and classification. Agarwal and Bhanot [14] proposed a technique which uses the firefly algorithm to obtain natural subclusters of training face images formed due to variations in pose, illumination, expression, occlusion, etc. Movement of fireflies in a hyperdimensional input space is controlled by tuning the parameter gamma of the firefly algorithm which plays an important role in maintaining the trade-off between effective search space exploration, firefly convergence, overall computational time, and recognition accuracy. Karczmarek et al. [15] proposed a linguistic descriptor-based approach to the problem of face identification realized by both humans and computers. This approach is motivated by an evident observation that linguistic descriptors offer an ability to formalize and exploit important pieces of knowledge describing human’s face. Yadav and Vishwakarma [16] proposed a new efficient and advanced method, inspired from the interval type-II fuzzy membership concept of the fuzzy logic. The motivation is to exploit the benefit of an extended interval type-II membership function: a new concept to fuzzy logics, in collaboration with kernel-based sparse representation for random forest. Ramalingam [17] described an application of multicriteria decision-making (MCDM) for multimodal fusion of features in a 3D face recognition system. A decision-making process is outlined that is based on the performance of multimodal features in a face recognition task involving a set of 3D face databases. Roh et al. [18] proposed a face recognition method based on fuzzy transform and radial basis function neural networks, and to reduce the dimensionality and extract the important features of face images, they used the fuzzy transform with fuzzy partition techniques. Zhi and Liu [19] established an effective face recognition model based on principal component analysis, genetic algorithm, and support vector machine, in which principal component analysis is used to reduce feature dimension, the genetic algorithm is used to optimize the search strategy, and the support vector machine is used to realize classification.However, the local features have their own advantages; for instance, the extraction technique involves the divided portion of the picture and represents a distinct area in the image. The extracted local features are curving and mostly aligned to the boundary and local points of the image that is being extracted although the features are usually vague due to poor image condition [20, 21]. However, both global and local feature extraction techniques are combined to fully utilize both advantages. It is because of the local feature extraction technique which entails the detached portion of the picture such as shapes, outlines, corners, and boundaries of the face, whilst the global feature extraction technique entails complete or subarea assessment of the original image [11]. Thus, the global method is deployed with respect to the texture measurement method which collects the global characteristics of a particular picture which are utilized as overall characteristics in the face recognition process.Most of the existing global and local feature extraction techniques used texture analysis techniques to extract the features. However, the techniques are not competent compatible with the binary image and low resolution of the face image; there are many face recognition methods which have been implemented to overcome the disadvantages. The methods include discrete wavelet transform (DWT, principal components analysis (PCA)) [22, 23] and discrete cosine transform (DCT), and Gabor wavelet-based image provides the best resolution [24]. Other existing works also implemented the GLCM-based method to overcome the disadvantages [25–27].These methods have found the application on both colour and gray-scale images. Meanwhile, in pattern recognition, binary images are considered as the standard image format as they comprise different shapes and textures [28]. Therefore, the advantage of this method is the approach which reduces cost and makes the framework able to deal with a wide range of applications. The outstanding statistical feature analysis methods are based on GLCM in face recognition. There are some enhancements which are implemented such as GLDM and GLRLM [29, 30]. The latest work is from GLCM that extracted different features of the face based on GLCM [31, 32]. However, in the existing methods, there are some drawbacks. The main problem is the methods which are using the gray-level image. The problem with the gray-level image is that it will duplicate image pixels. Therefore, the methods are unable to extract robust face features. Other than that the methods lead to slow processing and skipping of the structure of the face body. In general, there is no available statistical feature analysis method specialized for the textures of binary face images. It is proved that binary images have advantages such as the images have black and white pixels. Thus, the extracted features from those pixels will be robust, whereby no duplication of pixel, and the pixel location is transparent. Therefore, the face features will be sharpened and will increase the accuracy performance.The main difference between deep learning and machine learning is due to the way data are presented in the system. Machine learning algorithms almost always require structured data, while deep learning networks rely on layers of ANN (artificial neural network). Practically, deep learning is a subset of machine learning that achieves great power and flexibility by learning to represent the world as nested hierarchy of concepts, with each concept defined in relation to simpler concepts, and more abstract representations computed in terms of less abstract ones [33, 34].However, in most complex algorithms, the simple method is used as an algorithmic step [35, 36]. The complex methods can solve most of the complex binarization problems, but complex methods often depend on the performance of other techniques and as such are often complex to design and costly to develop. In binary image representation, only two values per pixel (black and white) exist, thereby making it a suitable method for binary images.In face recognition, the binary image and low resolution of the face image are important to deal with binary image representation which is one of the essential preparation formats in low-resolution image analysis and recognition. However, simple thresholding methods available at present are not applicable for many of the binarization problems; other than that, in most of the implementation such as in the security area, the face image is in low resolution. Also, most of the real environment that involve with face recognition implementation has problems with low resolution of the face image. Therefore, the technique proposed in this study is based on the analysis of statistical features like gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP).This method is applied to extract the local and global face features from binary images and images with low resolution. This technique can statistically analyze the relationships between the edge pixels in binary images. After the extraction of the edge between the black and white levels, a set of values that represent the relationships between the edge pixels were determined; these values showed that the statistical feature analysis method is better than the other techniques in establishing the relationship between pixels. However, the existing techniques of statistical feature analysis have some drawbacks. For example, the methods lead to slow processing, skipping the structure of the face body, dealing with binary images as colored images, and poor results for binary images compared to natural texture images. In general, there is no available texture analysis method specialized for the textures of binary or textual images.For that reasons, we propose an enhanced technique that will combine the binary-level occurrence matrix (BLCM) and the fuzzy local binary pattern (FLBP) that will be named as FBLCM. This technique will develop a matrix extracted co-occurrence approach in face recognition based on the binary image pixel and will extract the texture of face features which enables the global feature to take the facial shape. The local feature extraction approach deals with the disconnected image parts such as the lines, edges, corners, and shapes, whereas the global approach deals with an entire or subregion analysis of a natural image. Thus, FLBP was combined with BLCM due to its capability of performing the statistical analysis of the behavior of binary picture pixels. This method was selected because binary image representation is the preferred textual image format. Meanwhile, the accuracy of a binarization process depends on the performance of the subsequent steps during document analysis. Due to the absence of a texture analysis method for gray-level images, the use of binary images necessitated this combination in a bid to address more descriptive features which can give a better recognition and higher accuracy. Some factors (such as the size of the binarization window) are often user defined, and this is not a practical practice with all images, especially those with different sizes and features. In the local binarization methods, the window size is a critical factor; small-sized binarization windows are suitable for noise removal, while large-sized windows are ideal for image preservation. Small-sized windows can damage large texts while large-sized windows are not good at noise removal. The FLBP is more applicable for descriptor images but less effective for shape images, and the BLCM is more effective with shape images. By placing FLBP (for descriptor classification) and BLCM (for shape classification) with this combination, we are able to achieve outperformed recognition performance compared to other related techniques.To explain details about our work, we divided this paper into several sections. Section2 presents the related work that focuses on the statistical feature analysis techniques in extracting global and local features of the face image. Section 3 describes the methodology of our proposed technique. Section 4 is the experimental and the result. Section 5 is the discussion, and finally conclusion is presented in Section 6.


## 2. Related Work

In this section, we analyzed statistical feature analysis techniques that have been implemented to extract global and local features of the face. Therefore, the sections below are divided into global feature extraction and local feature extraction. We discussed the related techniques in the respective section.


### 2.1. Global Feature Extraction

Gray-level co-occurrence matrix technique is an important numerical scheme deployed for the category of texture analysis methods. The GLCM method extracts statistical values based on longitudinal allocations of gray area values within a picture [37]. Besides, the GLCM method is based on a second-order feature that makes this approach to be robust for face recognition. The second-order statistic is characterized by the GLCM and gray-level difference method (GLDM) [38].Technically, these two approaches are similar, but the GLCM method is more often adopted by prior studies. The GLCM approach as initiated in [39] consisted of a matrix that allocates options to describe the dispersal of occurrences in a picture. Thus, the GLCM method presents the number of incidences in a gray-scale value and also presents the specific relationships.To calculate features, statistical equations are applied to the values of theP (i, j) matrixes. Accordingly, Haralick et al. [39] also recommended several statistic equations to compute texture features in the GLCM approach as presented in equations (1)–(7), respectively:(1)contrast=∑i,j=0n−1pi,ji−j2,(2)homogeneity=∑i,j=0n−1pi,j1+i,j2,(3)angular second moment=∑i,j=0n−1pi,j2,(4)entropy=−∑i,j=0n−1pi,jlnpi,j,(5)H−variance=∑i,j=0n−1pi,ji−ui2,(6)V−variance=∑i,j=0n−1pi,jj−uj2,(7)correlation=∑i,j=0n−1pi,ji−uij−ujσi2σj2,where pi,j is the standardized value and n is the gray intensities number.The GLCM has been deployed by prior studies for document analysis based on the global analysis approach, such as in iris recognition, fingerprint classification, Chinese sign language recognition as implemented by prior studies [40, 41], and a few related research. Correspondingly, Figure 1 presents how to derive the four concurrent matrices by means of Ng=5 levels and balances [0, 1], [−1, 1], [−1, 0], and [−1, −1] which is distinct as one adjacent pixel in the probable four axis.Figure 1
Co-occurrence matrix generation forNg = 5 levels and 4 dissimilar offsets.It can be seen that two adjacent pixels (2, 1) of the input picture are replicated in thepH correspondence matrix as 3 since there are three pixel intensity values (2) and a pixel strength value (1) contiguous to each other in the input image. The neighboring pixels (1, 2) will occur again 3 times in PH which makes the matrices the same. Likewise, the other 3 matrices Pv,PLD,andPRD are measured.Face recognition is utilized in several systems such as reconnaissance, verification, and security. However, it has become a very perplexing domain due to the orientation of face images, illumination, and variations in facial expressions. It is still a difficult task involved in developing an autonomous face recognition system [42]. Texture-oriented extraction technique can aid in extracting roughness, randomness, uniformity, coarseness, regularity, lightness, density, directionality, linearity, phase, quality, smoothness, etc., to enhance the texture of the image [43]. Respectively, the GLCM method as a texture feature extraction procedure can be deployed for texture features based on white and black binary image processing to improve the recognition rate; however, the GLCM method leads to high processing limitation.Several studies have suggested several statistical feature extraction methods, and one of such methods has been proposed in [44]. The geometrical with structural features and edge direction matrix (EDMS) hybrid features extraction method was presented in [22] for online Arabic character recognition. This research mainly contributes a rule-based method for Arabic character recognition based on EDMS and a geometrical feature extraction method. The GLCM (gray-level co-occurrence matrix) and EDMS (edge direction matrixes) were also presented as feature extraction techniques for character recognition in [45]. The GLCM was applied in Arabic and English character recognition but was not ideal for low-resolution characters. We define a binary image texture as black values with spatial distribution properties on a white background. Hence, the statistical methods are suitable because they depend on the spatial distribution of the image values. It describes the pixel distribution and their relationships in the image. Statistical methods are also attractive due to their ease of implementation.


### 2.2. Local Feature Extraction

Local feature extraction was first founded by Ojala et al. [46] and was later improved by Ahonen et al. [47] where the authors applied LBP for facial identification. The LBP method aimed to change the gray-scale appearance into a vector which includes digital codes by comparing the association of the colour value alteration among the adjoining pixels in the circular picture symmetry. Thus, if the exterior parameters do not alter the negative and positive connections between the dominant pixel and adjoining pixels, the illustration of LBP to the appearance is improved. Thus, in a pixel connection, the LBP measure of the picture pixel can be computed by(8)LBPP,R=∑t=0p−1sgt−gc2t,where gc and gt state the gray significance of the focus pixel and P adjoining pixels in a picture neighborhood of range R and s relates to a threshold equation as specified by(9)Sx=1,ifx≥0,0,otherwise.As seen in equation (11), each pixel in the diagram is prearranged into an 8-bit LBP format. Moreover, as a substitute of hard coding the format difference, a possibility evaluation is utilized in fuzzy-LBP to characterize the prospect of a format difference to be coded as “0” or “1,” for instance a piecewise linear fuzzy membership function and a Gaussian-like membership function as mentioned in [48]. By infusing the fuzzy set into LBP as FLBP, a minor image difference will change the fuzzy-LBP histogram marginally as equated to the original LBP histogram. Nonetheless, the membership is a method of the pixel alteration, whose degree may be altered easily by noise. Thus, fuzzy-LBP is slightly subtle to noise.In relation to the difference of the original fuzzy-LBP that employs both indication and amount of pixel dissimilarity, this study determines the fuzzy-membership sign method based on only pixel transformation. Thus, even when a pixel modification is changed by noise, its size changes considerably, but the sign hardly changes, and its membership method is always stable. Therefore, the suggested method is more rigid to noise as compared to fuzzy-LBP. In addition, FLBP partially addresses many subimages handled mainly by SIFT procedures which are then utilized to train Gaussian-integrated approaches in analyzing and improving Fisher vectors for the face verification noise problem by introducing fuzzification in the LBP conversion process [49]. In place of pixel hard coding modification as shown in equation (10), a fuzzy membership method is utilized to characterize the prospect of codes as “0” or “1.” Several membership functions were suggested by prior studies [48, 50, 51]. Among these membership functions, the linear fuzzy membership function as recommended in [50] is the most common as seen in the following equations:(10)bp=1,ifzp≥0,0,ifzp<0,(11)f1,dzp=0,ifzp<−d,0.51+zpd,if−d≤zp≤d,1,ifzp>d,(12)f0,dzp=1−f1,dzp.Therefore,f1,dzp and f0,dzp are the possibilities where pixel alteration zp can be represented as “1” and “0,” correspondingly. The parameter d manages the volume of fuzzification. The benefit of the local format is its toughness to variations, as it only encodes the sign of the pixel alteration. Nevertheless, it is profound to noise that may alter the formatting. Fuzzy-LBP addresses the noise difficult by employing the fuzzy method for pixel difference. This leads to an image difference that mainly alters the fuzzy-LBP histogram slightly. But, the membership method presented in equation (15) exploits magnitude. Thus, the size of a pixel alteration is susceptible to noise irrespective of the fuzzy-LBP method proposed, which is less subtle to noise.To resolve nose alterations, configuration problems were proposed for the face recognition problem as previously adopted in [52, 53].Findings from prior study [54] reveals that the utilization of fuzzy and LBP features in extraction of the texture could possibly improve robustness to noise [50, 55–57]. Yet, these research studies are deliberated as initial since they comprise only fewer validations and only suggested comprehensive approaches for the generation of fuzzy-based texture approaches [51, 58]. Thus, it is evident that the fuzzy-oriented texture approach is more rigid to noise. The applicability of the fuzzy binary pattern for texture representations was reviewed through fuzzification of a diversity of methodologies. Lastly, there is a need to enhance the texture depictions attained to be confirmed with a systematic and comprehensive study on the natural scene. We proposed a novel statistical method BLCM-FLBP to encode local and global feature descriptors by incorporating binary image theory to the representation of local and global patterns of the texture in images.


## 2.1. Global Feature Extraction

Gray-level co-occurrence matrix technique is an important numerical scheme deployed for the category of texture analysis methods. The GLCM method extracts statistical values based on longitudinal allocations of gray area values within a picture [37]. Besides, the GLCM method is based on a second-order feature that makes this approach to be robust for face recognition. The second-order statistic is characterized by the GLCM and gray-level difference method (GLDM) [38].Technically, these two approaches are similar, but the GLCM method is more often adopted by prior studies. The GLCM approach as initiated in [39] consisted of a matrix that allocates options to describe the dispersal of occurrences in a picture. Thus, the GLCM method presents the number of incidences in a gray-scale value and also presents the specific relationships.To calculate features, statistical equations are applied to the values of theP (i, j) matrixes. Accordingly, Haralick et al. [39] also recommended several statistic equations to compute texture features in the GLCM approach as presented in equations (1)–(7), respectively:(1)contrast=∑i,j=0n−1pi,ji−j2,(2)homogeneity=∑i,j=0n−1pi,j1+i,j2,(3)angular second moment=∑i,j=0n−1pi,j2,(4)entropy=−∑i,j=0n−1pi,jlnpi,j,(5)H−variance=∑i,j=0n−1pi,ji−ui2,(6)V−variance=∑i,j=0n−1pi,jj−uj2,(7)correlation=∑i,j=0n−1pi,ji−uij−ujσi2σj2,where pi,j is the standardized value and n is the gray intensities number.The GLCM has been deployed by prior studies for document analysis based on the global analysis approach, such as in iris recognition, fingerprint classification, Chinese sign language recognition as implemented by prior studies [40, 41], and a few related research. Correspondingly, Figure 1 presents how to derive the four concurrent matrices by means of Ng=5 levels and balances [0, 1], [−1, 1], [−1, 0], and [−1, −1] which is distinct as one adjacent pixel in the probable four axis.Figure 1
Co-occurrence matrix generation forNg = 5 levels and 4 dissimilar offsets.It can be seen that two adjacent pixels (2, 1) of the input picture are replicated in thepH correspondence matrix as 3 since there are three pixel intensity values (2) and a pixel strength value (1) contiguous to each other in the input image. The neighboring pixels (1, 2) will occur again 3 times in PH which makes the matrices the same. Likewise, the other 3 matrices Pv,PLD,andPRD are measured.Face recognition is utilized in several systems such as reconnaissance, verification, and security. However, it has become a very perplexing domain due to the orientation of face images, illumination, and variations in facial expressions. It is still a difficult task involved in developing an autonomous face recognition system [42]. Texture-oriented extraction technique can aid in extracting roughness, randomness, uniformity, coarseness, regularity, lightness, density, directionality, linearity, phase, quality, smoothness, etc., to enhance the texture of the image [43]. Respectively, the GLCM method as a texture feature extraction procedure can be deployed for texture features based on white and black binary image processing to improve the recognition rate; however, the GLCM method leads to high processing limitation.Several studies have suggested several statistical feature extraction methods, and one of such methods has been proposed in [44]. The geometrical with structural features and edge direction matrix (EDMS) hybrid features extraction method was presented in [22] for online Arabic character recognition. This research mainly contributes a rule-based method for Arabic character recognition based on EDMS and a geometrical feature extraction method. The GLCM (gray-level co-occurrence matrix) and EDMS (edge direction matrixes) were also presented as feature extraction techniques for character recognition in [45]. The GLCM was applied in Arabic and English character recognition but was not ideal for low-resolution characters. We define a binary image texture as black values with spatial distribution properties on a white background. Hence, the statistical methods are suitable because they depend on the spatial distribution of the image values. It describes the pixel distribution and their relationships in the image. Statistical methods are also attractive due to their ease of implementation.


## 2.2. Local Feature Extraction

Local feature extraction was first founded by Ojala et al. [46] and was later improved by Ahonen et al. [47] where the authors applied LBP for facial identification. The LBP method aimed to change the gray-scale appearance into a vector which includes digital codes by comparing the association of the colour value alteration among the adjoining pixels in the circular picture symmetry. Thus, if the exterior parameters do not alter the negative and positive connections between the dominant pixel and adjoining pixels, the illustration of LBP to the appearance is improved. Thus, in a pixel connection, the LBP measure of the picture pixel can be computed by(8)LBPP,R=∑t=0p−1sgt−gc2t,where gc and gt state the gray significance of the focus pixel and P adjoining pixels in a picture neighborhood of range R and s relates to a threshold equation as specified by(9)Sx=1,ifx≥0,0,otherwise.As seen in equation (11), each pixel in the diagram is prearranged into an 8-bit LBP format. Moreover, as a substitute of hard coding the format difference, a possibility evaluation is utilized in fuzzy-LBP to characterize the prospect of a format difference to be coded as “0” or “1,” for instance a piecewise linear fuzzy membership function and a Gaussian-like membership function as mentioned in [48]. By infusing the fuzzy set into LBP as FLBP, a minor image difference will change the fuzzy-LBP histogram marginally as equated to the original LBP histogram. Nonetheless, the membership is a method of the pixel alteration, whose degree may be altered easily by noise. Thus, fuzzy-LBP is slightly subtle to noise.In relation to the difference of the original fuzzy-LBP that employs both indication and amount of pixel dissimilarity, this study determines the fuzzy-membership sign method based on only pixel transformation. Thus, even when a pixel modification is changed by noise, its size changes considerably, but the sign hardly changes, and its membership method is always stable. Therefore, the suggested method is more rigid to noise as compared to fuzzy-LBP. In addition, FLBP partially addresses many subimages handled mainly by SIFT procedures which are then utilized to train Gaussian-integrated approaches in analyzing and improving Fisher vectors for the face verification noise problem by introducing fuzzification in the LBP conversion process [49]. In place of pixel hard coding modification as shown in equation (10), a fuzzy membership method is utilized to characterize the prospect of codes as “0” or “1.” Several membership functions were suggested by prior studies [48, 50, 51]. Among these membership functions, the linear fuzzy membership function as recommended in [50] is the most common as seen in the following equations:(10)bp=1,ifzp≥0,0,ifzp<0,(11)f1,dzp=0,ifzp<−d,0.51+zpd,if−d≤zp≤d,1,ifzp>d,(12)f0,dzp=1−f1,dzp.Therefore,f1,dzp and f0,dzp are the possibilities where pixel alteration zp can be represented as “1” and “0,” correspondingly. The parameter d manages the volume of fuzzification. The benefit of the local format is its toughness to variations, as it only encodes the sign of the pixel alteration. Nevertheless, it is profound to noise that may alter the formatting. Fuzzy-LBP addresses the noise difficult by employing the fuzzy method for pixel difference. This leads to an image difference that mainly alters the fuzzy-LBP histogram slightly. But, the membership method presented in equation (15) exploits magnitude. Thus, the size of a pixel alteration is susceptible to noise irrespective of the fuzzy-LBP method proposed, which is less subtle to noise.To resolve nose alterations, configuration problems were proposed for the face recognition problem as previously adopted in [52, 53].Findings from prior study [54] reveals that the utilization of fuzzy and LBP features in extraction of the texture could possibly improve robustness to noise [50, 55–57]. Yet, these research studies are deliberated as initial since they comprise only fewer validations and only suggested comprehensive approaches for the generation of fuzzy-based texture approaches [51, 58]. Thus, it is evident that the fuzzy-oriented texture approach is more rigid to noise. The applicability of the fuzzy binary pattern for texture representations was reviewed through fuzzification of a diversity of methodologies. Lastly, there is a need to enhance the texture depictions attained to be confirmed with a systematic and comprehensive study on the natural scene. We proposed a novel statistical method BLCM-FLBP to encode local and global feature descriptors by incorporating binary image theory to the representation of local and global patterns of the texture in images.


## 3. Methodology

### 3.1. Developed Model

This section presents the descriptor face based on FLBP and further aims to develop the novel binary statistical feature for face recognition. The proposed model defines a procedure for extraction of numerical characteristics based on the behavior of pixels in the margins between black and white facilitated by the fuzzy local binary pattern (FLBP). Accordingly, Figure2 and Figure 3 depict the flowchart and the developed model which comprise the preprocessing stage that is deployed by using the Laplacian filter to convert images from grayscale to the binary image black and white. After that, we proceed to extract the feature in our proposed model as shown in Figure 2.Figure 2
Designed flowchart of the novel model.Figure 3
The developed model.In addition, the result of the Laplacian filter entails a white and dark background. Figure2 depicts the flowchart of the novel model which describes the phases of face recognition: (a) which involves the application of the Laplacian filter to improve the edges between the white and black nodes; (b) which entails the application of a low face in the feature extraction stage; followed by (c) which involves features extraction and then (d) which is the training and (e) which is the testing; next is (f) which is the classification phase; and lastly (g) which is the output as the final outcome. Figure 4 shows how the developed model employs Laplacian process for filtering the original image.Figure 4
The original image (a), (c) and the filtered image (b), (d) by the laplacian process.Figure3 depicts the developed model proposed in this study for the binary statistical feature for face resolution. Thus, the developed model comprises three stages, the first stage entails the input binary image followed by the angular second moment, homogeneity, organization angle, correlation, and probability value. The last stage comprises 21 image features.As presented in Figure5, our proposed model uses equations to include features from the binary image values by extracting 21 features for calculating the image angular second moment, correlation, homogeneity, organization angle, and probability value (as shown in Table 1).Figure 5
Neighborhood properties including edge information.Table 1
Types of features and numbers.
Type of the featureNumber of the featureAngular second moment4Homogeneity4Organization angle8Correlation4Probability value1


### 3.2. Angular Second Moment

This feature is an assessment of consistency of an image. A homogeneous scene usually contains only a few binary images but moderately high values ofpi,j as computed byfd13(13)ASMθ=pi,j∑i,ji,j,where θ characterizes 0°, 45°, 90°, and 135° and i,j represents the comparative location in P.


### 3.3. Correlation

This feature evaluates the binary pixel-level lined requirement among the pixels at the quantified situations comparative to one other as presented in the following equation:(14)correlationθ=pi,j∑i,j=1i,j=5pi,j+pscoped pixel,where θ signifies 0°, 45°, 90°, and 135° and i,j represents the relative point in P.


### 3.4. Homogeneity

Homogeneity is the feature that describes the proportions of state of the associations and calculates the measurement of each connection in comparison with the relationships from all angles. The following arithmetic equation (15) defines the pixel regularity:(15)homogeneityθ=pi,j∑i,j=1i,j=5pi,j,where θ denotes 0°, 45°, 90°, and 135° and i,j represents the comparative location in P.


### 3.5. Organization Angle

The organization angle measure indicates the axis of each pixel’s associations, which characterize the percentages for all axis inP1 in comparison with the aggregate number of the edge as shown in the following equation:(16)organization angleθ=P1i,jP1scoped pixel,where θ represents 0°, 45°, 90°, 135°, 180°, 225°, 270°, and 315° and P1 (scoped pixel) represents the aggregate number axis in a particular image.


### 3.6. Probability Value

The probability value is the feature that describes the visual main axis of the picture by depicting the principal axis of the source image. The direction is calculated by locating a state with the highest number of associations based on the following equation:(17)probability valueθ=maxi,jpi,j.Therefore, based on Figure5, the recommended approach consists of two steps which are designated, where, the first step involves the formation of the original image and application of the Laplacian filter to mine the edges among the white and black states of the image. In this step, a neighborhood of 5 × 5 is represented by a set encompassing 25 elements. Moreover, P33 characterizes the strength value of the main pixel and residual values are the amount of neighboring pixels as shown in Figure 5.Similarly, the second step involves the formation of GLCM based on the binary image black and white. In this step, this study derived a new method for the formation called BLCM to facilitate the binary image by replacing the gray part of the image to binary. Thus, Figure6 shows the neighborhood properties of the image which also includes edge information of the image.Figure 6
Examples of some different expressions of the face images in the Yale B dataset.Figure5 depicts the neighborhood image extract properties which includes edge information. Accordingly, in our proposed approach, the 8 position values are employed as events, and the quantity of amounts in the edge image is deposited in the connected cell via the binary-level occurrence matrix (BLCM). Besides, our proposed model is based on a numerical exploration of the associations among the structure border edge pixels in digital images. Thus, each pixel in the picture is associated with a 5 × 5 eight pixels matrix. As illustrated in Figure 7, the middle point Ci,j is associated with the eight pixels in the positions C (i − 1, j − 1), C (i, j − 1), C (i + 1, j − 1), C (i − 1, j), C (i + 1, j), C (i − 1, j + 1), C (i, j + 1), and C (i + 1, j + 1). Every place of the neighboring pixels represents the association axis with the focus pixel of the image.Figure 7
The eight neighboring pixels.Figure7 shows how the eight neighboring pixels are associated for image extraction based on BLCM values which are shown in two ways which include the first edge detection and the second order association.


### 3.7. Application of FLBP for Face Representation

Although in the LBP method all limited descriptors that deploy vector quantization are not robust, a little change in the input image constantly results in a minor alteration in the output. Thus, to improve the rigidity of the operator, the thresholding function is replaced by two fuzzy association methods as suggested in [50]. Thus, to optimize the LBP approach in resolving the uncertainty caused by noise, researchers in [51, 58] assimilated the fuzzy approach to aid in computing the binary structure to address vagueness and improve judgment capability of the LBP approach in resolving noise. Therefore, we followed the suggestion as in [51, 58] in presenting FLBP for face representation in this section. The suggested FLBP approach is integrated in our proposed model to help handle indecision with the doubtfulness initiating from vague information [28, 59–61].Thus, we opted for FLBP for face recognition using the intuitionistic fuzzy sets as shown below.LetU be the general set for an n-pixel neighborhood. Let A be the set of all pixels px with gray state gx greater than or equal to gc and B be the set of all pixels px with gray state gx smaller than gc under the complete set U, individually. Also, an IFS A˜ under the complete set U is specified by(18)A˜=px,μA˜px,νA˜pxpx∈U.Thus,μA˜:U⟶0,1 and νA˜:U⟶0,1 with the form 0≤μA˜px+νA˜px≤1,∀px∈U.The numbersμA˜px and νA˜px represent the amount of association and nonassociation to which a parameter px has either better or lower gray amount than gc in A˜ individually. For each parameter px∈U, the amount πApx=1−μA˜px−νA˜px is called the degree of indecision. It is the point of indecision if px aligns to A˜ or not. The association and nonassociation method of IFS A˜ can be illustrated as shown in the following equations:(19)μA˜px=0,ifgx<gc−T,0.51+h1+gx−gcT,ifgx∈gc−T,gc,T≠0,0.51+gx−gcT+hgx−gcT−1,ifgx∈gc,gc+T,T≠0,1,ifgx≥gc+T,(20)νA˜px=1,ifgx<gc−T,0.51−gx−gcT−h1+gx−gcT,ifgx∈gc−T,gc,T≠0,0.51+h1−gx−gcT,ifgx∈gc,gc+T,T≠0,0,ifgx≥gc+T.For ann×n neighborhood, the contribution CIFLBP of each FLBP code in a particular bin of the FLBP structure is estimated by the association and nonassociation method μA˜px and νA˜px as presented in the following equationfd21:(21)CIFLBPx,y,i=∏r=0k−1briμA˜x+1−briνA˜x,where k∈0,n is the integer of neighboring contributing in the FLBP code calculation, x,y symbolizes the synchronization of the picture, and bri∈0,1 symbolizes the mathematical symbol of the rth bit of the digital illustration of bini. The comprehensive FLBP structure is calculated by adding the effects of all FLBP codes in the inserted picture as presented in the following equation:(22)HIFLBPi=∑x,yCIFLBPx,y,i,i=0,1,…,2k−1.


## 3.1. Developed Model

This section presents the descriptor face based on FLBP and further aims to develop the novel binary statistical feature for face recognition. The proposed model defines a procedure for extraction of numerical characteristics based on the behavior of pixels in the margins between black and white facilitated by the fuzzy local binary pattern (FLBP). Accordingly, Figure2 and Figure 3 depict the flowchart and the developed model which comprise the preprocessing stage that is deployed by using the Laplacian filter to convert images from grayscale to the binary image black and white. After that, we proceed to extract the feature in our proposed model as shown in Figure 2.Figure 2
Designed flowchart of the novel model.Figure 3
The developed model.In addition, the result of the Laplacian filter entails a white and dark background. Figure2 depicts the flowchart of the novel model which describes the phases of face recognition: (a) which involves the application of the Laplacian filter to improve the edges between the white and black nodes; (b) which entails the application of a low face in the feature extraction stage; followed by (c) which involves features extraction and then (d) which is the training and (e) which is the testing; next is (f) which is the classification phase; and lastly (g) which is the output as the final outcome. Figure 4 shows how the developed model employs Laplacian process for filtering the original image.Figure 4
The original image (a), (c) and the filtered image (b), (d) by the laplacian process.Figure3 depicts the developed model proposed in this study for the binary statistical feature for face resolution. Thus, the developed model comprises three stages, the first stage entails the input binary image followed by the angular second moment, homogeneity, organization angle, correlation, and probability value. The last stage comprises 21 image features.As presented in Figure5, our proposed model uses equations to include features from the binary image values by extracting 21 features for calculating the image angular second moment, correlation, homogeneity, organization angle, and probability value (as shown in Table 1).Figure 5
Neighborhood properties including edge information.Table 1
Types of features and numbers.
Type of the featureNumber of the featureAngular second moment4Homogeneity4Organization angle8Correlation4Probability value1


## 3.2. Angular Second Moment

This feature is an assessment of consistency of an image. A homogeneous scene usually contains only a few binary images but moderately high values ofpi,j as computed byfd13(13)ASMθ=pi,j∑i,ji,j,where θ characterizes 0°, 45°, 90°, and 135° and i,j represents the comparative location in P.


## 3.3. Correlation

This feature evaluates the binary pixel-level lined requirement among the pixels at the quantified situations comparative to one other as presented in the following equation:(14)correlationθ=pi,j∑i,j=1i,j=5pi,j+pscoped pixel,where θ signifies 0°, 45°, 90°, and 135° and i,j represents the relative point in P.


## 3.4. Homogeneity

Homogeneity is the feature that describes the proportions of state of the associations and calculates the measurement of each connection in comparison with the relationships from all angles. The following arithmetic equation (15) defines the pixel regularity:(15)homogeneityθ=pi,j∑i,j=1i,j=5pi,j,where θ denotes 0°, 45°, 90°, and 135° and i,j represents the comparative location in P.


## 3.5. Organization Angle

The organization angle measure indicates the axis of each pixel’s associations, which characterize the percentages for all axis inP1 in comparison with the aggregate number of the edge as shown in the following equation:(16)organization angleθ=P1i,jP1scoped pixel,where θ represents 0°, 45°, 90°, 135°, 180°, 225°, 270°, and 315° and P1 (scoped pixel) represents the aggregate number axis in a particular image.


## 3.6. Probability Value

The probability value is the feature that describes the visual main axis of the picture by depicting the principal axis of the source image. The direction is calculated by locating a state with the highest number of associations based on the following equation:(17)probability valueθ=maxi,jpi,j.Therefore, based on Figure5, the recommended approach consists of two steps which are designated, where, the first step involves the formation of the original image and application of the Laplacian filter to mine the edges among the white and black states of the image. In this step, a neighborhood of 5 × 5 is represented by a set encompassing 25 elements. Moreover, P33 characterizes the strength value of the main pixel and residual values are the amount of neighboring pixels as shown in Figure 5.Similarly, the second step involves the formation of GLCM based on the binary image black and white. In this step, this study derived a new method for the formation called BLCM to facilitate the binary image by replacing the gray part of the image to binary. Thus, Figure6 shows the neighborhood properties of the image which also includes edge information of the image.Figure 6
Examples of some different expressions of the face images in the Yale B dataset.Figure5 depicts the neighborhood image extract properties which includes edge information. Accordingly, in our proposed approach, the 8 position values are employed as events, and the quantity of amounts in the edge image is deposited in the connected cell via the binary-level occurrence matrix (BLCM). Besides, our proposed model is based on a numerical exploration of the associations among the structure border edge pixels in digital images. Thus, each pixel in the picture is associated with a 5 × 5 eight pixels matrix. As illustrated in Figure 7, the middle point Ci,j is associated with the eight pixels in the positions C (i − 1, j − 1), C (i, j − 1), C (i + 1, j − 1), C (i − 1, j), C (i + 1, j), C (i − 1, j + 1), C (i, j + 1), and C (i + 1, j + 1). Every place of the neighboring pixels represents the association axis with the focus pixel of the image.Figure 7
The eight neighboring pixels.Figure7 shows how the eight neighboring pixels are associated for image extraction based on BLCM values which are shown in two ways which include the first edge detection and the second order association.


## 3.7. Application of FLBP for Face Representation

Although in the LBP method all limited descriptors that deploy vector quantization are not robust, a little change in the input image constantly results in a minor alteration in the output. Thus, to improve the rigidity of the operator, the thresholding function is replaced by two fuzzy association methods as suggested in [50]. Thus, to optimize the LBP approach in resolving the uncertainty caused by noise, researchers in [51, 58] assimilated the fuzzy approach to aid in computing the binary structure to address vagueness and improve judgment capability of the LBP approach in resolving noise. Therefore, we followed the suggestion as in [51, 58] in presenting FLBP for face representation in this section. The suggested FLBP approach is integrated in our proposed model to help handle indecision with the doubtfulness initiating from vague information [28, 59–61].Thus, we opted for FLBP for face recognition using the intuitionistic fuzzy sets as shown below.LetU be the general set for an n-pixel neighborhood. Let A be the set of all pixels px with gray state gx greater than or equal to gc and B be the set of all pixels px with gray state gx smaller than gc under the complete set U, individually. Also, an IFS A˜ under the complete set U is specified by(18)A˜=px,μA˜px,νA˜pxpx∈U.Thus,μA˜:U⟶0,1 and νA˜:U⟶0,1 with the form 0≤μA˜px+νA˜px≤1,∀px∈U.The numbersμA˜px and νA˜px represent the amount of association and nonassociation to which a parameter px has either better or lower gray amount than gc in A˜ individually. For each parameter px∈U, the amount πApx=1−μA˜px−νA˜px is called the degree of indecision. It is the point of indecision if px aligns to A˜ or not. The association and nonassociation method of IFS A˜ can be illustrated as shown in the following equations:(19)μA˜px=0,ifgx<gc−T,0.51+h1+gx−gcT,ifgx∈gc−T,gc,T≠0,0.51+gx−gcT+hgx−gcT−1,ifgx∈gc,gc+T,T≠0,1,ifgx≥gc+T,(20)νA˜px=1,ifgx<gc−T,0.51−gx−gcT−h1+gx−gcT,ifgx∈gc−T,gc,T≠0,0.51+h1−gx−gcT,ifgx∈gc,gc+T,T≠0,0,ifgx≥gc+T.For ann×n neighborhood, the contribution CIFLBP of each FLBP code in a particular bin of the FLBP structure is estimated by the association and nonassociation method μA˜px and νA˜px as presented in the following equationfd21:(21)CIFLBPx,y,i=∏r=0k−1briμA˜x+1−briνA˜x,where k∈0,n is the integer of neighboring contributing in the FLBP code calculation, x,y symbolizes the synchronization of the picture, and bri∈0,1 symbolizes the mathematical symbol of the rth bit of the digital illustration of bini. The comprehensive FLBP structure is calculated by adding the effects of all FLBP codes in the inserted picture as presented in the following equation:(22)HIFLBPi=∑x,yCIFLBPx,y,i,i=0,1,…,2k−1.


## 4. Experiments and Results

In this section, the developed novel binary statistical feature for face resolution is evaluated using simulations employed on 2 datasets Yale B and FEI facial databases [62, 63]. The first dataset Yale Face Database comprises 165 gray measure images of 15 persons [62, 63]. The Yale Face Database also contains 11 images per subject, one each with diverse facial appearance as presented in Figure 6.Furthermore, the second dataset FEI face database [64, 65] comprises face images taken from 200 individuals (100 males and 100 females). Each individual comprises 14 collected images in the database which amounts to a total of 2800 colour face images, each reaching 180 degrees of rotation changes. Moreover, each face in the database is primarily from 19–40 years old, based on different appearance, hair, and separate individual decoration as shown in Figure 6. Hence, the dataset is tested based on different degrees and different expressions towards providing support to extract the image features that are to be utilized in evaluating the performance of our developed novel binary statistical feature for face resolution.Figure8 shows examples of some different angles with 180 degrees of rotation changes of the face images in the FEI second dataset. Correspondingly, since this paper aims to propose an improved global statistical feature method and local feature based on the fuzzy approach and to find the best classifier efficacy for this approach, we proceeded to apply a random forest and complex system classifiers. Then, we assessed the efficacy of the novel approach by associating it with the gray-level co-occurrence matrix (GLCM) approach to evaluate the angular second moment (ASM), homogeneity difference; variance, and correlation (see Table 2). To this end, the evaluation was deployed at angles of 0, 45, 90, and 135 for FLBP and bag of word (BOW).Figure 8
Examples of some different angles with 180 degrees of rotation changes of the face images in the FEI.Table 2
Types of features, proposed approach, and GLCM.
Type of featureProposed methodGLCMAngular second moment44Homogeneity44Organization angle8—Contrast—4Entropy—4Variance—4Correlation44Probability value1—Total2124In our experiment, the dataset was then divided into training datasets and evaluating datasets, after which the authors assessed a training dataset derived from a dataset of about 60% to 70%. Results from the test indicate that our new approach achieves higher correct amounts than the GLCM. Moreover, in our test, different values of datasets were evaluated to identify the higher performance. Our results suggest that the random forest obtained a better performance of 63% training dataset as compared to GLCM.Figure9 shows the evaluation results of the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP) and our proposed approach from 60% to 70% separation of the two datasets and results of the neural network, random forest. Likewise, Figure 10 depicts the results of the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP) and our proposed approach from 60% to 70% separation of the B dataset and the results of the neural network, random forest.Figure 9
The average accuracy rate series of experiments on proposed methods using the FEI and Yale B datasets.Figure 10
The classification results of the proposed method using 60% to 70% of the training data (FEI and Yale B datasets) and the classification performance of NN and RF.Results from Figures9 and 10 indicate that our proposed approach achieved better performance with the random forest with 63% training dataset accuracy rate. Thus, the novel approach outclassed a 63% training dataset with the random forest. In addition, results from Figures 11 and 12 reveal that the proposed approach obtains better performance of about 94.54% as compared to the BLCM method which obtained a value of 90.77% in the random forest classifier (Table 3).Figure 11
The average accuracy rate series of experiments on BLCM using the FEI and Yale B datasets.Figure 12
The classification results of the BLCM method using 60% to 70% of the training data (FEI and Yale B datasets) and the classification performance of NN and RF.Table 3
The mean and standard deviation results for the BLCM methods using the random forest and the neural network (NN) classifier with the FEI dataset and the Yale B dataset.
MethodsMeanStandard deviationRF/FEI90.770.65RF/Yale B90.440.79NN/FEI92.090.55NN/Yale B91.220.74Next, the test was deployed in five iterations and the result is presented indicates that the mean value of the proposed approach is higher than the mean for the binary-level co-occurrence matrix, gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP). Moreover, the proposed approach obtains a standard deviation which is less than the other methods (binary-level co-occurrence matrix, gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP)).In Table4, the mean of values of the FLBP with the FEI dataset was (85.09% RF and 89.72% NN) and with the Yale B dataset was (87.10% RF and 86.44%). The FLBP method obtained a standard deviation with the FEI dataset (0.68% RF and 0.47% NN) and with the Yale B dataset obtained (0.73% RF and 0.76% NN). Five experiments were performed for each method in one classifier. Figure 13 shows the average values of each classifier.Table 4
The mean and standard deviation results for the FLBP methods using the random forest and the neural network (NN) classifier with the FEI dataset and the Yale B dataset.
MethodsMeanStandard deviationRF/FEI85.090.68RF/Yale B87.100.73NN/FEI89.720.47NN/Yale B86.440.76Figure 13
The average accuracy rate series of experiments on FLBP using the FEI and Yale B datasets.The dataset was partitioned into a training set and a testing set. The training dataset for the experiment was about 60% to 70% of the original dataset as shown in Figure14.Figure 14
The classification results of the FLBP method using 60% to 70% of the training data (FEI and Yale B datasets) and the classification performance of NN and RF.The random forest followed by the neural network (NN) produced acceptable accuracy rates. The experiment was continued by analyzing the result consistency of the random forest classifier which had a highly better result than that of BLCM, GLCM, BOW, and FLBP in each classifier. The MLBP was implemented following the program. The RF is a set of learning tools for classification. In this study, the confidence number of trees was fixed at 47 when using RF.In Table5, the mean of values of the GLCM with the Yale B dataset was (42.29% RF and 39.21% NN) and with the FEI dataset was (39.97% RF and 46.33% NN). However, the mean value for BOW with the Yale B dataset was (70.62% RF and 76.18% NN) and with the FEI dataset was (82.21% RF and 86.42% NN). The GLCM method obtained a standard deviation with the Yale B dataset as (0.87% RF and 0.95% NN) and with the FEI dataset as (0.68% RF and 0.95 NN). However, the standard deviation for BOW with the Yale B dataset was (0.90% RF and 0.85% NN) and with the FEI dataset was (0.73% RF and 0.88% NN). Five experiments were performed for each method in one classifier. Figure 15 shows the average values of each classifier.Table 5
The mean and standard deviation results for the GLCM and BOW methods using the random forest and the neural network (NN) classifier with the FEI dataset.
MethodsYale B datasetFEI datasetMeanStandard deviationMeanStandard deviationGLCM/RF42.290.8739.970.68BOW/RF70.620.9082.210.73GLCM/NN39.210.9546.320.95BOW/NN76.180.8586.420.88Figure 15
The average accuracy rate series of experiments on GLCM and BOW using the FEI and Yale B datasets.Figure16 and Figure 17 present the results achieved with the FEI and Yale B datasets from 60 to 70% of the original data which were used for the training for GLCM and BOW methods. Table 6 shows the descriptive analysis of the five tests in the proposed method, BLCM, GLCM, FLBP, and BOW with NN and RF.Figure 16
The classification results of GLCM and BOW methods using 60% to 70% of the training data (FEI dataset) and the classification performance of NN and RF.Figure 17
The classification results of GLCM and BOW methods using 60% to 70% of the training data (Yale B dataset) and the classification performance of NN and RF.Table 6
The descriptive analysis of the five tests.
MethodsYale B datasetFEI datasetAccuracyStandard deviationAccuracyStandard deviationProposed method/random forest94.540.7193.160.62GLCM/random forest42.290.8739.970.68BOW/random forest70.620.9082.210.73FLBP/random forest87.100.7385.090.68Proposed method/NN93.610.4495.270.45GLCM/NN39.210.9546.320.95BOW/NN75.420.8586.420.88FLBP/NN86.440.7689.720.47Furthermore, results from the experiment are compared to results from a few prior studies (see Table7). Among these studies, Patil and Talbar [66] designed a facial identification that integrates LBP, Gabor, and their fusion method. The authors applied principal component analysis (PCA) to decrease the image dimension. Besides, Dong [67] designed an effective theoretical method for face identification based on LBP smoothness and PCA to minimize the effect of illumination conditions and altering facial expressions. The researchers tested their model based on image robustness, rotation variations, illumination, etc.Table 7
Evaluation of the prior approach with the proposed approach using classification performance RF.
Method referenceTechniqueAccuracy (%)[66]Gabor wavelet, LBP92.00[67]PCA + LBP92.88[68]ALBP with BCD86.45[69]Fusion Gabor, LBP, PCA94.00Proposed methodFLBP-BLCM94.54Innovative face recognition approach that can be applied in an unrestrained setting was proposed in [68]. Their approach is based on the facial picture LBP which measures the variation among faces by deploying the Bray–Curtis difference benchmark. The authors further propose a new technique called the amplified binary approach which is deployed by combining the standard of area of nonstructured and structured patterns that helps in improving the LBP surface texture using integrated structured uniform patterns that extract meaningful data associated with local descriptors. However, NN-based methods were applied for feature extraction from facial images. This method dynamically groups neurons to a higher order; hence, it is robust against environment variations [70, 71]. An advantage of NN is its high accuracy, only when a large database is trained, and disadvantages of NN are it requires long time to train and the database should be extremely large to have high accuracy.For the random forest construction, a set of decision trees with regulated variations is used. An example of the random subspace method is the selection of features from random subset stochastic discrimination implementation methods. This comparison between the two methods (NN and random forest) gives more confidence and satisfactory results because these two methods are more common.


## 5. Discussion

This paper discusses a novel binary statistical feature for face recognition after which, tests were deployed to test the proposed model and further compare the performance of the model with the existing approaches. Thus, the experiments were aimed at assessing the performance of the proposed approach by using the BLCM-FLBP approach separately and also integrating both procedures based on the classification accuracy rate of a few classification methods. Moreover, approaches such as random forest and backpropagation neural network classifiers were applied in the evaluation. To carry out the test, the dataset was split into training and testing datasets. In the test, different proportions of training and testing datasets were evaluated to define the approach that has the best performance. The training dataset were derived from a dataset of percentages between 60% and 70%. Results from the experiment indicate that the proposed BLCM-FLBP obtained higher correct rates as compared to the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP) as presented in Figures16 and 17, respectively.In addition, results reveal that the proposed method possesses better performance based on the average and standard deviation value derived from the experiment as compared to the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP) in all cases. Our results also suggest that the random forest with a 63% training dataset obtained the better performance. This is evident due to the correction rate of GLCM being 46.32. Besides, the proposed method achieved the maximum performance with the random forest with a 63% training dataset, with a precision rate of 95.27%. The proposed method outclassed a 63% training dataset with the random forest. Based on the analysis presented in Figure10, it is noted that the proposed approach obtained the maximum efficacy, at 95.27%, while the GLCM approach obtained 42.29%, the BOW method obtained 82.21%, and the FLBP method obtained 85.09 in the same case.Furthermore, after repeating the experiment on several iterations for the random forest with the 68% training dataset for gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP), a random forest and backpropagation neural network with a 68% training dataset for BLCM-FLBP has been performed five times. Results from Table4 based on the descriptive t-test statistics for the Yale dataset specify that the mean value of the proposed approach is given as 94.54%, which was higher than the average for GLCM given as 42.29%, whereas BOW obtained a value of 70.62% and FLBP obtained a value of 87.10%. Likewise, results from the FEI dataset as shown in Table 8 suggest that the proposed method obtained a value of 93.16%, which was higher than the mean for GLCM which obtained a value of 39.97%, whereas, BOW obtained a value of 82.21% and FLBP obtained a value of 85.09%.Table 8
The mean and standard deviation results for the proposed methods using the random forest and the neural network (NN) classifier with the FEI dataset and Yale B.
MethodsMeanStandard deviationRF/FEI93.160.62RF/Yale B94.540.71NN/FEI95.270.45NN/Yale B93.610.44In addition, the results show that the proposed approach attained a standard deviation of 0.71 with the Yale dataset, which was lesser than the GLCM approach of 0.87, BOW with 0.90, and lastly FLBP with 0.73. Similarly, by considering the FEI dataset, our proposed approach obtained a standard deviation value of 0.62 which was lesser than the GLCM method value of 0.68, BOW value of 0.73, and FLBP value of 0.68. Moreover, the results confirm that BLCM-FLBP gave the highest accuracy rate in all experiments than the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP).Besides, the analysis indicates that the implemented classification method is more effective with the proposed approach features as compared to other approaches. This is evident in results presented in Figures9 and 10, where the classification method provides a better performance with BLCM-FLBP than GLCM, BOW, and FLBP. Lastly, the results from the experiment indicate that the proposed method is less adaptable than the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP) at different percentages of training and testing datasets separating.The outperformance technique is implemented in all of them which are using the gray-level image to extract the face features. The technique basically extracts the local and global features of the face image. However, there are a few drawbacks of the existing techniques: low resolution, illumination, gray image, and duplication of the pixels so that the edge of the face image is difficult to be determined. Due to that the face image is not well describing the spatial distribution of the value in the image, the descriptive face features are unable to be extracted. Thus, it will distract the accuracy performance. Other than that, the existing works only relied on the global face features, without considering the local face features in their accuracy performance observation. From that problem, a new combination of local and global face feature extraction technique is proposed. To overcome the problem of gray-level face images in the GLCM-based method, the enhancement of GLCM is proposed by using the binary local co-occurrence matrix (BLCM) to extract global face features. To extract more unique features that are based on the shape of the face image, the local face feature extraction technique is combined with the BLCM. The method of feature extraction technique is called the fuzzy local binary pattern (FLBP). Therefore, the new combination technique is known as BLCM-FLBP.


## 6. Conclusions and Future Scope

The study has developed an improved global feature extraction technique based on the numerical analysis of the behaviors of edge pixels in images as well as the fuzzy local feature. The proposed method is applied on the low-resolution face dataset. Obtained results from this study suggest that a set of degree can be accessible as the associations among the picture after formulating and standardizing the dataset. The information is retained in matrices referred to as the binary-level co-occurrence matrix (BLCM), and the intuitionistic fuzzy feature approach employed to encode the structure by incorporating the intuitionistic fuzzy set (IFS) procedure in the representation of the structure of images. Furthermore, the proposed approach is an extended version of the FLBP approach which is based on IFS theory which contributes to the dissemination of the FLBP.We have applied the values of FLBP matrices in the novel approach. Then, we proceeded to test and associate our novel approach with the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP) by applying the multilayer network, random forest. Findings from the experiment indicate that the novel approach produces greater performance as compared with the gray-level co-occurrence matrix (GLCM), bag of word (BOW), and fuzzy local binary pattern (FLBP). The proposed approach presented a maximum performance value of 94.53% obtained with the random forest based on 63% training for the Yale B data and 92.98% obtained with the neural network based on 68% training for the FEI data. However, future work will involve an improved approach that will be able to find and process effective image representations for the occurrences in the images. Secondly, the improved approach will be enabled to be used in texture discrimination in dividing the image according to the type of local and global as feature extraction stages towards developing different system applications in the pattern recognition domain.



---

*Source: 4967034-2020-06-01.xml*