- Research Article
- Open Access
- Published:

# Fusion of PCA-Based and LDA-Based Similarity Measures for Face Verification

*EURASIP Journal on Advances in Signal Processing*
**volume 2010**, Article number: 647597 (2010)

## Abstract

The problem of fusing similarity measure-based classifiers is considered in the context of face verification. The performance of face verification systems using different similarity measures in two well-known appearance-based representation spaces, namely Principle Component Analysis (PCA) and Linear Discriminant Analysis (LDA) is experimentally studied. The study is performed for both manually and automatically registered face images. The experimental results confirm that our optimised Gradient Direction (GD) metric within the LDA feature space outperforms the other adopted metrics. Different methods of selection and fusion of the similarity measure-based classifiers are then examined. The experimental results demonstrate that the combined classifiers outperform any individual verification algorithm. In our studies, the Support Vector Machines (SVMs) and Weighted Averaging of similarity measures appear to be the best fusion rules. Another interesting achievement of the work is that although features derived from the LDA approach lead to better results than those of the PCA algorithm for all the adopted scoring functions, fusing the PCA- and LDA-based scores improves the performance of the system.

## 1. Introduction

In spite of the rapid advances in machine learning, in many pattern recognition problems, the decision making is based on simple concepts such as distance from or similarity to some reference patterns. This type of approach is particularly relevant when the number of training samples available to model a class of objects is very limited. Examples of such situations include content-based retrieval from image or video databases, where the query image is the only sample at our disposal to define the object model, or biometrics where only one or a few biometric traits can be acquired during subject enrolment to create a reference template. In biometric identity verification, a similarity function measures the degree of similarity of an unknown pattern to the claimed identity template. If the degree exceeds a pre-specified threshold, the unknown pattern is accepted to be the same as the claimed identity. Otherwise, it is rejected.

Different similarity measures have been adopted in different machine vision applications. In [1], a number of commonly used similarity measures including the City-block, Euclidean, Normalised Correlation (NC), Chi-square (), and Chebyshev distance have been considered in an image retrieval system. The reported experimental results demonstrate that the City-block and Chi-square metrics are more efficient in terms of both retrieval accuracy and retrieval efficiency. In a similar comparative study, it has been shown that the Chi-square statistics measure outperforms the other similarity measures for remote sensing image retrieval [2]. In another study, the effect of 14 scoring functions such as the City-block, Euclidean, NC, Canberra, Chebyshev, and Distance based Correlation Coefficients has been studied in the context of the face recognition problem [3] in the PCA space. It has been shown that a simplified form of Mahalanobis distance outperforms the other metrics. In [4], four classical distance measures, City-block, Euclidean, Normalised Correlation, and Mahalanobis distance have been compared in the PCA space. It has been shown that when the number of eigenvectors is relatively high, the Mahalanobis distance outperforms the other measures. Otherwise, a similar performance is achieved using different measures. It has been also propounded that no significant improvement is achieved by combining the distance measures.

A similarity score is computed in a suitable feature space. Commonly, similarity would be quantised in terms of a distance function, on the grounds that similar patterns will lie physically close to each other. Thus, the smaller the distance, the greater the similarity of two entities. The role of the feature space in similarity measurement is multifold. First of all, the feature space is selected so as to maximise the discriminatory information content of the data projected into the feature space and to remove any redundancy. However, additional benefits sought after from mapping the original pattern data into a feature space is to simplify the similarity measure deployed for decision making.

PCA and LDA are two classical tools widely used in the appearance-based approaches for dimensionality reduction and feature extraction. Many face recognition methods, such as eigenfaces [5] and fisherfaces [6], are built on these two techniques or their variants. Different researches show that in solving the pattern classification problems the LDA-based algorithms outperform the PCA-based ones, since the former take the between classes variations into account. The LDA is a powerful feature extraction tool for pattern recognition in general and for face recognition in particular. It was introduced to this application area by Belhumeur et al. in 1997 [6]. An important contributing factor in the performance of a face authentication system is the metric used for defining a matching score. Theoretically, Euclidean distance provides an optimal measure in the LDA space. In [7], it has been demonstrated that it is outperformed by the Normalised Correlation (NC) and Gradient Direction (GD). Also, in [8], the performance of the NC scoring function has been compared with the GD metric. The study has been performed on the BANCA database [9] using internationally agreed experimental protocols by applying a geometric face registration method based on manually or automatically annotated eyes positions. It has been concluded that overall the NC function is less sensitive to missregistration error but in certain conditions GD metric performs better. However, in [10], it has been further demonstrated that by optimising the GD metric, this metric almost always outperforms the NC metric for both manually and automatically registered data.

