Face recognition using two-dimensional nonnegative principal component analysis

In this paper, based on the study of the Two-Dimensional Principal Component Analysis (2DPCA), Two-Dimensional Principal Component Analysis (2DPCA) and fuzzy set theory, we propose a integrated face recognition algorithm based on wavelet subspace. This method can make good use of the advantages of each single method, and also can make up for the defect of each other. The comparison of the results of the different methods identification effect on the ORL、YALE and FERET face database show, the integrated method proposed in this paper improves the recognition rate, and it also reduces the training and classification time as well. Key word: face recognition; Two-Dimensional Principal Component Analysis (2DPCA); Two-Dimensional Linear Discriminant Analysis (2DLDA); fuzzy set theory; feature extraction be divided into several categories:the method based on geometric features、the method based on model、the method based on the statistical、the method based on neural network method and the method of combining multiple classifiers, this paper mainly focuses on the method based on statistics. The method based on statistical faced the image as random vector, thus using some statistical methods to analyze the face model, the most representative methods include the eigenface method based on principal component analysis which proposed by Turk M (2)

Two-dimensional feature extraction methods such as two-dimensional principal component analysis (2DPCA) and two-dimensional linear discriminant analysis (2DLDA) have been extensively studied in the past several years. Numerous experimental results demonstrate that these two-dimensional feature extraction methods are generally more efficient than and at least as effective as their one-dimensional counterparts in face recognition. However, in contrary to the large number of studies in two-dimensional feature extraction methods, studies in two-dimensional pattern classification are quite few. In this paper we propose two kinds of two-dimensional nearest neighbor classifiers and test their performance in face recognition. Extensive experimental studies conducted on four benchmark face image databases: OR, Yale, FERET, and AR demonstrate that the proposed classifiers can achieve higher recognition accuracies than the nearest neighbor classifier in general.

An efficient method of face detection based on two-dimensional principal component analysis (PCA) incorporating with support vector machine (SVM) is proposed in this paper. Firstly, a 2DPCA coarse filter with relatively lower computational complexity is applied to the whole input image to filter out most of the non-face, then follows the SVM classifier to make the final decision, so the detection process is speeded up. As opposed to PCA, 2DPCA is based on 2D image matrices rather than ID vector so the image matrix does not need to be transformed into a vector prior to feature extraction. The experiment results show that the method can effectively detect faces under complicated background, and the processing time is shorter than using SVM alone

Dimensionality reduction methods play an important role in face recognition. Principal component analysis (PCA) and two-dimensional principal component analysis (2DPCA) are two kinds of important methods in this field. Recent research seems like that 2DPCA method is superior to PCA method. To prove if this conclusion is always true, a comprehensive comparison study between PCA and 2DPCA methods was carried out. A novel concept, called column-image difference (CID), was proposed to analyze the difference between PCA and 2DPCA methods in theory. It is found that there exist some restrictive conditions when 2DPCA outperforms PCA. After theoretical analysis, the experiments were conducted on four famous face image databases. The experiment results confirm the validity of theoretical claim.

The failures of rolling bearings usually cause the breakdown of rotating machinery. Therefore, bearing fault diagnosis is receiving more and more attentions. In this paper, a new coding-statistic feature is proposed for bearing fault diagnosis. Firstly, a waveform coding matrix (WCM) is drawn from each signal using a coding algorithm then a statistical feature is extracted from the WCM with a pre-defined dictionary. Secondly, all statistical features are processed using two-dimensional principal component analysis (2DPCA) to reduce redundant information and dimensionality. Finally, a nearest neighbor classifier (NNC) is employed to classify the bearing faults. Two bearing fault classification problems are utilized to demonstrate the effectiveness of the proposed scheme. Experimental results show that an excellent performance could be accomplished with the proposed scheme.

The equivalence of two-dimensional PCA to line-based PCA

In Brief

