FACE RECOGNITION USING CURVELET-BASED TWO-DIMENSIONAL PRINCIPLE COMPONENT ANALYSIS

Author(s):  
YAN ZHANG ◽  
BIN YU ◽  
HAI-MING GU

The task of face recognition has been actively researched in recent years because of its many applications in various domains. This paper presents a robust face recognition system using curvelet-based two-dimensional principle component analysis (2D PCA) to address the problem of human face recognition from still images. 2D PCA has advantages over PCA in evaluating the covariance matrix accurately and time complexity. Inspired by the attractive attributes of curvelets in catching the edge singularities with very few coefficients in a non-adaptive manner, we introduce the scheme of decomposing images into curvelet subbands and applying 2D PCA to create a representative feature set. Experiments were designed with different implementations of each module using standard testing database. We experimented with changing the illumination normalization procedure; comparing the baseline PCA-based method with the proposed scheme; studying effects on algorithm performance of k-nearest neighbor (kNN) classifier and Support Vector Machine (SVM) classifier in the classification process; also we experimented with different databases such as FERET, etc. High accuracy rate were achieved by the proposed scheme through a comparative study.

2021 ◽  
Vol 26 (1) ◽  
pp. 25-34
Author(s):  
Rifki Kosasih

Pengenalan wajah sangat dibutuhkan dalam sistem keamanan rumah karena dapat membantu mengetahui siapa saja yang sudah memasuki area rumah. Salah satu metode yang dapat digunakan dalam pengenalan wajah adalah metode Principle Component Analysis (PCA). Akan tetapi, metode PCA kurang optimal dalam melakukan pemisahan antar kelas. Oleh karena itu pada penelitian ini digunakan metode lain yang dapat melakukan pemisahan antar kelas secara optimal seperti metode Linear Discriminant Analysis (LDA). Data yang digunakan sebanyak 400 data citra wajah dengan komposisi 40 orang dengan tiap orang memiliki 10 citra wajah dengan berbagai ekspresi. Pada penelitian ini diusulkan untuk memperhatikan banyaknya data latih yang digunakan. Banyaknya citra wajah tiap orang yang digunakan untuk data latih adalah 5, 6, 7, 8 dan 9 citra wajah per orang. Selanjutnya dilakukan ekstraksi fitur dengan menggunakan metode LDA. Selanjutnya dilakukan klasifikasi terhadap fitur-fitur yang telah diperoleh dengan menggunakan metode K Nearest Neighbor (KNN). Berdasarkan hasil penelitian diperoleh bahwa tingkat akurasi terbesar yaitu sebesar 97,5% yang terjadi saat banyaknya citra data latih tiap orang adalah 9 dan banyaknya tetangga (K) adalah 1.


Author(s):  
FENGXI SONG ◽  
JANE YOU ◽  
DAVID ZHANG ◽  
YONG XU

Full rank principal component analysis (FR-PCA) is a special form of principal component analysis (PCA) which retains all nonzero components of PCA. Generally speaking, it is hard to estimate how the accuracy of a classifier will change after data are compressed by PCA. However, this paper reveals an interesting fact that the transformation by FR-PCA does not change the accuracy of many well-known classification algorithms. It predicates that people can safely use FR-PCA as a preprocessing tool to compress high-dimensional data without deteriorating the accuracies of these classifiers. The main contribution of the paper is that it theoretically proves that the transformation by FR-PCA does not change accuracies of the k nearest neighbor, the minimum distance, support vector machine, large margin linear projection, and maximum scatter difference classifiers. In addition, through extensive experimental studies conducted on several benchmark face image databases, this paper demonstrates that FR-PCA can greatly promote the efficiencies of above-mentioned five classification algorithms in appearance-based face recognition.


2021 ◽  
Vol 38 (1) ◽  
pp. 51-60
Author(s):  
Semih Ergin ◽  
Sahin Isik ◽  
Mehmet Bilginer Gulmezoglu

In this paper, the implementations and comparison of some classifiers along with 2D subspace projection approaches have been carried out for the face recognition problem. For this purpose, the well-known classifiers such as K-Nearest Neighbor (K-NN), Common Matrix Approach (CMA), Support Vector Machine (SVM) and Convolutional Neural Network (CNN) are conducted on low dimensional face representations that are determined from 2DPCA-, 2DSVD- and 2DFDA approaches. CMA, which is a 2D version of the Common Vector Approach (CVA), finds a common matrix for each face class. From the experimental results, we have observed that the SVM presents a dominant performance in general. When overall results of all datasets are considered, CMA is slightly superior to others in case of 2DPCA- and 2DSVD-based features matrices of the AR dataset. On the other side, CNN is better than other classifiers when it comes to develop a face recognition system based on original face samples and 2DPCA-based feature matrices of the Yale dataset. The experimental results indicate that use of these feature matrices with CMA, SVM, and CNN in classification problems is more advantageous than the use of original pixel matrices in the sense of both processing time and memory requirement.


Sign in / Sign up

Export Citation Format

Share Document