In this study, a variety of other metrics have been investigated, including Euclidean, City-block, Chebyshev, Canberra, Chi-square (), NC, GD, and Correlation coefficient-based distance. The experimental results in face verification confirm that, individually, other metrics on the whole do not perform as well as the NC and GD metrics in the LDA space. However, in different conditions, certain classifiers can deliver a better performance.

It is well known that a combination of many different classifiers can improve classification accuracy. Various schemes have been proposed for combining multiple classifiers. We concentrate on classifier combination at the decision-level, that is, combining similarity scores output by individual classifiers. Thus, the scores are treated as features, and a second-level classifier is constructed to fuse these scores.

Fusion rules can be divided into two main categories: fixed rules such as the sum, product, minimum, maximum, and median rule [11–13] and trained rules like the weighted averaging of classifiers outputs [14, 15], Support Vector Machines (SVM) [10], bagging, and boosting [16]. Overall, the fixed rules are most often used because of their simplicity and the fact that they do not require any training. Accordingly, equal weights are used for all the classifiers [11, 17].

However, in many studies it has been demonstrated that trained classifiers such as Support Vector Machines (SVMs) have the potential to outperform the simple fusion rules, especially when enough training data is available. In [18], AdaBoost has been adopted for combining unimodal features extracted from face and speech signals of individuals in multimodal biometrics. In [8] the fusion problem was solved by selecting the best classifier or a group of classifiers dynamically with the help of a gating function learnt for each similarity measure.

In summary, it is clear that it is still pertinent to ask which classifiers provide useful information and how the expert scores should be fused to achieve the best possible performance of the face verification system. In [19], considering a set of similarity measure-based classifiers within the LDA feature space, a sequential search algorithm was applied in order to find an optimum subset of similarity measures to be fused as a basis for decision making. The SVM classifier was used for fusing the selected classifiers.

In this paper, a variety of fixed and trained fusion rules are compared in the context of face authentication. Five fixed fusion rules (sum, min, max, median, and product) and two trained rules (the support vector machines and weighted averaging of scores) are considered. It is shown that a better performance is obtained by fusing the classifiers. Moreover, the adopted trained rules outperform the fixed rule. Although, the PCA-based classifiers perform nearly 3 times worse than the LDA-based one, an interesting finding of this paper compared to our previous work [19] is that the performance of the verification system can be further improved by fusing the LDA- and PCA-based classifiers. In [20], a similar study has been performed using Euclidean distance as the scoring function. In the training stage of the proposed algorithm, adopting a fixed reference as the central value of the decision making threshold, client specific weights are determined by calculating the average value of the Euclidean distance of all the patterns from each client template. The client specific weights are determined in both LDA and PCA spaces. The weights are then used within the framework of three simple untrained fusion rules. In the adopted experimental protocol, each subject images are divided into two parts as the training and test sets. The experimental study performed on the ORL and Yale data sets demonstrate that the combined classifier outperforms the individual PCA- and LDA-based classifiers [20]. Although the training and test images are different, since the same subjects are available within the training and test sets, the weighting process is somehow biased so that the performance of the system in the presence of new impostors (not those used for training) could be worse.

The rest of the paper is organised as follows. In the next section, the adopted scoring functions are introduced. Fusion rules are reviewed in Section 3. A description of the experimental design including the face database used in the study, the experimental protocols, and the experimental setup are given in Section 4. The experimental results using the adopted scoring functions and the fusion results are presented and discussed in Section 5. Finally a summary of the main findings and conclusions can be found in Section 6.

## 2. Similarity Functions

In a similarity measure-based face verification system, a matching scheme measures the similarity or distance of the test sample, , to the template of the claimed identity, , both projected into an appropriate feature space. The general form of a group of similarity measures which is called *Minkowski Distance* or *power norm metrics* () is defined as

