Numerical Analysis and Comparison of spectral Decomposition Methods in Biometric Applications

Face recognition is a challenging problem in computer vision and artificial intelligence. One of the main challenges consists in establishing a low-dimensional feature representation of the images having enough discriminatory power to perform high accuracy classification. Different methods of supervised and unsupervised classification can be found in the literature, but few numerical comparisons among them have been performed on the same computing platform. In this paper, we perform this kind of comparison, revisiting the main spectral decomposition methods for face recognition. We also introduce for the first time, the use of the noncentered PCA and the 2D discrete Chebyshev transform for biometric applications. Faces are represented by their spectral features, that is, their projections onto the different spectral basis. Classification is performed using different norms and/or the cosine defined by the Euclidean scalar product in the space of spectral attributes. Although this constitutes a simple algorithm of unsupervised classification, several important conclusions arise from this analysis: (1) All the spectral methods provide approximately the same accuracy when they are used with the same energy cutoff. This is an important conclusion since many publications try to promote one specific spectral method with respect to other methods. Nevertheless, there exist small variations on the highest median accuracy rates: PCA, 2DPCA and DWT perform better in this case. Also all the covariance-free spectral decomposition techniques based on single images (DCT, DST, DCHT, DWT, DWHT, DHT) are very interesting since they provide high accuracies and are not computationally expensive compared to covariance-based techniques. (2) The use of local spectral features generally provide higher accuracies than global features for the spectral methods which use the whole training database (PCA, NPCA, 2DPCA, Fisher's LDA, ICA). For the methods based on orthogonal transformations of single images, global features calculated using the whole size of the images appear to perform better. (3) The distance criterion generally provides a higher accuracy than the cosine criterion. The use of other p-norms (p > 2) provides similar results to the Euclidean norm, nevertheless some methods perform better. (4) No spectral method can provide 100% accuracy by itself. Therefore, other kind of attributes and supervised learning algorithms are needed. These results are coherent for the ORL and FERET databases. Finally, although this comparison has been performed for the face recognition problem, it could be generalized to other biometric authentication problems.

[1]  Hyeonjoon Moon,et al.  The FERET Evaluation Methodology for Face-Recognition Algorithms , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Marc Rioux,et al.  Invariant Robust 3-D Face Recognition based on the Hilbert Transform in Spectral Space , 2006, J. Multim..

[3]  Amine Nait-Ali,et al.  Hidden biometrics: Towards using biosignals and biomedical images for security applications , 2011, International Workshop on Systems, Signal Processing and their Applications, WOSSPA.

[5]  Alejandro F. Frangi,et al.  Two-dimensional PCA: a new approach to appearance-based face representation and recognition , 2004 .

[6]  Sim Heng Ong,et al.  Image Analysis by Tchebichef Moments , 2001, IEEE Trans. Image Process..

[7]  H Moon,et al.  Computational and Performance Aspects of PCA-Based Face-Recognition Algorithms , 2001, Perception.

[8]  S. Kak The discrete Hilbert transform , 1970 .

[9]  Rama Chellappa,et al.  Human and machine recognition of faces: a survey , 1995, Proc. IEEE.

[10]  Ali N. Akansu,et al.  Walsh-Like Nonlinear Phase Orthogonal Codes for Direct Sequence CDMA Communications , 2007, IEEE Transactions on Signal Processing.

[11]  David Zhang,et al.  Impact of Full Rank Principal Component Analysis on Classification Algorithms for Face Recognition , 2012, Int. J. Pattern Recognit. Artif. Intell..

[12]  Martin D. Levine,et al.  Face Recognition Using the Discrete Cosine Transform , 2001, International Journal of Computer Vision.

[13]  L Sirovich,et al.  Low-dimensional procedure for the characterization of human faces. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[14]  Rabia Jafri,et al.  A Survey of Face Recognition Techniques , 2009, J. Inf. Process. Syst..

[15]  Yuan Yan Tang,et al.  Illumination invariant face recognition based on the new phase features , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[16]  Andrew Beng Jin Teoh,et al.  Extraction and fusion of partial face features for cancelable identity verification , 2012, Pattern Recognit..

[17]  Rauf Kh. Sadykhov,et al.  Face recognition algorithm on the basis of truncated Walsh-Hadamard transform and synthetic discriminant functions , 2004, Sixth IEEE International Conference on Automatic Face and Gesture Recognition, 2004. Proceedings..

[18]  Sylvain Chartier,et al.  An Introduction to Independent Component Analysis: InfoMax and FastICA algorithms , 2010 .

[19]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[20]  R. Mukundan,et al.  A Fast 4 $\times$ 4 Forward Discrete Tchebichef Transform Algorithm , 2007, IEEE Signal Processing Letters.

[21]  R. Fisher THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[22]  Somchai Jitapunkul,et al.  TWO-Dimensional Linear Discriminant Analysis of Principle Component Vectors for Face Recognition , 2006, ICASSP.

[23]  Marian Stewart Bartlett,et al.  Face recognition by independent component analysis , 2002, IEEE Trans. Neural Networks.

[24]  M. E. Yahia,et al.  Walsh-Hadamard Transform for Facial Feature Extraction in Face Recognition , 2007 .

[25]  Chaur-Chin Chen,et al.  SVD-based projection for face recognition , 2007, 2007 IEEE International Conference on Electro/Information Technology.

[26]  Robi Polikar,et al.  An Ensemble-Based Incremental Learning Approach to Data Fusion , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[27]  Hua Yu,et al.  A direct LDA algorithm for high-dimensional data - with application to face recognition , 2001, Pattern Recognit..

[28]  Aapo Hyvärinen,et al.  A Fast Fixed-Point Algorithm for Independent Component Analysis of Complex Valued Signals , 2000, Int. J. Neural Syst..

[29]  W.L. Woo,et al.  Secure Authentication for Face Recognition , 2007, 2007 IEEE Symposium on Computational Intelligence in Image and Signal Processing.

[30]  H. Andrews,et al.  Hadamard transform image coding , 1969 .

[31]  S. Mohamed Mansoor Roomi,et al.  A Review of Face Recognition Methods , 2013, Int. J. Pattern Recognit. Artif. Intell..

[32]  Lawrence Sirovich,et al.  Application of the Karhunen-Loeve Procedure for the Characterization of Human Faces , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  Ying-Kuei Yang,et al.  A Low-Computation Approach for Human Face Recognition , 2012, Int. J. Pattern Recognit. Artif. Intell..

[34]  Kenneth George Beauchamp,et al.  Applications of Walsh and related functions : with an introduction to sequency theory , 1985 .

[35]  Ja-Chen Lin,et al.  A new LDA-based face recognition system which can solve the small sample size problem , 1998, Pattern Recognit..