LGLG-WPCA: An Effective Texture-based Method for Face Recognition

LGLG-WPCA: An Effective Texture-based Method for Face Recognition

Chaorong Li1,2, Wei Huang1,and Huafu Chen1 This work is supported by the China Postdoctoral Science Foundation (No.2016M602675), Foundation of the Central Universities in China(No.ZYGX2016J123), Project of Education Department of Sichuan Province (No.16ZA0328), Project of Sichuan Science and Technology Program (No.2018JY0117), Science and Technology Project of Yibin of China (2016).(email: lichaorong88@163.com). 1University of Electronic Science and Technology of China, Chengdu 611731, China 2Department of Computer Science and Information Engineering, Yibin University, Yibin 644000
Abstract

In this paper, we proposed an effective face feature extraction method by Learning Gabor Log-Euclidean Gaussian with Whitening Principal Component Analysis (WPCA), called LGLG-WPCA. The proposed method learns face features from the embedded multivariate Gaussian in Gabor wavelet domain; it has the robust performance to adverse conditions such as varying poses, skin aging and uneven illumination. Because the space of Gaussian is a Riemannian manifold and it is difficult to incorporate learning mechanism in the model. To address this issue, we use LEMG[1] to map the multidimensional Gaussian model to the linear space, and then use WPCA to learn face features. We also implemented the key-point-based version of LGLG-WPCA, called LGLG(KP)-WPCA. Experiments show the proposed methods are effective and promising for face texture feature extraction and the combination of the feature of the proposed methods and the features of Deep Convolutional Network (DCNN) achieved the best recognition accuracies on FERET database compared to the state-of-the-art methods. In the next version of this paper, we will test the performance of the proposed methods on the large-varying pose databases.

Gabor wavelet, Multivariate Gaussian, Log-Euclidean Gaussian, Face recognition, WPCA.

erence papers position the abstract like regular

I Introduction

Because of the potential application value, face recognition has always been a research hotspot in the field of machine vision, such as identity authentication, access control system and online transaction. However, unfavorable factors constitute great challenges to the automatic face recognition. These adverse factors include: image noise, low resolution image, uneven illuminations and varying poses, skin aging, facial expressions and facial occlusion. Among these factors, uneven illuminations, facial occlusion and varying poses are most prone to occur in unconstrained environments.

To face recognition, the effects of uneven illumination can be counteracted by conventional image processing techniques like the simple and efficient preprocessing chain [2]. However, facial occlusion and varying pose are more difficult than uneven illuminations, because the conventional image processing methods cannot correct or reconstruct a high fidelity face image for the damaged image[3].

In general, face recognition methods against adverse factors fall into two categories. (1) Calculate the face features directly from face image using Deep Convolutional Network (DCNN) based methods such as DeepID[4], FaceNet[5], VGGFace[6] and PCANet[7]. These methods use a large number of samples to adapt to the face recognition in different poses, different expressions, and lighting. (2) Preprocessing-based feature extraction method (see Figure1), which is the s scheme adopted by most face recognition methods. In preprocessing-based method, the preprocessing step is firstly used to remove or counteract the advertise factors such as noise and varying pose, and then texture feature extraction descriptors (like LBP[8], LTP[2], SIFT[9] HOG[10] and Gabor[11]) or DCNNs are used to produce the face features.

Recently, a few effective preprocessing-based methods have been developed to deal with the most common and difficult large-varying-pose problem: For example, DeepFace[12] uses 3D to align faces; TP-GAN[13] uses Generative Adversarial Nets(GAN) [14] to rectify (frontalize) face image and Light CNN[15] for face recognition; HF-PIM[16] combines GAN and 3D Morphable Model[17] to frontalize the face and then use Light CNN to extract facial features; DR-GAN[18] trains the Encoder-Decoder network while using GAN to frontalize the faces. Large varying poses or occlusions may be corrected (frontalized) by using 3D Morphable model or GAN. However, the 3D Morphable or GAN based methods cannot rectified the small varying expressions or varying poses and moreover, the rectified images will produce more or less deviation compared with the ground truth images.

Fig. 1: Preprocessing texture feature extraction method