where is the dimensionality and indexes the components of the two vectors.

The most commonly used similarity measures, *Manhattan* or *City-block* metric, *Euclidean* Distance (ED), and *Chebyshev* Distance are special cases of the Minkowski metric for , , and , respectively, that is, , , and metrics:

The *Canberra* Distance is also given by

This can be considered as the normalised Manhattan Distance. The *Chi-squared* () Distance is defined by

which is basically a relative Euclidean squared distance and is usually meant for nonnegative variables only.

In [7], it has been demonstrated that a matching score based on *Normalised Correlation* (NC) scoring function, defined by the following equation, is more efficient:

Another similarity measure which is conceptually the same as the NC function is the *Correlation Coefficients*-based distance. For more details, the reader is referred to [3].

The *Gradient Direction* (GD) metric proposed in [7, 21] measures the distance between a probe image and a model in the gradient direction of the a posteriori probability function associated with the hypothesised client identity . A mixture of Gaussian distributions with isotropic covariance matrix has been assumed as the density function representing the anticlass (world population) estimated from the data provided by all the other users (). The diagonal elements of the isotropic covariance matrix are assumed to have values related to the magnitude of variation of the image data in the feature space. It was demonstrated that in a face verification system, applying GD metric is even more efficient than the NC function. This matching score is defined as

where refers to the gradient direction. For the isotropic structure of the covariance matrix, that is, , the optimal direction would be

Note that the magnitude of will affect the gradient direction through the values of density .

## 3. Similarity Scores Fusion

One of the very promising research directions in the field of pattern recognition and computer vision is classifier fusion. It has been recognised that the classical approach to designing a pattern recognition system which focuses on finding the best classifier has a serious drawback. Any complementary discriminatory information that other classifiers may capture is not tapped. Multiple expert fusion aims to make use of many different designs to improve the classification performance. In the case considered here, as different metrics span the feature space in different ways, it seems reasonable to expect that a better performance could be obtained by combining the resulting classifiers.

Since the scores for different classifiers lie in different ranges, a normalisation process is required to transform these score to the same range before combining them [22]. The simplest normalisation technique is the min-max normalisation. The min-max normalisation is best suited for the case where the bounds (maximum and minimum values) of the scores produced by a matcher are known. In this case, we can easily shift the minimum and maximum scores to 0 and 1, respectively. Given a set of scores for each classifier , , where is the number of samples, the normalised scores are given by

where and are, respectively, the original and normalised scores associated to the th sample. and are the minimum and maximum scores determined from a training set.

As mentioned earlier, two main groups of fusion rules, untrained (fixed) and trained rules can be applied for classifiers fusion. The untrained methods such as Sum (or Average), Product, Min, Max,and Median are very well known approaches. For example, the Sum rule is defined as

where is the number of classifiers. This is simply equivalent to averaging the normalised scores over the classifiers. A variety of trained fusion techniques such as neural network classifier, Bayesian classifier, and SVM have been suggested. It has been shown that the SVM classifier is among the best trained fusion rules. In [10], decision level fusion strategy using the SVMs has been adopted for combining the similarity measure-based classifiers. A very good performance has been reported using the adopted method.

Another promising trained rule involves a weighted averaging of similarity scores. Obviously, the technique used for determining the weight is an important factor in such a method.

### 3.1. Support Vector Machines

A Support Vector Machine is a two-class classifier showing superior performance to other methods in terms of Structural Risk Minimisation [23]. For a given training sample , , where is the object marked with a label , it is necessary to find the direction along which the margin between objects of two classes is maximal. Once this direction is found the decision function is determined by threshold :

The threshold is usually chosen to provide equal distance to the closest objects of the two classes from the discriminant hyperplane , which is called the optimal hyperplane. When the classes are linearly nonseparable some objects can be shifted by a value towards the right class. This converts the original problem into one which exhibits linear separation. The parameters of the optimal hyperplane and the optimal shifts can be found by solving the following quadratic programming problem:

where parameter defines the penalty for shifting the objects that would otherwise be misclassified in the case of linearly nonseparable classes.

The QP problem is usually solved in a dual formulation:

Those training objects with are called Support Vectors, because only they determine direction :