The ionospheric total electron content (TEC) data from 05 to 10 January 2013 (UT) were examined by two-dimensional principal component analysis (2DPCA) and revealed a TEC anomaly related to the volcanic eruption in Colima, Mexico on 06 January, 2013. A TEC anomaly was detected above the volcano from 21:00 to 21:05 on 06 January 2013 (UT). The anomaly occurred for at least 5 minutes, during this time period we could identify the equatorial ionization anomaly (EIA). The shock acoustic wave produced by eruption-induced seismic activity may be the cause of the observed TEC anomaly. We show that it is possible to monitor or predict volcanic eruptions and their associated seismic activity through the use of two-dimensional principal component analysis of the resulting TEC anomalies.

A feature extraction method of palmprint recognition based on Two-Dimensional Principal Component Analysis (2DPCA) is proposed in this work. A series of experiments were performed on the PolyU- Online- Palmprint ---Database with a nearest neighbor classifier and cosine distance. The recognition rate is 99.14%. The 2DPCA method has more recognition accuracy and more computationally efficient than PCA, especially in the small training samples. At the same time the selection of threshold has been researched in different application systems.

This paper presents a comparison between one-dimensional component analysis (1D-PCA) and two-dimensional principal component analysis (2D-PCA) under two different types of classification techniques namely k-nearest neighbor (kNN) and Support Vector Machines (SVM). These two techniques differ in the method to determine the image covariance matrix. 2DPCA used 2D image matrices instead of column vectors in 1DPCA. The eigenvectors derived from these matrices will result in images in reduced dimensions to be used for classification. K-nearest neighbor algorithm (kNN) and Support Vector Machines (SVM) were used for classification. The performance measures used for comparison were classification accuracy and computational time. The tests were performed on the ORL image database. The experimental results indicate that 2DPCA outperforms in terms of classification accuracy and computational complexity.

This paper proposes a two-dimensional color uncorrelated principal component analysis algorithm(2DCUPCA) for unsupervised subspace learning directly from color face images. The 2DCUPCA can be used to explore uncorrelated properties among color-based features, which contain minimum redundancy and ensure linear independence among features. Furthermore, the proposed 2DCUPCA provided the theoretical foundations analysis and proved the uncorrelated property between color-based features in theory. This makes it sure that the extracted features directly from three color image matrices will be uncorrelated. Finally, experimental results on the AR and FRGC-2 color face databases show that 2DCUPCA achieves better recognition performance than other color face recognition methods.KeywordsPattern recognitionface recognitionuncorrelated principal component analysisfeature extraction

In this paper, based on face recognition, the core algorithm is studied, which was applied in access control system. This algorithm carries on two-dimensional principal component analysis (2DPCA), singular value decomposition (SVD) and the fusion of 2DPCA and SVD, which the main characteristic vector of the PCA is fused to form a new one that is taken as the distinction standard. The experiment results, by means of ORL and Yale face database, the recognition rate is up to 87% and 98.9%, respectively. The effectiveness of the proposed face recognition algorithm and its insensitivity to the facial expression, illumination and posture are shown in terms of both the absolute performance indices and the comparative performance against some popular face recognition schemes such as singular value decomposition based method.

Unified framework for basis-based speaker adaptation based on sample covariance matrix of variable dimension

Advanced variations of two-dimensional principal component analysis for face recognition

The traditional two-Dimensional Principal Component Analysis(2DPCA) only extracts the in-line features of data of face image, the direction of feature extraction is relatively simple, and the feature extraction in other directions is not considered. In order to extract the features of the image from multiple angles and provide more abundant information for recognition, a new method of 2DPCA face recognition is proposed. The new algorithm first self-corrects the face image, at the same time, it extracts the low frequency information of the image, and then it uses the Perceptual hash technique to obtain the ‘fingerprint’ of the image. Then, the new algorithm will rotate multi-angle images from the self-corrected face images and extract the features separately to get multi-angle feature information. Finally, the training sample pictures are classified again for each category, and the images of similar expressions or features are classified to retain the special expressions or features. The numerical experiments in the ORL human face databases show that the improved algorithm is superior to the traditional 2DPCA algorithm.