Face recognition has emerged as the fastest growing biometric technology and has expanded a lot in the last few years. Many new algorithms and commercial systems have been proposed and developed. Most of them use Principal Component Analysis (PCA) as a base for their techniques. Different and even conflicting results have been reported by researchers comparing these algorithms. The purpose of this study is to have an independent comparative analysis considering both performance and computational complexity of six appearance based face recognition algorithms namely PCA, 2DPCA, A2DPCA, (2D)2PCA, LPP and 2DLPP under equal working conditions. This study was motivated due to the lack of unbiased comprehensive comparative analysis of some recent subspace methods with diverse distance metric combinations. For comparison with other studies, FERET, ORL and YALE databases have been used with evaluation criteria as of FERET evaluations which closely simulate real life scenarios. A comparison of results with previous studies is performed and anomalies are reported. An important contribution of this study is that it presents the suitable performance conditions for each of the algorithms under consideration.
Citation: Bajwa UI, Taj IA, Anwar MW, Wang X (2013) A Multifaceted Independent Performance Analysis of Facial Subspace Recognition Algorithms. PLoS ONE 8(2): e56510. https://doi.org/10.1371/journal.pone.0056510
Editor: Derek Abbott, University of Adelaide, Australia
Received: October 3, 2012; Accepted: January 10, 2013; Published: February 25, 2013
Copyright: © 2013 Bajwa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: The authors have no support or funding to report.
Competing interests: The authors have declared that no competing interests exist.
Due to growing requirements of non-invasive recognition systems, Face Recognition has recently become a very popular area of research. A variety of algorithms for face recognition have been proposed and a few evaluation methodologies have also been used to evaluate these algorithms. However, current systems still need to be improved to be practically implementable in real life problems.
A recent comprehensive study , categorizes and lists the popular face recognition algorithms and databases. This study has categorized face recognition algorithms into five categories namely linear and non-linear projection methods, neural network based methods (another non-linear solution), Gabor filter and wavelets based methods, fractal based methods and lastly thermal and hyperspectral methods. However , in their study grouped the approaches of face recognition into two broad categories, namely appearance based and feature based. Although many feature based algorithms have been proposed – etc, they have limitations due to their heavy dependency on feature detection methods, which are mostly prone to error. Moreover, due to inherent variability of facial structure, the feature metrics are not reliable under varying expressions and temporal changes. Appearance based face recognition algorithms, on the other hand, despite being dependent on primitive pixel values are still considered to be a better choice . Among the appearance based methods, the so called subspace methods which rely on the dimensionality reduction of face space while preserving the most relevant information are the most famous.
Another recent and robust face recognition algorithm  based on sparse representation of facial data has achieved great fame due to better performance. In this algorithm however learning stage is virtually non-existent and all the training data is used directly in the classification stage. In the classification stage, an objective function is minimized using the test image and all the training data and classification is based on the solution vector of this optimization problem. Therefore using this algorithm, precise choice of feature space is no more a critical matter, which is the focal point of our study. The sparse approach for face recognition is obviously computationally intensive at the classification stage especially for large scale systems. Therefore sparse approach does not come under the scope of our study where the feature extraction approaches and choice of distance metrics are focused, emphasizing on computational efficiency especially in the classification stage.
A large variety of subspace face recognition algorithms have been proposed in different studies including some recently proposed methods. An interesting observation about these studies is that each proposed method claims to give the best recognition rates. However, since every study use their own datasets and implementation parameters specifically designed to highlight their own performance, individual performance analysis are misleading. Therefore it is of great significance that an unbiased comparative analysis of these algorithms under equal and testing working conditions is done. The evaluation methodology is therefore very important and it should be designed to simulate the real world problems. It is very difficult to find such comprehensive evaluation methodologies in the literature, the only exemplary evaluation method being that of the FERET evaluations run by National Institute of Standards and Technology (NIST) .
A comparative analysis should be fair not only in terms of the databases and testing methodology but also in terms of operating conditions such as trying a complete group of classifiers for all candidate subspace methods. Trying different classifiers/distance metrics may actually bring out the strengths of a subspace projection algorithm, which may not be visible on a single metric. However, very few studies been directed towards comparative analysis of subspace based algorithms and even fewer studied the effect of different distance metrics on the algorithms for their comparison.
One of the early studies  used FERET  database with 425 gallery and training images of their own choice. The study  also used FERET database, but the system was trained on 675 images belonging to 225 classes and tested on 640 images belonging to 160 classes. Another study  did follow the FERET evaluation methodology, but just compared two algorithms PCA  and ICA  and three distance metrics not including Mahalanobis based distance metrics. The study  compared different hybrid approaches and used FERET database with their own selection of 762 images belonging to 254 classes for training and 254 images for testing purposes. Another study , which represents a face image as a spatial arrangement of image patches and derives optimal Voltera Kernels compared the performance of their proposed method with traditional and state of the art algorithms on three databases. Recently, an improved version of the said method was also introduced which employs a modern stochastic optimization algorithm . A comparatively larger and latest study , compared three algorithms PCA, ICA and LDA  on the FERET database. They adopted the FERET recommendations by using the recommended test and gallery sets but they used their own training set of 675 images belonging to 225 classes.
This study was motivated due to the lack of comprehensive comparative study of many subspace methods with many distance metric combinations. Comparative studies found in the literature are limited in their scope in terms of the testing methodology and the number of test vectors and test parameters being used in the analysis. This study, unlike earlier studies, compares different algorithms based on theoretical aspects, such as resultant data structure sizes and algorithm complexity, as well as recognition rates on different facial databases. Three different databases have been used, namely FERET, YALE  and ORL . Due to obvious reasons, the evaluation criteria chosen is the same as of FERET evaluation tests and almost similar to that for YALE and ORL. The evaluation methodology also ensures that every candidate subspace algorithm is operated at its optimal performance by using various distance metrics against each algorithm and choosing the best one.
Six subspace projection methods have been included in the comparison, which are evaluated using four distance metrics. These methods include, 1DPCA , 2DPCA , A2DPCA and (2D)2PCA , LPP  and 2DLPP . Selection of these six algorithms is due to their efficiency and the property of being scalable to large databases. ICA has not been included in the study because it has already been thoroughly investigated in other comparative studies. LDA has also not been included because it needs class information during training and does not suit generalized evaluation methodology adopted here. The evaluation of 2DPCA and LPP is interesting due to the fact that the original studies did not use FERET database and hence missed an important facial database to present their results. The results of 2DLPP were also shown on limited test vectors using subsets of FERET database or using different training or testing sets than the ones specified by FERET evaluations.
The rest of the paper is organized as follows: Section 2 describes the subspace algorithms under consideration, Section 3 explains the evaluation methodology followed, Section 4 presents the results and related discussion and section 5 concludes the whole study and proposes future work to be done.
Subspace Algorithms to be Evaluated
Three basic steps of recognition system are training, projection, and recognition. During the training phase, the basis vectors of the subspace for each algorithm are calculated and saved. During projection, these basis vectors are loaded and then all the database images are projected onto these basis vectors, which convert them to the lower dimensional subspace. These projected images are saved as templates to be later used in distance calculation in the recognition phase. The whole process is shown in figure 1.
Since all the algorithms used in this study are well known, they will be described briefly for the sake of completeness. These algorithms are referred to as subspace methods because they project the images to lower dimensional space to perform recognition task which is not computationally feasible to be done in high dimensional space. These algorithms retain maximum possible discriminative information while converting the images to lower dimensional space. Their property of retaining maximum discriminative information is what prioritizes them over each other.
Table 1 summarizes the basic implementation parameters for all the algorithms discussed in this study, listing the matrix dimensions and the time/computational and space complexity. Therefore this table is used as a reference for the purpose of comparison based on memory and computational requirements besides the recognition rates mentioned in results section. The algorithm complexity section of the table has been extended from . The size of images is mxn (m is the number of rows and n is the number of columns of an image), N is the number of training images and M is the number of images projected on the projection matrix resulting from training. Number of retained basis vectors is d (d1 and d2 in case of 2D2PCA algorithm) which determines the number of dimensions preserved. A summarized description of the six subspace projection algorithms is given in the following subsections.
1. Eigenfaces (PCA/1DPCA)
Principal Component Analysis (PCA)  relies on a set of basis vectors which correspond to maximum variance direction of the image data. As suggested by the study, the calculation of covariance matrix is reduced by calculating the ATA matrix as the covariance matrix rather than AAT as in equation 1, where A is the matrix containing all the image vectors. This reduction is compensated by later multiplying the images A with Eigen vectors of the ATA matrix as in equation 2. This finally results into Eigenfaces, which are the basis vectors and serve as the projection matrix. This training process of PCA is shown in Figure 2, where both options of direct covariance and indirect covariance methods are shown. These basis vectors are normalized before further use and the reason is discussed in section 3.2.3. A specific number of vectors are retained corresponding to the same number of highest Eigen values of the covariance matrix. The images are then projected onto these retained basis vectors to find a set of weights (templates) describing the contribution of each basis vector in image reconstruction.
Suppose there are N images of size mxn, reshaping each image to a vector will result into a matrix A of size mnxN containing all images in the form of vectors of length mn. The image covariance matrix G of the size NxN is calculated as shown in equation 1.(1)Where Ak is the k’th image in vector form from matrix and is the average image. Solving Eigen values of G will result into NxN Eigen vectors. Multiplying the images with these Eigen vectors will result in the basis vectors B, which is represented by equation 2.
(2)These mn dimensional basis vectors B are then normalized. Corresponding to the d largest Eigen values calculated above, d vectors out of N vectors of B are chosen. These chosen vectors, also called Eigen faces, form the projection matrix P which is of size mnxd.
In the projection phase the desired M number of images vectors E are projected onto this projection matrix to get the templates which are of the of size dxM as shown in equation 3(3)
2. Two Dimensional PCA & Alternative Two Dimensional PCA (2DPCA & A2DPCA)
In 2-D PCA  and Alternative 2-D PCA , image covariance matrix is calculated directly using the 2D images. As evident from table 1, size of covariance matrix for 2DPCA is smaller than the one for PCA. Though 2DPCA is computationally better than PCA in training phase, it requires more storage space for the templates and more computations in the recognition phase as compared to PCA. Since 2DPCA works along the row direction of images, it preserves the variation between rows of an image taken as feature vectors. In A2DPCA however, the variation between columns of an image taken as feature vectors are preserved.
Suppose there are N images of size mxn. The image covariance Matrix G of size nxn is calculated using equation 4,(4)Where Ak is the k’th image and is the average image. The next step is solving for d Eigen vectors of G corresponding to the largest d Eigen values. These chosen d Eigen vectors compose the projection matrix P of size nxd. During projection, the images are projected one by one on this projection matrix. If there are a total of M images to be projected, the resulting templates will be of size m x d x M.
In case of A2DPCA, it works in column direction of images; therefore the difference is in calculating the image covariance matrix G, now with size mxm as shown in equation 5.(5)
Therefore for A2DPCA, the projection matrix P will be of size mxd and the resulting templates will be of size n x d x M.
3. 2-Directional 2-Dimensional PCA ((2D)2PCA)
As discussed above, 2DPCA and A2DPCA preserve the variance between rows and between columns of the image respectively. The disadvantage of 2DPCA and A2DPCA is that they have a relatively bigger template size as compared to that of PCA which is evident from table 1. Template size is an important factor in characterizing the storage and computational requirements at the recognition stage. (2D)2PCA  possesses a comparatively reduced template size. In (2D)2PCA, the images are projected simultaneously on both row based and column based optimal matrices.
Suppose there are N images of size mxn. For (2D)2PCA algorithm, two covariance matrices are needed to be calculated using equation 4 and 5. One is G1 of size nxn and the other is G2 of size mxm. Solving for d1 Eigen vectors of G1 and d2 Eigen vectors of G2 corresponding to the d1 and d2 largest Eigen values respectively, two projection Matrices P1 of size nxd1 and P2 of size mxd2 are achieved.
In the projection phase the two dimensional images Ek are simultaneously multiplied with both projection matrices to transform them into the new lower dimensional space as shown in equation 6. The projected size is d2 x d1 x M, where M is the number of images to be projected.(6)
4. Laplacianfaces (LPP)
Laplacianfaces (LPP) algorithm  is a subspace algorithm that applies dimensionality reduction while preserving the locality information of feature space. In LPP, each input face is first projected to PCA subspace and stored as a single vector in the data matrix A, which acts as an input to LPP. An adjacency matrix S of a fully connected graph is computed, where each node represents an image Ak in the face-space. Weights are assigned to the edges in the connected graph on the basis of a fixed neighborhood of K samples. The weight of an edge is determined by the measure of closeness of nodes.(7)
In equation 7, Sij represents the weight of the edge connecting node Ai and Aj in the adjacency graph S. The parameter t in the above equation controls the spread of the neighborhood and that encompasses K nearest neighbors. In this study the parameter t is computed using equation 8.(8)Where, N is the number of training set images, Dist is the distance matrix in which each column contains sorted distances of an image with all images. The matrix A contains all input images projected into PCA subspace as vectors; Ai represents a particular image in the matrix A on the index i. A diagonal matrix, D is computed by adding all elements in a row of the matrix S, and placing the sum in the diagonal elements. Laplacian Matrix L is calculated by subtracting adjacency matrix S from diagonal matrix D. An optimized embedding is then computed by solving the generalized Eigen problem given in equation 9 that yields the Eigen values λ and Eigen vectors w. These Eigen vectors are used as subspace basis vectors, referred to as PLPP in equation 10.
(9)These d vectors are chosen corresponding to the d smallest Eigen values, referred as dLPP. The complete projection matrix P is shown in equation 10, whereare the subspace basis vectors of PCA subspace.(10)
In the projection phase, using equation 3, the desired M number of images E are projected to get the templates in the Laplacian subspace which are of the size dLPP x M.
5. Two Dimensional Laplacianfaces (2DLPP)
Two Dimensional Laplacianfaces (2DLPP)  is a recently proposed method for face recognition. In 2DLPP the 2D images are used directly without converting into vectors first. The adjacency matrix S, neighborhood spread t, diagonal matrix D & Laplacian matrix L are calculated as in LPP method. For computing the optimized embedding, the generalized Eigen problem of equation 11 is solved which is different from the one used in LPP method. The reasoning for such change is given in .(11)
The d selected Eigen vectors corresponding to the smallest d Eigen values constitute the projection matrix P. An image in the face-space can thus be projected onto the 2DLPP subspace.
The evaluation methodology followed in this study is explained by addressing the training and projection method and the testing variables used in the evaluation. A MATLAB based evaluation platform that is constructed as a result of this study is also described.
1. Basic Modules of Evaluation System
Four basic modules of the evaluation methodology include Training, Projection, Distance Calculation and Result Calculation as shown in figure 3. To ensure a uniform evaluation for all methods, the images used for training and testing are predetermined and stored in the form of image lists. For example the image list “all_feret” contains the names of all the images for the FERET database. “train_feret” is the image list containing training images from FERET database. Similarly four probe image lists for FERET and one each for YALE and ORL contain the names of images to be used for testing the system. The “gallery” list contains the names of the images against which the probe set images are to be compared. Given a query face image, the probe, the system has to find most similar out of the known faces in the gallery, while the system has been trained on the training set that is a small subset of the database.
For FERET, the training, gallery and probe sets are already defined by FERET evaluation tests . Similar arrangements are done for image lists for YALE and ORL. More details regarding the structure of database and image sets have been given in Section 3.2.1.
Prior to training, FERET and Yale images have been pre-processed by first alignment using eye coordinates to compensate head tilt, then illumination adjustment using histogram equalization, then cropping using an elliptic mask so that only face is visible, and finally resizing to 150×130 pixels. ORL isn’t processed because it has minimal background variation and limited head tilt. In case of FERET the eye coordinate file is supplied along with the database. For YALE database, eye coordinates are manually selected and a similar eye-coordinates file is maintained.
During the training phase, the projection matrix is trained using the images from the training image list of a particular database by the projection algorithm to be evaluated. The size of the projection matrix is determined by the retained percentage of basis vectors.
In the projection phase, the images listed in the “all” image list of the specific database are projected onto the face subspace using the projection matrix and saved as the output of this phase. The training and projection operation along with the rest of operations is shown in figure 3.
In distance calculation phase, the distances between a projected probe image and all other projected images in the gallery are calculated and written in a file named after the name of the projected image. The same is repeated for every projected image against the distance metric of our choice. These distance files are later used in the result calculation phase.
In the result calculation phase, the gallery and probe image lists are read and the distance file for each probe image is loaded to check if the closest match is among the images named in gallery list. Here the match scores are calculated against each Rank. Rank 1 means the first match and Rank 50 means 50th match. The results are calculated for all the probe sets and saved.
2. Testing Variables
Table 2 summarizes all the testing variables used in the evaluation process.
Three databases are selected for our comparative study, namely FERET, YALE and ORL. The description and reasons for choosing these databases is given in the following paragraphs.
FERET database has been extensively used by FERET evaluation tests, face recognition vendor tests (FRVT) and by many researchers for different research algorithms as well as commercial face recognition systems . FERET has been chosen to test the performance of the algorithm combinations under conditions where there is a variation in facial expressions, lighting conditions and temporal changes. The experiments here use the standard image subsets as in FERET evaluation test. These image subsets include an image set for training which consists of 501 images of randomly selected 428 subjects and the images per subject range from minimum 1 to maximum 3. A gallery set of 1196 images and four probe sets namely fafb, fafc, dup1 & dup2 totaling 2345 images are used. The gallery set consists of one image for each of the 1196 subjects with neutral expression. The probe sets are used to assess the performance of the algorithm against several conditions. For evaluation against change in expression, the probe set “fafb” is used. Similarly for evaluation against different illumination conditions, the probe set “fafc” is used. For evaluation against temporal/aging changes the dup1 and dup2 probe sets are used. It is necessary to mention that among the total 3368 frontal images used in this study, there are subjects having images with and without glasses. The details of number of images per set are shown in table 3.
The ORL database  is one of the famous older databases. The reason why it is chosen is because it has been used by the authors of the algorithms under discussion in our study. There are 10 different images for each of 40 distinct subjects hence totaling to 400. For some of the subjects, the images were taken at different times and slight variations in illumination, facial expression, facial detail, head tilt, pose angle and scale of face area in an image are present. All the images were taken with constant dark background and most of them are frontal. The training set is chosen to be the first five images for every subject which becomes 200 images in total. One frontal image with neutral expression is manually selected for each of the 40 subjects to be included in the gallery set. Only one probe set is used which consists of the last 5 images for every subject which totals to 200 images. This training and probe set combination has already been used by 2DPCA and (2D)2PCA authors. The database and its relevant details are summarized in table 3.
The YALE database  consists of 165 images belonging to 15 subjects thus having 11 images per subject. Images belonging to this database possess 3 variations in lighting condition, 6 variations in facial expression, with glasses and without glasses. This makes one image per variation for each subject. Our experiments on this database use the same testing criteria as that of . Training set is constructed by randomly picking six images per subject so that all 11 variations get the chance of being part of training set, therefore 90 images in total are used for training. The rest of the database is considered to be the only probe set having a total of 75 images. The gallery comprises of one image with normal facial expression for each subject i.e. 15 images. The specifics of image sets are given in table 3.
2.2. Distance Metrics.
Four distance metrics are chosen including Euclidean (L2) and Cosine for the image space and their counter parts in Mahalanobis space, Mahalanobis (L2) & Mahalanobis Cosine. These metrics are referred throughout the study as Euc, Cos, Maha and MahCos, respectively. The Mahalanobis space based distance metrics are applied by transforming the templates from image space to Mahalanobis space. For each vector pair u and v in image space the transformed vector pair m and n in Mahalanobis space is given as in equation 12(12)Here σi is the standard deviation of the ith dimension. Calculation of this standard deviation/spread is discussed in section 3.2.3.
For the sake of completeness, mathematical description of each distance metric is given below.
Euclidean/(L2)/(Euc): The Euclidean/L2 distance between two vectors u, v in image space is calculated as in equation 13.(13)
Cosine/(Cos): The Cosine distance between two vectors u, v in image space is calculated as in equation 14(14)
Higher similarity means higher score in this case; therefore the actual distance is calculated by subtracting the above calculated value from 1 as in equation 15.(15)
Mahalanobis/(L2)/(Maha): It is equivalent to Euclidean computed in Mahalanobis space. The Mahalanobis/(L2) distance between two vectors u, v in image space is calculated by equation 16.(16)
Mahalanobis Cosine/(MahCos): It is equivalent to Cosine computed in Mahalanobis space. The Mahalanobis Cosine distance between two vectors u, v in image space is calculated as in equation 17.(17)
Similar to Mahalanobis, the actual distance is calculated by subtracting the above calculated value from 1 as in equation 18.(18)
2.3. Computing the data spread for Mahalanobis space transformation.
As discussed in section 3.2.2, it is important to compute the standard deviation/spread to be used in calculating Mahalanobis space based distance metrics. The variance of the face data along its principal component directions is determined by the Eigen values of the image covariance matrix along all the dimensions. Therefore the spread in a specific dimension will be the square root of the Eigen value corresponding to that dimension. For PCA based algorithms, the Eigen values of the initial covariance matrix can be used as the spread at later stage to calculate Mahalanobis based distance metrics but for Laplacianfaces the Eigen values of initial covariance doesn’t represent the actual spread of Laplacian projected images. Therefore the Eigen values of the covariance matrix (of projected images) have to be calculated, to finally get to the spread.
It has been confirmed that the Eigen values of the initial covariance matrix and the Eigen values of the covariance matrix of projected images are same. An exception exists for 1D PCA, if the vectors of projection matrix/basis vectors are not normalized then the spread of projected images is square of the spread of training images. Therefore basis vectors in 1D PCA are normalized before further usage.
For the sake of similarity and generalization in the platform code, in case of 2D algorithms, the projected images are reshaped into vectors first. It is confirmed that it yields the same result either two dimensional projected images are used directly or if they are reshaped into vectors first.
As a part of this study, a MATLAB based platform FaceRecEval has also been implemented which serves the purpose of evaluating and comparing different algorithms. This platform is developed being inspired by the CSUFaceIdEval System . The authors have already extended the CSUFaceIdEval System and have also ported the whole platform to the Windows operating system . This work was done in context to the studies –. FaceRecEval will serve as a very useful tool for the fellow researchers who are more acquainted with MATLAB. Currently version 1 of this platform is available for free download .
All the main functionalities described in section 3.1 including training, projection, distance calculation and result calculation are incorporated in form of modules. The result calculation module calculates the results as described at start of this section. The reason behind projecting all the images and calculating the distances between all projected images is to accommodate any changes in gallery and probe image lists, because no rework prior to this module will be needed.
Results and Discussions
For the sake of completion and to avoid confusion due to diversity of testing parameters, the results and discussions have been grouped based on recognition tasks, facial databases, distance metrics, algorithms, memory and computational complexities and comparison to previous work. Table 4 and 5 summarize the results for FERET, YALE and ORL databases. The recognition rates being displayed are the average of 50 ranks. The comparative recognition rates for each rank may vary a little and can be downloaded from , but the general trend remains the same, therefore here average recognition rates are shown. Recognition rates do vary for different percentage of retained basis vectors as it is evident from results and also supported by .
1. Based on Recognition Tasks
1.1. Illumination Task.
Starting with algorithm performance against illumination variations, it can be noted from table 4 that the recognition rates are generally lower against FAFC probe set. It is because the Eigen vectors corresponding to highest Eigen values were not dropped for the sake of similarity and generalization. For PCA based algorithms the top Eigen vectors encode most of the illumination information. Removing few of them, depending on the count of training images, might improve results of some algorithms against this task.
Two dimensional PCA algorithms perform relatively better when 25% of basis vectors are retained. LPP along with simple Cosine and Euclidean distance metrics achieves good recognition rates against this task but it is while retaining the highest percentage of basis vectors. PCA along with Mahalanobis distance variants generally perform the best for different percentages of retained basis vectors against this task. The best performing algorithms for this task are PCA-MahCos, with 50% retained basis vectors, and A2DPCA-Cos, with 25% retained basis vectors.
1.2. Expression Task.
The FAFB set is used to evaluate performance of an algorithm against change in expression. This is the easiest task with highest recognition rates as evident from table 4. All PCA based algorithms with Euclidean distance metric perform equally well and generally have the best recognition rates. The best performers generally for this task are PCA-MahCos with 25% retained basis vectors and 2D2PCA-Euc with 25% retained basis vectors. No direct conclusion can be made about the most suitable algorithm for such tasks. But the algorithms that result into the smallest template size, i.e. PCA-MahCos and 2D2PCA-Euc may be the best choices.
1.3. Aging Task.
Dup 1 and Dup 2 are the two sets provided to test the performance of algorithms against temporal changes. Dup 2 being the harder task has lower recognition rates as compared to that of Dup 1. PCA based algorithms perform generally better for both Dup 1 and Dup 2, as compared to LPP based algorithms. The best performing algorithm is A2DPCA-Cos, with 25% retained basis vectors, for both Dup 1 and Dup 2 sets.
PCA-MahCos and A2DPCA-Cos are generally the best performers on the FERET database as they each achieve the top recognition rates in three out of four of the face recognition tasks. They perform well on YALE and ORL database too, but the top recognition rates are achieved by 2DPCA-Euc on ORL and 2D2PCA-MahCos on YALE.
2. Based on Facial Databases
For FERET, the best algorithms that perform equally well on all probe sets are PCA-MahCos and A2DPCA-Cos. For YALE, the best performing algorithm is 2D2PCA-MahCos. PCA-MahCos and A2DPCA-Cos along with 2DPCA-Euc are close too. ORL images include slight pose variations and here the best performing algorithm is 2DPCA-Euc. Other algorithms close in performance are 2D2PCA-Euc and A2DPCA-Euc. The algorithms performing the best on average over all databases are A2DPCA-Cos and PCA-MahCos.
3. Based on Distance Metrics
Though variants of Mahalanobis distance metric did not work well with 1D LPP on all three databases, yet they perform well with all PCA based algorithms and 2D LPP for all face recognition tasks on all databases. The need for experimenting with variants of Mahalanobis distance metrics was pointed out in . Euclidean distance metric performs satisfactorily on average with all two dimensional PCA based algorithms, followed by Cosine distance metric, on all face recognition tasks over all databases. MahCos is the best performing distance metric with PCA on average over all face recognition tasks and databases, a result similar to that of  and .
It is worth noting that the Euclidean distance metric works well against the expression task which actually leads to the local geometrical distortions in a facial image. On the other hand, Cosine distance metric which is close to the correlation of image vectors, works well against illumination changes which are non-geometrical distortions. This general trend is evident from the results in table 4 against the facial tasks fafc (illumination) and fafb (expression). As the local geometrical distortion such as change in expression effects only a small portion of a facial image, only a few components of image vector show significant variations among genuine candidates also. While the non-geometrical distortion such as change in illumination affects the major portion of an image, therefore maximum components of image vectors show a consistent difference. The Euclidean distance handles larger variations in fewer components better as compared to correlation therefore it shows generally better results in expression tasks. Cosine on the other hand is more suitable to handle illumination variations which cause consistent change. Against the aging tasks (dup1, dup2) the results show mixed trends as evident from table 4 due to the fact that such task incorporates both the local geometrical and non-geometrical changes.
4. Based on Algorithms
It should be noted that there is quite a lot of variations in the performance of different algorithms and thus in the performance ranking for different type of datasets. 2D2PCA generally gives the highest recognition rates on both YALE and ORL database as well as for the expression test set on FERET. PCA recognition rates are highest for FERET database. A2DPCA is on average the best algorithm over all the three databases. The reason is, because this algorithm works along the rows of images. All the images of the three databases have more rows than columns, therefore this algorithm had chance to retain more information as compared to 2DPCA which works along columns. For the same number of retained basis vectors, A2DPCA consumes lesser testing time as compared to 2DPCA, because length of rows is lesser than the length of columns. To conclude, PCA based algorithms perform the best overall on all the three databases, though 2DPCA based algorithms give better recognition rates than PCA on average but with bigger template sizes. Another thing worth noting from table 4 and 5 is that all the 2DPCA based algorithms give maximum recognition rate (shaded values) for almost the same percentage of retained basis vectors. An important observation is that 2DLPP outperforms 1DLPP for almost every face recognition task on all the three databases.
5. Based on Memory and Computational Complexities
The sizes of covariance matrix, projection matrix, templates and the time and memory complexity of each algorithm are summarized in table 1. The dimensions m,n,N,M and d have been already defined in section 2. From the matrix dimensions section of the table, one can clearly understand the dimensions of the output of training and projection phase. Based on these dimensions, the algorithm complexity can easily be understood.
The training time complexity depends upon both the size of the covariance matrices and the number of retained basis vectors. Therefore for PCA it is O(m2n2d) and for 2DPCA it is O(n2d) due to a smaller covariance matrix. The A2DPCA has O(m2d) because it works along the columns and for 2D2PCA it is O(n2d1+ m2d2) because it has to calculate two covariance matrices, one along rows and other along columns. For LPP and 2DLPP an extra cost O(mnN2) to construct the adjacency matrix S is bared.
The testing time is calculated by the number of tests to perform and the time complexity for each test. This time also reflects the computational complexity during recognition which is very critical especially for identification systems. This turns out to be O(MN) for the number of tests, and time complexity for each test is O(d) for one dimensional algorithms and O(md) for two dimensional algorithms. So PCA and LPP have the time complexity of O(MNd), 2DPCA and 2DLPP have O(mMNd), A2DPCA has O(nMNd) and 2D2PCA has O(d2MNd1).
The memory cost depends on the size of the covariance matrices. Therefore for PCA and LPP it is O(m2n2), for 2DPCA and 2DLPP it is O(n2) and for A2DPCA it is O(m2). The 2D2PCA algorithm has a memory cost O(m2+ n2) due to the fact that it calculates two Eigen equations.
To summarize the above discussion, it is obvious that PCA variants are computationally efficient as compared to LPP variants. In an identification system the training and projection is usually done offline, while the distance calculation and recognition is done online, mostly real time, which has critical timing constraints. The above analysis shows that the training time and memory space complexity for 1D PCA, which generally demonstrates better recognition rates, is higher due to bigger covariance matrix. However it is very efficient at matching stage due to smaller template size and thus suitable for identification systems. On the other hand A2DPCA is efficient during training due to smaller covariance matrix but has a bigger template size and needs more online processing time during recognition as compared to PCA. 2D2PCA on average has a comparatively smaller template size and it is also efficient during matching, therefore it is the most efficient in both respects among the two dimensional PCA algorithms.
6. Based on Comparison to Previous Work
For comparing the results of this study, similar studies which have used one or more of the algorithm and distance metric combinations are considered here. Variation of results as compared to previous studies can be attributed to different pre-processing technique and the standard testing methodology not used by most of these studies. But as this study is an independent comparative analysis, it serves the purpose.
Regarding FERET evaluation methodology tasks, we found that the FAFB task is the easiest with highest recognition rates which is consistent with   and FAFC is comparatively the hardest task with lowest recognition rates (on average) which is consistent with . But no concrete claim could be made about either FAFC or DUP2 to be the hardest task based upon the recognition rates against them.
PCA with variants of Mahalanobis based distance metrics is experimented as more investigation was recommended by  and they perform very well on all the three facial databases which is consistent to  and . 2DPCA-Euc is better than PCA-Euc on both ORL and YALE databases and similar trends hold for FERET too, which is consistent with . But in this study, 2DPCA wasn’t compared with PCA using other distance metrics and in our study it is found that PCA-MahCos does equate and even surpass 2DPCA-Euc’s performance in some cases.
While using Euclidean as a distance metric, the recognition rates of all the two dimensional PCA algorithms on all three databases are pretty close to each other which is in agreement with . There is also a disagreement with , as it states that 2D2PCA-Euc always performs better than both PCA-Euc and 2DPCA-Euc for lower number of retained dimensions. Our study shows that such claim holds valid against PCA-Euc only because 2DPCA-Euc is almost equal in performance over all the three databases.
Regarding the 2DLPP algorithm, our results are not in agreement with . Though for some of the distance metrics, the recognition rate of 2DLPP is comparable to that of 2DPCA, but for the Euclidean distance metric, 2DLPP is clearly behind 2DPCA-Euc for all the three databases.
Conclusion and Future Directions
The aim of this study was to independently compare and analyze the relative performance of famous subspace face recognition algorithms against the same working conditions. As mentioned in the testing methodology section, we have followed the FERET evaluations methodology which closely simulates real life scenarios. Six popular subspace face recognition algorithms were tested accompanied with four popular distance metrics.
An important and novel contribution of this study is that it introduced an unbiased comparative analysis of popular subspace algorithms under equal and testing working conditions, such as same pre-processing steps, same testing criteria, same testing and training sets and also introduced the favorable performance conditions for each of these algorithms. After thorough experimentations it was shown that Algorithm 1D PCA performed best with distance metric Mahalanobis-Cosine, and 2DPCA variants and 1D LPP performed generally much better with simple Euclidean and Cosine distance metrics. Similarly 2DLPP performed much better with distance metrics Mahalanobis and Mahalanobis-Cosine. In addition to this it was shown that Cosine based distance metrics, MahCos and Cos, gave better results than Euclidean based metrics. The algorithm-metric combination of PCA-MahCos was clearly ahead in performance under difficult conditions of illumination changes. As evident from figure 4, generally for all tasks A2DPCA-Cos was found to be better than other combinations especially against aging tasks.
A thorough computational complexity analysis was also performed on the subject algorithms. It was shown that though 2D algorithms have lower complexity during training, they need more computations during recognition which is critical for identification systems. On the other hand 1D algorithms have higher computational complexity during training but generally require less computations during recognition stage.
It was also noted that the performance variations are very significant for different databases. Any algorithm alone cannot be qualified as the best performing algorithm for all the variations of a facial image. To extract the optimal performance on all facial variations, it may be necessary to combine several subspace techniques in a computationally economical unified classifier which makes a good research topic for future.
A MATLAB based evaluation platform was also constructed in result of this study which may serve as a useful tool for researchers in this field.
Portions of the research in this paper use the FERET database of facial images collected under the FERET programme, sponsored by the DOD Counterdrug Technology Development Program Office. The authors are thankful to Mr. Xiaofei He  for valuable comments and suggestions regarding Laplacianfaces and to Mr. Kresimir Delac  for valuable comments regarding FERET training set.
Reviewed the manuscript: IAT MWA XW. Conceived and designed the experiments: UIB. Performed the experiments: UIB. Analyzed the data: UIB IAT. Wrote the paper: UIB IAT MWA XW.
- 1. Abate A F, Nappi M, Riccio D, Sabatino G (2007) 2D and 3D face recognition: A survey. Pattern Recognit Lett 28: 1885–1906.
- 2. Zhao W, Chellappa R, Phillips PJ, Rosenfeld A (2003) Face Recognition: A Literature Survey. ACM Computing Surveys 35: 399–458.
- 3. Kelly MD (1971) Visual identification of people by computer. Doctoral thesis, Stanford University AI Project, Stanford, CA, USA. AAI7112934.
- 4. Manjunath B, Chellappa R, Von der Malsburg C (1992) A feature based approach to face recognition. Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit 373–378.
- 5. Wiskott L, Fellous J M, Kuiger N, Von der Malsburg C (1997) Face recognition by elastic bunch graph matching. IEEE Trans Pattern Anal Mach Intell 19: 775–779.
- 6. Nefian A V, Hayes III M H (1998) Hidden Markov models for face recognition. Proc IEEE Int Conf Acoust Speech Signal Process 5: 2721–2724.
- 7. Wright J, Yang A Y, Ganesh A, Sastry S S, Ma Y (2009) Robust face recognition via sparse representation. IEEE Trans Pattern Anal Mach Intell 31: 210–227.
- 8. Phillips P J, Moon H Rizvi S A, Rauss P J (2000) The FERET evaluation methodology for face recognition algorithms. IEEE Trans Pattern Anal Mach Intell 22: 1090–1104.
- 9. Bartlett M S, Lades H M, Sejnowski T J (1998) Independent component representations for face recognition. Proc SPIE Symposium on ElectronicImaging: Science and Technology; Conference on Human Vision and Electronic Imaging III 3299: 528–539.
- 10. NIST (2004) FERET Database. Available: http://www.itl.nist.gov/iad/humanid/feret/. Accessed 19 January 2013.
- 11. Beveridge J R, She K, Draper B A, Givens G H (2001) A nonparametric statistical comparison of principal component and linear discriminant subspaces for face recognition. Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit 1: 535–542.
- 12. Baek K, Draper B A, Beveridge J R, She K (2002) PCA vs. ICA: A comparison on the FERET data set. Proc of the Fourth International Conference of Computer Vision, Pattern Recognition and Image processing 824–827.
- 13. Turk M, Pentland A (1991) Eigenfaces for recognition. Cogn Neurosci 3: 71–86.
- 14. Bartlett M S, Movellan J R, Sejnowski T J (2002) Face recognition by independent component analysis. IEEE Trans Neural Netw 13: 1450–1464.
- 15. Ruiz-del-Solar J, Navarrete P (2005) Eigenspace-based face recognition: a comparative study of different approaches. IEEE Trans Syst Man Cybern C Appl Rev 35: 315–325.
- 16. Kumar R, Banerjee A, Vemuri B C (2009) Volterrafaces: Discriminant analysis using volterra kernels. Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit 150–155.
- 17. Chakrabarty A, Jain H, Chatterjee A (2012) Volterra kernel based face recognition using artificial bee colony optimization. Eng Appl Artif Intell In press.
- 18. Delac K, Grgic M, Grgic S (2005) Independent comparative study of PCA, ICA, and LDA on the FERET data set. Int J Imaging Syst Technol 15: 252–260.
- 19. Belhumeur P N, Hespanha J P, Kriegman D J (1997) Eigenfaces vs. fisherfaces: Recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19: 711–720.
- 20. Samaria F S, Harter A C(1994) Parameterisation of a Stochastic Model for Human Face Identification. Proc IEEE Workshop Appl Comput Vis 138–142.
- 21. Yang J, Zhang D, Frangi A F, Yang J (2004) Two-dimensional PCA: a new approach to appearance-based face representation and recognition. IEEE Trans Pattern Anal Mach Intell 26: 131–137.
- 22. Zhang D, Zhou Z H (2005) (2D) 2PCA: Two-directional two-dimensional PCA for efficient face representation and recognition. Neurocomputing 69: 224–231.
- 23. He X, Yan S, Hu Y, Niyogi P, Zhang H J (2005) Face recognition using laplacianfaces. IEEE Trans Pattern Anal Mach Intell 27: 328–340.
- 24. Niu B, Yang Q, Shiu S C K, Pal S K (2008) Two-dimensional Laplacianfaces method for face recognition. Pattern Recognit 41: 3237–3243.
- 25. CSU (2003) The CSU Face Identification Evaluation System. Available: http://www.cs.colostate.edu/evalfacerec/algorithms5.php. Accessed 19 January 2013.
- 26. Bhatti Z E, Bajwa U I (2009) facerec: Provides base for implementing and testing face recognition algorithms. Available: http://code.google.com/p/facerec/. Accessed 19 January 2013.
- 27. Bhatti Z E, Bajwa U I, Taj I A (2009) Introducing set of internal parameters for Laplacian faces to enhance performance under varying conditions. Proc IEEE Int Mul Conf 1–5.
- 28. Bajwa U I, Taj I A, Bhatti Z E (2011) A comprehensive comparative performance analysis of Laplacianfaces and Eigenfaces for face recognition. Imaging Sci J 59: 32–40.
- 29. Bajwa U (2011) FaceRecEval: A MATLAB based face recognition evaluation platform. Available: http://code.google.com/p/facereceval/. Accessed 19 January 2013.