In fact, because small varying expressions and poses are inevitable in the applications of face recognition, it is important that feature extraction method needs to have robust performance to the small variations. In this paper, we propose a preprocessing-based texture feature extraction method (called LGLG-WPCA) for face recognition. LGLG-WPCA extracts face features using multidimensional Gaussian models on Gabor wavelet domain; it is a nice texture feature descriptor and is insensitive to noise and is also robust to small varying poses and expressions. Previous methods [25, 45] construct the covariance matrixes to represent image and these methods ignore the mean information of the subbands of Gabor wavelet. Multidimensional Gaussian model is an extension of the covariance matrix, and it contains more information than covariance matrix. However, both covariance matrix and multidimensional Gaussian model also belong to Riemannian manifold. When comparing two covariance-matrix based models in Riemannian space, the computational cost is much higher than that of comparing two vectors in Euclidean space; furthermore, it is difficult to incorporate a learning mechanism to improve the performance of the models in Riemannian space. In order to reduce the computational cost and improve the performance, we use LEMG[1] to embed multivariate Gaussian model into Euclidean space and use Whitening Principal Component Analysis (WPCA) to learn discriminative face features from the embedded Gaussian model.

Ii Related work

Gabor wavelet (Gabor filters) is a useful texture extraction tool in the field of computer vision. in a number of researches. Face recognition methods based on Gabor wavelet have been reported in large numbers[19, 22, 20, 23]. Because Gabor wavelet is a very redundant transform, researchers used Principal Component Analysis (PCA) or Liner Discriminant Analysis (LDA) to compress the Gabor subbands. For example, Gabor-Fisher classifier[19, 20] applied the Fisher linear discriminant to obtain the discriminative face feature from Gabor wavelet subbands which are yielded from image face; Gabor-wavelet based kernel PCA[21] used kernel PCA to compress the Gabor wavelet subbands. Some researchers[22, 23] encoded the Gabor subbands by using Local Binary Pattern (LBP), and then obtained the face features.

Means and standard-deviations of the Gabor wavelet subbands (Gabor features) are the discriminative information of images, and they can be used as the image features; however, the low-dimensional features composed of means and standard-deviations are difficult to distinguish between different faces which are highly similar between-classes and large varying within-classes. Compared with means and standard-deviations, covariance matrix is an effective measure for augmenting standard deviation features. Given the number of Gabor wavelet subbands is , the dimensionality of mean and standard-deviation features is , whereas the size of covariance matrix features is and the different value of covariance matrix is . Therefore, covariance matrix contains more discriminative information than that of the features composed of mean and standard deviation.

Covariance matrix has been widely used to image representation[24, 25, 26, 27, 28, 29]. In [24], Tuzel et al. map each pixel of image to a 5-dimensional feature space (intensities, norm of first and second order derivatives of intensities), and use a covariance matrix to model these features. Yanwei et al.[25] proposed a covariance-matrix based method to model Gabor subbands; in their work, both pixel locations and Gabor features are employed to construct the covariance matrices. Wang et al.[26] use covariance matrix for image set based face recognition. Recent years, covariance or covariance matrix are introduced into deep learning-based networks[30, 31]. Because covariance matrix is Riemannian manifold, Euclidean distance cannot be directly used as the measure of covariance matrix. Therefore, Tuzel et al.[24] proposed Riemannian distance as the measure of covariance matrix. Given two covariance matrices and , Riemannian distance is defined as:

(1)

where are the generalized eigenvalues of and . The computation cost of Riemannian distance in the feature matching step is expensive because we should calculate the generalized eigenvalues of and in (1). Researchers have developed a embedding approach which transforms the covariance matrix into a linear space, called Log-Euclidean distance (LED)[32, 33]. LED is expressed as:

(2)

where log is matrix logarithm operator and denotes the Matrix Frobenius Norm (MFN). Besides, Minh et al.[27] provided a finite-dimensional approximation of the Log-Hilbert-Schmidt (Log-HS) distance between covariance operators to image classification.

Covariance matrix is a special case of multivariate Gaussian distribution which parameters consist of mean vector and covariance matrix. Similar to covariance matrix, the space of Gaussian is not a linear space but a Riemannian manifold. Peihua et al. [1] used Lie group to embed multivariate Gaussian in to Euclidean space, called Local Log-Euclidean Multivariate Gaussian (LEMG). Embedding form of Gaussian Euclidean space is denoted by

(3)

where and are the covariance matrix and mean parameters of Gaussian. The similarity of two Gaussian models is denoted by

(4)