The dual QP problem can be rapidly solved by the Sequential Minimal Optimisation method, proposed by Platt [24]. This method exploits the presence of linear constraints in (14). The QP problem is iteratively decomposed into a series of one variable optimisation problems which can be solved analytically.

For the face verification problem, the size of the training set for clients is usually less than the one for impostors. In such a case, the class of impostors is represented better. Therefore, it is necessary to shift the optimal hyperplane towards the better represented class. In this paper, the size of the shift is determined in the evaluation step based on the Equal Error Rate criterion.

### 3.2. Weighted Averaging of Similarity Measures

Compare to the simple averaging rule, in the case of weighted averaging, different weights are considered for the scores achieved from different classifiers, that is,

where is the weight assigned to the th classifier output.

In this study, three methods of weighted averaging are considered. In the first group, each classifier weight is determined based on the performance of the classifier in an evaluation step. The smaller the error rate, the greater the weight assigned to the classifier output, that is,

where is the Total Error Rate of the th classifier in the Evaluation stage.

The main idea behind the second adopted method is to minimise the correlation between classifier outputs. In practise, outputs of multiple classifiers are not uncorrelated, but some classifiers are more correlated than others. Therefore, it is reasonable to assign different weights to different classifiers according to their correlation. Principle Component Analysis, PCA, is one of the statistical techniques frequently used to decorrelate the data [25]. Denote by the vector of scores delivered by the classifiers, that is,

Let and , be the eigenvalues and eigenvectors of the covariance matrix of the evaluation score vectors retaining a certain proportion of the score variance. The eigenvectors are used as the bases of a new feature space. Applying the simple averaging rule (equation (11)) to the scores transformed to this feature space is equivalent to the weighted averaging of the original scores in (16) where are determined using the following equation:

As the third method of weighted averaging of the scores, the above mentioned idea can be extended by applying the LDA algorithm. In a face verification system, two groups of score vectors are considered: client scores and impostor scores. In the evaluation step, these classes of data can be used within the framework of the Linear Discriminant Analysis (LDA) for computing the feature space bases and the classifier weights.

## 4. Experimental Design

In this section, the face verification experiments carried out on images of the BANCA database are described. The BANCA database is briefly introduced first. The main specification of the experimental setup is then presented.

### 4.1. BANCA Database

The BANCA database has been designed in order to test multimodal identity verification systems deploying different cameras in different scenarios (Controlled, Degraded, and Adverse). The database has been recorded in several languages in different countries. Our experiments were performed on the English section of the database. Each section contains 52 subjects (26 males and 26 females).

Each subject participated to 12 recording sessions in different conditions and with different cameras. Sessions 1–4 contain data under *Controlled* conditions whereas sessions 5–8 and 9–12 contain *Degraded* and *Adverse* scenarios, respectively. In order to create more independent experiments, images in each session have been divided into two groups of 26 subjects (13 males and 13 females). Experiments can be performed on each group separately.

In the BANCA protocol, 7 different distinct experimental configurations have been specified, namely, Matched Controlled (Mc), Matched Degraded (Md), Matched Adverse (Ma), Unmatched Degraded (Ud), Unmatched Adverse (Ua), Pooled test (P), and Grand test (G). Table 1 describes the usage of the different sessions in each configuration. "T" refers to the client training while "C" and "I" depict client and impostor test sessions, respectively.

### 4.2. Experimental Setup

The performance of different decision making methods discussed in Section 2 is experimentally evaluated on the BANCA database using the configurations discussed in the previous section. The evaluation is performed in the LDA and PCA spaces. The original resolution of the image data is . The experiments were performed with a relatively low resolution face images, namely, . The results reported in this paper have been obtained by applying a geometric face normalisation based on the eyes positions. The eyes positions were localised either manually or automatically. A fast method of face detection and eyes localisation was used for the automatic localisation of eyes centre [26]. The XM2VTS database [27] was used for calculating the LDA and PCA projection matrices.

