{"title":"Face Recognition Using Eigenfaces, Geometrical PCA Approximation and Neural Networks","authors":"Alina L. Machidon, O. Machidon, P. Ogrutan","doi":"10.1109/TSP.2019.8768864","DOIUrl":null,"url":null,"abstract":"The human face exhibits a high level of complexity when it is regarded as a multidimensional visual model, leading to face recognition systems that require difficult and extensive computations for coding and decoding the face images. A well-established approach in this regard is based on using principle component analysis (PCA) for both feature extraction and face recognition, known as the eigenface approach. This technique, despite a good recognition rate, suffers from the disadvantage of high computation cost due to the complexity of the PCA algorithm. In this paper, we use a geometrical approximated PCA (gaPCA) algorithm for computing the eigenfaces for three different datasets. The face recognition task is performed using a similarity score based on the inverse Euclidean distance for the first two datasets and using a nerual network in the third case. All the results are compared to the case where standard PCA is used. These accuracy results show that gaPCA represents a viable alternative to the classical statistical approach for computing the principal components.","PeriodicalId":399087,"journal":{"name":"2019 42nd International Conference on Telecommunications and Signal Processing (TSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 42nd International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2019.8768864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
The human face exhibits a high level of complexity when it is regarded as a multidimensional visual model, leading to face recognition systems that require difficult and extensive computations for coding and decoding the face images. A well-established approach in this regard is based on using principle component analysis (PCA) for both feature extraction and face recognition, known as the eigenface approach. This technique, despite a good recognition rate, suffers from the disadvantage of high computation cost due to the complexity of the PCA algorithm. In this paper, we use a geometrical approximated PCA (gaPCA) algorithm for computing the eigenfaces for three different datasets. The face recognition task is performed using a similarity score based on the inverse Euclidean distance for the first two datasets and using a nerual network in the third case. All the results are compared to the case where standard PCA is used. These accuracy results show that gaPCA represents a viable alternative to the classical statistical approach for computing the principal components.