Multivariate statistical models including covariance-based methods have two shortcomings. First, because of the complicated matrix operation, the computation of the measure in a Riemannian space is time-consuming compared to the computation in a Euclidean space. Second, it is difficult to resort to an effective learning approach to improve the performance. Recently a few methods have been proposed to address these shortcomings. For example, Harandi et al. [34] use an orthonormal projection model to project the high-dimensional manifold to a low-dimensional vector. Wang et al.[28] developed a discriminative covariance-oriented representation learning framework to deal with face recognition. Different from the methods mentioned above, we proposed an efficient method by WPCA to learn the face features from the multivariate Gaussian in Gabor domain. Our methods can efficiently describe the texture feature of face and it is robust to small variance of face such as facial expressions.

Iii Gabor wavelet


Fig. 2: Gabor wavelet decomposition.

Gabor Wavelet is an efficient tool for image analysis. It is defined as the convolution on the image with a set of Gabor filters. The 2D Gabor filter is the product of a Gaussian function and the complex exponential function, denoted by[19, 25]

(5)

where ; and define the direction and scale of the Gabor filters (Therefor, is called Gabor wavelet), denotes the norm operator; is the wave vector which has the following express

(6)

where , is the maximum frequency; ; is the spacing factor between kernels in the frequency domain. In this work, and takes the values from set and takes the values from set , where and are the maximum number of directions and scales. Given -direction and -scale of Gabor wavelet is performed on an image, there will be producted responses (subbands). The subbands of the Gabor wavelet are complex and the amplitudes of subbands are used in this paper. Fig.2 shows an 8-direction and 4-scale decomposition of Gabor wavelet.

Iv Learning Gabor Log-Euclidean Gaussian (LGLG) for face recognition

In the proposed method, Gabor wavelet is used to extract the texture feature of face. However, there are very a few number subbands produced by Gabor wavelet. Previous work use covariance matrix to capture the subbands[25]. However, covariance matrix ignores the means information of subbands. LGLG uses multivariate Gaussian which contains both the covariance and means to model the subbands. There are two steps in LGLG. The first step is to extract the local feature using Gabor Log-Euclidean Gaussian (GLG); the second step is to Learn GLG (LGLG) for face recognition.

Iv-a Extract local feature using Gabor Log-Euclidean Gaussian


Fig. 3: Extract local feature using GLG.

The detailed scheme of constructing a GLG on a block of face is shown in Fig.3. Gabor wavelet is first used decompose the local block of face image and each of the decomposed magnitude subband of Gabor wavelet is vectorized into 1-dimension vector, denoted by , where is the length of . To perform a -direction and -scale decomposition, () 1-dimension vectors are to be yielded. Then all of vectors produced from the subbands are formatted as following matrix:

(7)

If is regarded as observation matrix of a random vector and each column of the matrix corresponds to the observations of a random variable, then is approximately Gaussian distribution [35]. We can calculate the parameter covariance matrix and mean of Gaussian on by using maximum Likelihood Estimation (MLE).

(8)
(9)

According to the estimated and , we use EQ.4 to embed the Gaussian model constructed from subbands of Gabor wavelet in Euclidean space and vectorize it into a local feature vector, denoted by

(10)

where . Sign denotes the vectorization of matrix.

Iv-B Learning GLG using WPCA (LGLG-WPCA) for face recognition

We learning GLG using WPCA for face recognition, called LGLG-WPCA. In LGLG-WPCA, we use three preprocessing approaches (Gamma correction, Difference of Gaussian filter and contrast normalization) described in [2] to counter the effects of illumination variations. Before extracting face features, the image is divided into local square blocks and GLG is applied to all the blocks producing vectors denoted by . The feature vectors of the local square blocks in the image are concatenated into a high-dimensional vector , and Whitening Principal component analysis (WPCA) is used to project the high-dimensional vector into a low-dimensional feature vector. The flowchart of LGLG-WPCA is shown in Fig.4


Fig. 4: Learning Gabor Log-Euclidean Gaussian using WPCA (LGLG-WPCA) for face recognition

WPCA is more efficient than Principal component analysis (PCA) for face recognition under the condition of the training set has single sample per person. Compared to PCA, the extra benefit of WPCA is it normalizes the contribution of each principal component by using whitening transformation which divides the principal components by standard deviations.

The columns of are composed of the eigenvectors of the covariance matrix. A high-dimensional vector can be compressed into a low-dimensional vector by projecting it on , that is:

(11)

The second step of WPCA is to transform the into by using whitening transformation:

(12)

where . Then the projected WPCA features are