The thresholds in the decision making system have been determined based on the Equal Error Rate criterion, that is, by the operating point where the false rejection rate (FRR) is equal to the false acceptance rate (FAR). The thresholds are set either globally (*GT*) or using the client specific thresholding (*CST*) technique [21]. In the training sessions of the BANCA database 5 client images per person are available. In the case of global thresholding method, all these images are used for training the clients template. The other group data is then used to set the threshold. In the case of the client specific thresholding strategy, only two images are used for the template training and the other three along with the other group data are used to determine the thresholds. Moreover, in order to increase the number of data used for training and to take the errors of the geometric normalisation into account, 24 additional face images per each image were generated by perturbing the location of the eyes position around the annotated positions.

In the previous studies [21], it has been demonstrated that the Client Specific Thresholding (CST) technique is superior in the matched scenario (Mc, Md, Ma, and G) whereas the Global Thresholding (GT) method gives a better performance on the unmatched protocols. The results reported in the next section using thresholding have been acquired using this criterion.

## 5. Experimental Results and Discussion

As mentioned earlier, in the GD metric, the impostor distributions have been approximated by isotropic Gaussian functions with a standard deviation of , that is, . The order of is related to the order of the standard deviation of the input data (grey level values in the LDA feature space). In the previous work [8], a fixed value equal to has been used for . In this work, in order to optimise the metric for dealing with different imaging conditions, the value of is adaptively determined in the evaluation step where the performance of the system for different values of is evaluated. As examples, Figure 1 contains plots of the Total Error rate versus the value of in the evaluation and test steps for the Mc, Md, Ud, and P protocols.

The evaluation plots show that by increasing the value of , the Total Error rate first rapidly decreases. Then, for larger values of , the TE rate remains relatively constant or increases gradually. From these plots, one can also see that the behaviour of the system in the evaluation and test phases is almost consistent. Therefore, the optimum can be found in the evaluation step by looking for the point after which the performance of the system is not significantly improved by increasing the value of . The associated value of is then used in the test stage. Since, the effectiveness of a similarity measure depends on the adopted method of feature extraction, in the next subsection the experimental results using the PCA and LDA algorithms are reported. The fusion rules are presented in the sequel.

### 5.1. Experimental Results in the PCA and LDA Feature Spaces

Figure 2 contains the results obtained using the individual scoring functions on the evaluation and test data sets in the PCA and LDA spaces when manually annotated eyes position were used for the face geometric normalisation. The Total Error rates in the Evaluation (TEE) and Test (TET) stages have been used as performance measures in the plots. These results clearly demonstrate that among the adopted metrics, the GD metric is individually the outright winner.

For the sake of simplicity of comparison, Table 2 contains the evaluation and test results for the GD metric using the PCA and LDA spaces. These results demonstrate that a better performance can always be achieved using the LDA space.

Table 3 also contains a summary of the results obtained using the individual scoring functions on the evaluation and test sets when manually annotated eyes positions were used for the face geometric normalisation in the LDA space. The values in the table indicate the Total Error rates in the Evaluation (TEE) and Test (TET) stages, respectively.

The results of the similar experiments with automatically registered data in the LDA feature space demonstrate that in this case the optimised GD function again delivers a better or at least comparable performance. The performance of other metrics, with the exception of NC, is much worse. These results are shown in Figure 3.

### 5.2. Fusion Results and Discussions

In the next step, we investigated the effect of fusing the classifiers employing the different similarity measures. In the first group of experiments, we compared the fixed combination rules (Sum, Product, Min, Max, and Median) in which all the classifiers are deemed to carry the same weight. The results obtained in the evaluation and test steps for both manually and automatically registered data are shown in Figure 4. These results clearly demonstrated that among the adopted fixed rules, the Sum rule outperforms the others for both manually and automatically registered data. For the sake of simplicity of comparison of the results using the untrained and trained rules, the fusion results using the Sum rule for manually registered data have been reported in Table 4.

In the second group of fusion experiments, different weighted averaging of the outputs of classifiers employing different similarity measures were examined. The results are presented in Table 4. In this table WA1, WA2, and WA3 represent the weighted averaging results for the error minimisation method, PCA, and LDA, respectively.

As can be seen, all the adopted weighted averaging methods give better results compared to the simple averaging (Sum) rule. Also, among the weighted averaging methods, a better performance is achieved using the LDA method.