(13)

However, WPCA may suffer performance degradation problem when the eigenvalues of the covariance matrices are very small or close to zero. If the eigenvalues of covariance matrix are too small and we use WPCA to whitening the features, it will over-amplify the influence of the small eigenvalues in feature matching. To address the issue, we standardize the WPCA features with z-score standardization (ZSCORE), which is denoted as:

(14)

where MEAN and STD denote the mean and standard deviation of , respectively. In face recognition, standard Euclidean distance is used as the similarity between two face images.


Fig. 5: Learning Gabor Log-Euclidean Gaussian using WPCA based on key points (LGLG(KP)-WPCA) for face recognition.

In addition, we can also use LGLG to extract the face features based on local regions centered on corresponding key points. LGLG-WPCA based on key points is called LGLG(KP)-WPCA. Fig.5 shows the flow chart of LGLG(KP)-WPCA. In LGLG(KP)-WPCA, we use SMD [48], which can yield 49 key points on a face images, to detect the key points and 21 key points are selected. In each key point, we extract a local square block around a key point and in each square block we use LGLG to extract the local feature . Similar to LGLG-WPCA, all the local features (where ) are concatenated into a high-dimensional feature vector and WPCA is used to compress the high-dimensional feature vector into a discriminative and low-dimensional feature vector.

V Experiments


Fig. 6: Samples selected from gallery subset and the three subsets (fb, fc, dup1 and dup2). The numbers under the corresponding images are the labels of the corresponding persons.

Our evaluation is carried out on standard FERET database. Standard FERET contains four subsets: a gallery, a facial expression subset (fb), an illumination subset (fc), and two duplicate subsets (dup I and dup II). Dup I probe images were obtained at different times. The harder dup II probe subset is a subset of dup I; the images are in dup II are taken only at least 18 months. Some images selected from these subsets are shown in Fig.6. In this dataset, the images were cropped to and each image was divided into blocks (the block size is ). In LGLG, 4-scale and 8-direction Gabor decomposition is performed and parameter of Gabor is set to . Because there are 1196 person in the gallery, we use WPCA to compress the GLG features of all the local square blocks into an 1196-dimension feature vector and Euclidean norm 2 is used as the similarity of two feature vectors.

The parameter of LGLG-WPCA will affect the performance of recognition. These parameters include the Block Size (B-Size) of the divided local square blocks of images, and the parameters of Gabor wavelet which consist of the , the local Window Length (WinLen), the number of directions and scales of Gabor wavelet. We tested the recognition accuracies of LGLG-WPCA and LGLG(KP)-WPCA with respect to different parameter combinations via experiments on subset dupII. The test results of LGLG-WPCA and LGLG(KP)-WPCA are listed in Table I and Table II. To LGLG-WPCA, there are two parameter combinations which obtain the best recognition accuracy 97.44%: WinLen(9) Sig(1.2) Direct(8) Scale(5) B-Size (1313); WinLen(9) Sig(1.0) Direct(8) Scale(4) B-Size (1515). In the following experiments we use the second parameter combination for LGLG-WPCA. To LGLG(KP)-WPCA, the best parameter combinations which obtains the best recognition accuracy 91.02% is: WinLen(9) Sig(1.2) Direct(8) Scale(5) B-Size (2222).

WinLen Sig () Direct(U) Scale (V) B-Size Acc.
11 2.0 8 5 95.72
11 1.8 8 5 95.72
11 1.4 8 5 95.72
11 1.2 8 5 96.15
11 1.2 8 4 95.72
9 2.0 8 5 95.72
9 1.4 8 5 96.15
9 1.0 8 5 95.72
9 1.2 8 5 97.44
9 1.8 8 5 85.89
9 1.2 8 5 87.17
9 1.2 8 4 81.19
9 1.8 8 5 94.87
9 1.4 8 5 96.58
9 1.2 8 5 97.08
9 1.0 8 5 96.15
9 1.8 8 4 95.29
9 1.6 8 4 95.72
9 1.2 8 4 97.08
9 1.0 8 4 97.44
7 2.0 8 5 96.15
7 1.4 8 5 97.44
7 1.2 8 5 97.08
7 1.0 8 5 96.58
7 0.8 8 5 95.72
TABLE I: The recognition accuracy (percent) of LGLG-WPCA with respect to different parameters on subset dup2.
WinLen Sigma () Direct(U) Scale (V) B-Size Acc.
11 2.0 8 5 87.17
11 1.8 8 5 87.17
11 1.2 8 5 86.32
9 1.2 8 5 89.74
9 1.8 8 5 90.6
9 2.0 8 5 89.74
9 1.8 8 5 90.17
9 1.2 8 5 91.02
9 1.2 8 4 88.88
9 1.8 8 5 88.88
9 1.8 8 4 87.17
9 1.6 8 4 87.6
9 1.2 8 4 88.46
9 1.0 8 4 86.75
7 2.0 8 5 87.17
7 1.5 8 5 88.46
7 1.2 8 5 88.88
7 1.0 8 5 88.03
7 0.8 8 5 83.33
TABLE II: The recognition accuracy (percent) of LGLG(KP)-WPCA with respect to different parameters on subset dup2.

We compared the proposed method LGLG with the state-of-the-art methods including texture descriptors (such as LBP based method MDML-DCPs+WPCA[36] and Gabor based method LGBP+LGXP+LDA[37]) and DCNN methods (such as VGGFace[6], PCANet [7], ResNet50[49, 47] and SENet[46, 47]), and the recognition results are shown in Table III. The recognition accuracies of LGLG are 99.75%, 100%, 97.23% and 97.44% on fb, fc, dupI and dupII, respectively; and its average recognition accuracy reaches 98.60% which are the best among all the methods. Three Riemannian manifold models in Gabor wavelet domain are implemented for the comparison: COV-GW + RD (Covariance matrix in Gabor Wavelet (GW) domain and Riemannian distance[25] is used), COV-GW + LEG(Covariance matrix in Gabor Wavelet domain with Log-Euclidean embedding and Matrix Frobenius Norm (MFN) is used[32] as the model’s similarity) and GW + LEMG (We implemented EMG [1] in Gabor wavelet domain and MFN is used as the model’s similarity). Four DCNN-based methods are used in this experiment: PCANet [7], VGGFace[6], ResNet50[49, 47] and SENet[46, 47].

It can be observed that LGLG obviously outperforms the three multivariate models improving by about 9 percentage points and has significantly reduction of computational cost compared with Riemannian distance because WPCA is used to reduce the dimensions of features. We also implemented the WPCA learning on the covariance models in Gabor wavelet domain (called LGLC-WPCA). The recognition accuracies of LGLC-WPCA and LGLG-WPCA are shown in Fig.7 and we see that LGLG-WPCA always outperforms the LGLC-WPCA on the three subsets except fb. LGLG(KP)-WPCA is obviously inferior to LGLG-WPCA on the four test subsets. LGLG-WPCA even obtain better accuracies than all the DCNN-based methods. It is well known that DCNN is good at for face recognition under the conditions of large varying illuminations and poses. In order to improve the robust, we combined the LGLG-WPCA/LGLG(KP)-WPCA features and SENet features for face recognition. Because the output of SENet is a 2048-dimensional feature vector, we use WPCA to compress the 2048-dimensional vector into a 480-dimensional vector and concatenate the 480-dimensional vector with the features of LGLG-WPCA (called LGLG-WPCA+SENet-WPCA), as well as the features of LGLG-WPCA(KP) (called LGLG-WPCA(KP)+SENet-WPCA); the number of the final face feature dimensions is 1676 (1196+480). In Table III, the average recognition accuracies of LGLG-WPCA+SENet-WPCA and LGLG-WPCA(KP)+SENet-WPCA are 99.43% and 99.30%, respectively. This manifests that the combination of Riemannian features in Gabor wavelet domain and the DCNN features (high level features) can improve the performance of face recognition.

 Method fb fc dup I dup II Avg
 LBP[8] 96.90 98.45 83.93 82.48 90.44
 LTP[2] 96.90 98.97 83.93 83.76 90.89
 LGBP+LGXP+LDA[37] 99.00 99.00 94.00 93.00 96.25
 DFD+WPCA [38] 99.40 100.0 91.80 92.30 95.88
 MDML-DCPs+WPCA[36] 99.75 100.0 96.12 95.73 97.90
 SCBP[39] 98.9 99.0 85.2 85.0 92.03
 FFC[40] 99.50 100 96.12 94.87 97.62
 LPOG[41] 99.8 100 97.4 97.0 98.55
 COV-GW + RD[25] 97.99 99.48 80.74 78.21 89.11
 COV-GW + LEG[32] 98.07 99.48 81.44 80.34 89.83
 PCANet [7] 99.58 100 95.43 94.02 97.26
 VGGFace[6] 98.74 96.39 86.28 87.61 92.26
 ResNet50[49, 47] 99.58 99.49 96.95 96.58 98.15
 SENet[46, 47] 99.33 99.49 97.22 97.00 98.26