Figure 5 contains comparative plots of the results using the Sum rule, LDA-based weighted averaging, and the SVMs. These plots demonstrate that the trained methods outperform the untrained (Sum) rule. In most of the cases, comparable results are obtained using LDA weighting and SVMs.

Since, the effectiveness of a similarity measure depends on the adopted method of feature extraction, in the next step, the merit of fusing the PCA- and LDA-based classifiers using SVM was investigated. Figure 6 contains the comparative plots of the Total Error rates obtained in the Evaluation (TEE) and Test (TET) stages for both manually and automatically registered data. These plots demonstrate that these methods outperform the other rules (see Table 5).

Overall, the results clearly demonstrate that the proposed similarity measure fusion considerably improves the performance of the face verification system.

## 6. Conclusions

The problem of fusing similarity measure-based classifiers in face verification was considered. First, the performance of face verification systems in PCA and LDA feature spaces with different similarity measure classifiers was experimentally evaluated. The study was performed for both manually and automatically registered face images. The experimental results confirm that our optimised Gradient Direction metric in the LDA feature space outperforms the other investigated metrics. Different methods for the selection and fusion of the various similarity measure-based classifiers were compared. The experimental results demonstrate that the combined classifiers outperform any individual verification algorithm. Moreover, the Support Vector Machines and Weighted Averaging of similarity measures have been shown to be the best fusion rules. It was also shown that although the features derived from the LDA approach lead to better results, than those of the PCA algorithm, fusing the PCA- and LDA-based scores improves the performance further. Based on our previous study within the LDA space [19], further improvement is also expected by adaptively selecting a subset of the LDA-based and PCA-based classifiers.

## References

- 1.
Zhang D, Lu G: Evaluation on similarity measurement for image retrieval.

*Neural Network and Signal Processing*2003, 2: 228-231. - 2.
Bao Q, Guo P: Comparative studies on similarity measures for remote sensing image retrieval.

*Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC '04), October 2004*1112-1116. - 3.
Perlibakas V: Distance measures for PCA-based face recognition.

*Pattern Recognition Letters*2004, 25(6):711-724. 10.1016/j.patrec.2004.01.011 - 4.
Yambor WS, Draper BA, Beveridge JR: Analyzing PCA-based face recognition algorithm: eigenvector selection and distance measures. In

*Empirical Evaluation Methods in Computer Vision*. Edited by: Christensen , Phillips J. World Scientific Press, Singapore; 2002. - 5.
Turk M, Pentland A: Eigenfaces for recognition.

*Journal of Cognitive Neuroscience*1991, 3(1):71-86. 10.1162/jocn.1991.3.1.71 - 6.
Belhumeur PN, Hespanha JP, Kriegman DJ: Eigenfaces vs. fisherfaces: recognition using class specific linear projection.

*IEEE Transactions on Pattern Analysis and Machine Intelligence*1997, 19(7):711-720. 10.1109/34.598228 - 7.
Kittler J, Li YP, Matas J: On matching scores for LDA-based face verification. In

*Proceedings of British Machine Vision Conference, 2000*Edited by: Mirmehdi M, Thomas B. 42-51. - 8.
Sadeghi MT, Kittler J: Confidence based gating of multiple face authentication experts.