GW + LEMG 98.07 99.48 82.13 81.19 90.22
LGLG-WPCA 99.75 100 97.23 97.44 98.60
LGLG-WPCA(KP) 99.66 99.48 92.38 91.02 95.64
£¨LGLG-WPCA+SENet-WPCA 99.83 100 98.75 99.15 99.43
£¨LGLG-WPCA(KP)+SENet-WPCA 99.83 100 98.20 99.15 99.30
TABLE III: The recognition accuracy (percent) on standard FERET.

Fig. 7: The performance comparison between LGLG-WPCA and LGLC-WPCA

The proposed methods are also computationally efficient (see Table IV). In the experiments, the feature dimension of LGLG-WPCA / LGLG-WPCA(KP) is 1196 which is same as the number of persons in gallery set; the feature dimension of LGLG-WPCA+SENet-WPCA / LGLG-WPCA(KP)+SENet-WPCA is 1676; more importantly, we use the Euclidean distance with lower computational cost to recognize faces. Among other Riemannian-manifold-based methods, COV-GW-RD uses Riemannian distance whose computational cost is expensive; COV-GW-LEG and GW-L2EMG use Frobenius norm of matrices with high-dimensional features to recognize faces.

Method Dimension Similarity measure
COV-GW-RD [25] Riemannian distance
COV-GW-LEG [32] Frobenius norm
GW-L2EMG Frobenius norm
PCANet (WPCA) [7] 1000 Cosine distance
VGGFace (WPCA) [6] 1000 Cosine distance
ResNet50[49, 47] 2048 Euclidean distance
SENet[46, 47] 2048 Euclidean distance
LGLG-WPCA 1196 Euclidean distance
LGLG-WPCA+SENet-WPCA 1676 Euclidean distance
LGLG-WPCA(KP)+SENet-WPCA 1676 Euclidean distance
TABLE IV: The feature matching runtime for recognizing all the face images on the two datasets. To the Riemannian-manifold-based methods we use matrices to describe the features. For example, the COV-GW-RD which dimension indicates the image is divided into 16 blocks and in each block the size of covariance matrix is .

Vi Conclusions

We implemented LEMG in Gabor wavelet domain and WPCA is used to learning the robust features for face recognition. Our method, called LGLG-WPCA / LGLG(KP)-WPCA, are efficient texture feature extract methods which have robust performance under the condition of illumination and small pose and expression variations. LGLG-WPCA/LGLG(KP)-WPCA are superior to the Gabor-based and LBP-based methods and it is also computational efficient due to Log-Euclidean embedding and WPCA are used for producing the features. It should be pointed out that our method LGLG-WPCA may be not efficient on the large-varying pose databases like CFP[42] IJB-A[43] and LFW [44] and it cannot compare our LGLG-WPCA with the frontalizing-based methods such as DR-GAN[18] and HF-PIM[16] on CPF and LFW because the frontalizing preprocessing are not used in LGLG-WPCA. In the future work, we will use the frontalizing approach as the preprocessing step of LGLG-WPCA and combine DCNN features for face recognition under the condition of large-varying poses.