*Proceedings of Joint IAPR International Workshops on Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition (SSPR '06), August 2006, Hong Kong, Lecture Notes in Computer Science*4109: 667-676. - 9.
Bailly-Bailliére E, Bengio S, Bimbot F, Hamouz M, Kittler J, Mariéthoz J, Matas J, Messer K, Popovici V, Porée F, Ruiz B, Thiran J-P: The BANCA database and evaluation protocol.

*Proceedings of International Conference on Audio and Video Based Person Anthentication, 2003*2688: 625-638. - 10.
Sadeghi MT, Samiei M, Almodarresi SMT, Kittler J: Similarity measures fusion using SVM classifier for face authentication.

*Proceedings of the 3rd International Conference on Computer Vision Theory and Applications (VISAPP '08), January 2008, Funchal, Madeira, Portugal*2: 105-110. - 11.
Kittler J, Hatef M, Duin RPW, Matas J: On combining classifiers.

*IEEE Transactions on Pattern Analysis and Machine Intelligence*1998, 20(3):226-239. 10.1109/34.667881 - 12.
Kittler J, Roli F:

*Multiple Classifier Systems*.*Volume 2096*. Springer, Berlin, Germany; 2001. - 13.
Xu L, Krzyzak A, Suen CY: Methods of combining multiple classifiers and their applications to handwriting recognition.

*IEEE Transactions on Systems, Man and Cybernetics*1992, 22(3):418-435. 10.1109/21.155943 - 14.
Verikas A, Lipnickas A, Malmqvist K, Bacauskiene M, Gelzinis A: Soft combining of neural classifiers: a comparative study.

*Pattern Recognition Letters*1999, 20: 429-444. 10.1016/S0167-8655(99)00012-4 - 15.
Roli F, Fumera G: Analysis of linear and order statistics combiners for fusion of imbalanced classifiers. In

*Proceedings of the 3rd International Workshop on Multiple Classifier Systems, June 2002, Cagliari, Italy*. Springer; 252-261. - 16.
Freund Y, Schapire RE: A decision-theoretic generalization of on-line learning and an application to boosting.

*Journal of Computer and System Sciences*1997, 55(1):119-139. 10.1006/jcss.1997.1504 - 17.
Duin RPW: The combining classifier: to train or not to train?

*Proceedings of the International Conference on Pattern Recognition, 2002*16(2):765-770. - 18.
Maghooli K, Moin MS: A new approach on multimodal biometrics based on combining neural networks using AdaBoost.

*Proceedings of the International ECCV Workshop on Biometric Authentication (BioAW '04), May 2004, Prague, Czech*3087: 332-341. - 19.
Sadeghi MT, Samiei M, Kittler J: Selection and fusion of similarity measure based classifiers using support vector machines.

*Proceedings of Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition (SSPR '08), 2008, Lecture Notes in Computer Science*5342: 479-488. - 20.
Marcialis GL, Roli F: Fusion of LDA and PCA for face verification. In

*Proceedings of the International ECCV Workshop on Biometric Authentication, 2002, Lecture Notes in Computer Science*Edited by: Marcialis M, Bigun J. 2359: 30-37. - 21.
Sadeghi MT, Kittler J: Decision making in the LDA space: generalised gradient direction metric.

*Proceedings of the 6th IEEE International Conference on Automatic Face and Gesture Recognition, May 2004, Seoul, Korea*248-253. - 22.
Jain A, Nandakumar K, Ross A: Score normalization in multimodal biometric systems.

*Pattern Recognition*2005, 38(12):2270-2285. 10.1016/j.patcog.2005.01.012 - 23.
Vapnik V:

*The Nature of Statistical Learning Theory*. Springer, New York, NY, USA; 1995. - 24.
Platt J:

*Sequential minimal optimization: a fast algorithm for training support vector machines.*Microsoft Research, Redmond, Wash, USA; April 1998. - 25.
Bartlett MS, Movellan JR, Sejnowski TJ: Face recognition by independent component analysis.

*IEEE Transactions on Neural Networks*2002, 13(6):1450-1464. 10.1109/TNN.2002.804287 - 26.
Hamouz M, Kittler J, Kamarainen J-K, Paalanen P, Kälviäinen H, Matas J: Feature-based affine-invariant localization of faces.

*IEEE Transactions on Pattern Analysis and Machine Intelligence*2005, 27(9):1490-1495. - 27.
Messer K, Matas J, Kittler J, Luettin J, Maitre G: XM2VTSDB: the extended m2vts database.

*Proceedings of the 2nd International Conference on Audio and Video-based Biometric Person Authentication, 1999*72-77.

## Acknowledgment

The financial support from the Iran Telecommunication Research Centre and the EU funded Project Mobio (http://www.mobioproject.org/) Grant IST-214324 is gratefully acknowledged.

## Author information

### Affiliations

### Corresponding author

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Sadeghi, M.T., Samiei, M. & Kittler, J. Fusion of PCA-Based and LDA-Based Similarity Measures for Face Verification.
*EURASIP J. Adv. Signal Process.* **2010, **647597 (2010). https://doi.org/10.1155/2010/647597

Received:

Accepted:

Published:

### Keywords

- Support Vector Machine
- Linear Discriminant Analysis
- Principle Component Analysis
- Fusion Rule
- Total Error Rate