References

  • [1] P. Li, Q. Wang, Z. Hui, and Z. Lei, “Local log-euclidean multivariate gaussian descriptor and its application to image classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 39, no. 4, pp. 803–817, 2017.
  • [2] X. Tan and B. Triggs, “Enhanced local texture feature sets for face recognition under difficult lighting conditions,” IEEE Transactions on Image Processing, vol. 19, no. 6, pp. 1635–1650, 2010.
  • [3] S.Sengupta, J.C.Cheng, C.D.Castillo, V.M.Patel, R.Chellappa, and D.W.Jacobs, “Frontal to profile face verification in the wild,” February 2016.
  • [4] Y. Sun, X. Wang, and X. Tang, “Deep learning face representation from predicting 10,000 classes,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 1891–1898.
  • [5] F. Schroff, D. Kalenichenko, and J. Philbin, “Facenet: A unified embedding for face recognition and clustering,” pp. 815–823, 2015.
  • [6] O. M. Parkhi, A. Vedaldi, and A. Zisserman, “Deep face recognition,” in British Machine Vision Conference, 2015, pp. 41.1–41.12.
  • [7] T. H. Chan, K. Jia, S. Gao, J. Lu, Z. Zeng, and Y. Ma, “Pcanet: A simple deep learning baseline for image classification?” IEEE Transactions on Image Processing, vol. 24, no. 12, pp. 5017–5032, 2015.
  • [8] T. Ahonen, A. Hadid, and M. Pietikainen, “Face description with local binary patterns: Application to face recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 12, pp. 2037–2041, 2006.
  • [9] C. Geng and X. Jiang, “Face recognition using sift features,” in IEEE International Conference on Image Processing, 2010, pp. 3313–3316.
  • [10] O. D¨¦niz, G. Bueno, J. Salido, and F. D. L. Torre, “Face recognition using histograms of oriented gradients,” Pattern Recognition Letters, vol. 32, no. 12, pp. 1598–1603, 2011.
  • [11] L. Yu, Z. He, and Q. Cao, “Gabor texture representation method for face recognition using the gamma and generalized gaussian models,” Image and Vision Computing, vol. 28, no. 1, pp. 177–187, 2010.
  • [12] Y. Taigman, M. Yang, Marc, and L. Wolf, “Deepface: Closing the gap to human-level performance in face verification,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 1701–1708.
  • [13] R. Huang, S. Zhang, T. Li, and R. He, “Beyond face rotation: Global and local perception gan for photorealistic and identity preserving frontal view synthesis,” arXiv, pp. 2458–2467, 2017.
  • [14] I. J. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in International Conference on Neural Information Processing Systems, 2014, pp. 2672–2680.
  • [15] R.He, X.Wu, Z.Sun, and T.Tan, “Learning invariant deep representation for nir-vis face recognition,” in AAAI, 2017.
  • [16] J. Cao, Y. Hu, H. Zhang, R. He, and Z. Sun, “Learning a high fidelity pose invariant model for high-resolution face frontalization,” arXiv, 2018.
  • [17] V. Blanz, “A morphable model for the synthesis of 3d faces,” in Conference on Computer Graphics and Interactive Techniques, 1999, pp. 187–194.
  • [18] T. Luan, X. Yin, and X. Liu, “Disentangled representation learning gan for pose-invariant face recognition,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1283–1292.
  • [19] C. Liu and H. Wechsler, Gabor feature based classification using the enhanced fisher linear discriminant model for face recognition.   IEEE Press, 2002.
  • [20] L. L. Shen, L. Bai, and M. Fairhurst, “Gabor wavelets and general discriminant analysis for face identification and verification,” Image and Vision Computing, vol. 25, no. 5, pp. 553–563, 2007.
  • [21] C. Liu, “Gabor-based kernel pca with fractional power polynomial models for face recognition.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 5, p. 572, 2004.
  • [22] W. Zhang, S. Shan, W. Gao, and X. Chen, “Local gabor binary pattern histogram sequence (lgbphs): a novel non-statistical model for face representation and recognition,” in Tenth IEEE International Conference on Computer Vision, 2005, pp. 786–791.
  • [23] Z. Chai, Z. Sun, H. Mendez-Vazquez, R. He, and T. Tan, “Gabor ordinal measures for face recognition,” IEEE Transactions on Information Forensics and Security, vol. 9, no. 1, pp. 14–26, 2014.
  • [24] O. Tuzel, F. Porikli, and P. Meer, “Region covariance: A fast descriptor for detection and classification,” ECCV, 2006, pp. 589–600.
  • [25] Y. Pang, Y. Yuan, and X. Li, “Gabor-based region covariance matrices for face recognition,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 18, no. 7, pp. 989–993, 2008.
  • [26] R. Wang, H. Guo, L. S. Davis, and Q. Dai, “Covariance discriminative learning: A natural and efficient approach to image set classification,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2012.
  • [27] H. Q. Minh, M. S. Biagio, L. Bazzani, and V. Murino, “Kernel methods on approximate infinite-dimensional covariance operators for image classification,” arXiv, 2016.
  • [28] W. Wang, R. Wang, S. Shan, and X. Chen, “Discriminative covariance oriented representation learning for face recognition with image sets,” in CVPR, 2017, pp. 5599–5608.
  • [29] Z. Zhang, M. Wang, Y. Huang, and A. Nehorai, “Aligning infinite-dimensional covariance matrices in reproducing kernel hilbert spaces for domain adaptation,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018, pp. 3437-3445.
  • [30] D. Acharya, Z. Huang, D. P. Paudel, and L. V. Gool, “Covariance pooling for facial expression recognition,” arXiv, 2018.
  • [31] P. Li, J. Xie, Q. Wang, and Z. Gao, “Towards faster training of global covariance pooling networks by iterative matrix square root normalization,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018, pp. 947–955.
  • [32] V. Arsigny, P. Fillard, X. Pennec, and N. Ayache, “Geometric means in a novel vector space structure on symmetric positive definite matrices,” Siam Journal on Matrix Analysis and Applications, vol. 29, no. 1, pp. 328–347, 2011.
  • [33] Arsigny, V., Fillard, P., Pennec, X., & Ayache, N., “Log-euclidean metrics for fast and simple calculus on diffusion tensors,” Magnetic Resonance in Medicine, vol. 56, no. 2, pp. 411–421, 2006.
  • [34] M. Harandi, M. Salzmann, and R. Hartley, “Dimensionality reduction on spd manifolds: The emergence of geometry-aware methods,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 1, pp. 48–62, 2018.
  • [35] C. Li, Y. Huang, and L. Zhu, “Color texture image retrieval based on gaussian copula models of gabor wavelets,” Pattern Recognition, vol. 64, pp. 118–129, 2017.
  • [36] C. Ding, J. Choi, D. Tao, and L. S. Davis, “Multi-directional multi-level dual-cross patterns for robust face recognition,” IEEE transactions on pattern analysis and machine intelligence, vol. 38, no. 3, pp. 518–531, 2016.
  • [37] S. Xie, S. Shan, X. Chen, and J. Chen, “Fusing local patterns of gabor magnitude and phase for face recognition,” IEEE Transactions on Image Processing, vol. 19, no. 5, pp. 1349–1361, 2010.
  • [38] L. Z, P. M, and L. SZ, “Learning discriminant face descriptor,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 2, pp. 289–302, 2014.
  • [39] W. Deng, J. Hu, and J. Guo, “Compressive binary patterns: Designing a robust binary face descriptor with random-field eigenfilters,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 1, no. 99, pp. 1–1, 2018.
  • [40] C. Y. Low, B. J. Teoh, and C. J. Ng, “Multi-fold gabor, pca and ica filter convolution descriptor for face recognition,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 1, no. 99, pp. 115–129, 2019.
  • [41] H.-T. Nguyen and A. Caplier, “Local patterns of gradients for face recognition,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 8, pp. 1739–1751, 2015.
  • [42] S. Sengupta, J.-C. Chen, C. Castillo, V. M. Patel, R. Chellappa, and D. W. Jacobs, “Frontal to profile face verification in the wild,” in Applications of Computer Vision (WACV), 2016 IEEE Winter Conference on.   IEEE, 2016, pp. 1–9.
  • [43] B. F. Klare, B. Klein, E. Taborsky, A. Blanton, J. Cheney, K. Allen, P. Grother, A. Mah, and A. K. Jain, “Pushing the frontiers of unconstrained face detection and recognition: Iarpa janus benchmark a,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 1931–1939.
  • [44] G. B. Huang, M. Mattar, T. Berg, and E. Learned-Miller, “Labeled faces in the wild: A database forstudying face recognition in unconstrained environments,” in Workshop on faces in’Real-Life’Images: detection, alignment, and recognition, 2008.
  • [45] Li C, Huang Y, Yang X, et al. Marginal distribution covariance model in the multiple wavelet domain for texture representation,Pattern Recognition, ” vol. 29, pp. 246–257, 2019.
  • [46] J. Hu, L. Shen, S. Albanie, G. Sun, and E. Wu, “Squeeze-and-excitation networks,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018, pp. 7132–7141.
  • [47] Q. Cao, L. Shen, W. Xie, O. M. Parkhi, and A. Zisserman, “Vggface2: A dataset for recognising faces across pose and age,” in 13th IEEE International Conference onAutomatic Face & Gesture Recognition (FG 2018), 2018, pp. 67–74.
  • [48] Xiong, Xuehan and De la Torre, Fernando, “Supervised descent method and its applications to face alignment,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 532–539.
  • [49] S. R. K. He, X. Zhang and J. Sun., “Deep residual learning for image recognition,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 770¨C–778.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
372915
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description