双向压缩二维特征抽取人脸识别新方法

提出了二维主成分分析(2DPCA)与二维线性鉴别分析(2DLDA)相结合的双向压缩投影的子空间人脸识别方法.该方法在进行一次2DPCA运算后,对特征矩阵进行转置,再进行2DLDA运算,与(2D)~2PCA与(2D)~2LDA相比,充分利用了2DPCA和2DLDA的优点,既包含了样本的类别信息,又消除了图像矩阵行和列的相关性,有效地提取了行和列的识别信息,识别特征维数也大幅度减少.在ORL和PERET人脸库上的实验表明,在不影响识别速度的情况下,其识别率优于现有二维特征提取方法.     

基于模块2DPCA的人脸识别方法

提出了模块2DPCA（two-dimensional principal component analysis）的人脸识别方法。模块2DPCA方法先对图像矩阵进行分块，将分块得到的子图像矩阵直接用于构造总体散布矩阵，然后利用总体散布矩阵的特征向量进行图像特征抽取。与基于图像向量的鉴别方法（比如PCA）相比，该方法在特征抽取之前不需要将子图像矩阵转化为图像向量，能快速地降低鉴别特征的维数，可以完全避免使用矩阵的奇异值分解，特征抽取方便；此外，模块2DPCA是2DPCA的推广。在ORL和NUST603人脸库上的试验结果表明，模块2DPCA方法在识别性能上优于PCA，比2DPCA更具有鲁棒性。     

二维主元分析在人脸识别中的应用研究

结合二维主元分析（two-dimensional principal component analysis,2DPCA）的特点,将2DPCA算法用于人脸识别。它与主元分析（principal component analysis,PCA）的不同之处在于,2DPCA算法以图像矩阵为分析对象;而PCA算法以图像的一维向量为分析对象。2DPCA算法是直接利用原始图像矩阵构造图像的协方差矩阵。而PCA算法需对原始图像矩阵先降维、再将降维矩阵转换成列向量,然后构造图像的协方差矩阵。为了测试和评估2DPCA算法的性能,在ORL（olivetti research laboratory）与Yale人脸数据库上进行了实验,结果表明,2DPCA算法用于人脸识别的正确识别率高于PCA算法。同时,也显示了2DPCA算法在特征提取方面比PCA算法更有效。     

Two-dimensional PCA: a new approach to appearance-based face representation and recognition

In this paper, a new technique coined two-dimensional principal component analysis (2DPCA) is developed for image representation. As opposed to PCA, 2DPCA is based on 2D image matrices rather than 1D vectors so the image matrix does not need to be transformed into a vector prior to feature extraction. Instead, an image covariance matrix is constructed directly using the original image matrices, and its eigenvectors are derived for image feature extraction. To test 2DPCA and evaluate its performance, a series of experiments were performed on three face image databases: ORL, AR, and Yale face databases. The recognition rate across all trials was higher using 2DPCA than PCA. The experimental results also indicated that the extraction of image features is computationally more efficient using 2DPCA than PCA.     

双向压缩的2DPCA与PCA相结合的人脸识别算法

主成分分析(PCA)直接用于人脸识别时,需将图像矩阵转换成向量,导致求解高阶矩阵计算量大.二维主成分分析(2DPCA)的实质是对图像矩阵按行进行图像压缩抽取特征,消除了图像列的相关性,但特征教量仍然较大,影响分类速度.针对这一问题,提出了采用双向压缩的二维主成分分析消除图像行间和列间的相关性,再结合PCA进一步减少特征数量,改进人脸识别算法,该算法用于ORL人脸库上得到了较高的识别率和较快的识别速度.     

一种基于人脸垂直对称性的变形2DPCA算法

本文分析了人脸的对称性和主成分分析法(PCA)、二维主成分分析法(2DPCA)的特性,证明了2DPCA协方差矩阵就是PCA协方差矩阵的主角线的平均值,同时表明2DPCA减少了对人脸识别有用的协方差信息。提出了一种基于人脸垂直对称性的变形2DPCA算法(S2DPCA),该算法最大程度地利用了协方差鉴别信息,用更少的系数表示一张人脸图像。通过在ORL的实验比较表明,该算法与PCA算法相比降低了计算复杂性,与2DPCA方法和PCA方法相比提高了人脸识别率,在识别率方面优于传统算法(PCA(Eigenfaces)、ICA、Kernel Eigenfaces),同时也压缩了人脸的存储空间。     

On image matrix based feature extraction algorithms.

Principal component analysis (PCA) and linear discriminant analysis (LDA) are two important feature extraction methods and have been widely applied in a variety of areas. A limitation of PCA and LDA is that when dealing with image data, the image matrices must be first transformed into vectors, which are usually of very high dimensionality. This causes expensive computational cost and sometimes the singularity problem. Recently two methods called two-dimensional PCA (2DPCA) and two-dimensional LDA (2DLDA) were proposed to overcome this disadvantage by working directly on 2-D image matrices without a vectorization procedure. The 2DPCA and 2DLDA significantly reduce the computational effort and the possibility of singularity in feature extraction. In this paper, we show that these matrices based 2-D algorithms are equivalent to special cases of image block based feature extraction, i.e., partition each image into several blocks and perform standard PCA or LDA on the aggregate of all image blocks. These results thus provide a better understanding of the 2-D feature extraction approaches.     

Color face recognition based on quaternion matrix representation

There are several methods to recognize and reconstruct a human face image. The principal component analysis (PCA) is a successful approach because of its effective extraction of the global feature and excellent reconstruction of face image. However, the crucial shortcomings of PCA are its low recognition rate and overfitting of feature extraction which leads to the dependence of training data on training samples. In this paper, a modified two-dimension principal component analysis (2DPCA) and bidirectional principal component analysis (BDPCA) methods based on quaternion matrix are proposed to recognize and reconstruct a color face image. In these methods, the spatial distribution information of color images is used to represent a color face, and the 2DPCA or BDPCA feature of color face image is extracted by reducing the dimensionality in both column and row directions. A method obtaining orthogonal eigenvector set of quaternion matrix is proposed. Numerous experiments show that the present approach based on quaternion matrix can effectively smooth the overfitting issue and substantially enhance the recognition rate.     

融合2DPCA和模糊2DLDA的人脸识别

结合模糊集理论、双向二维主成分-线性鉴别分析((2D)2PCALDA)的特点,提出一种新的人脸图像特征提取方法。算法首先对人脸图像进行二维主成分分析(2DPCA)处理,再用模糊K近邻算法计算图像的隶属度矩阵,并将其融入到2DLDA过程中,从而得到模糊类间散射矩阵和模糊类内散射矩阵。与(2D2PCALDA相比,该算法充分利用了(2D)2PCALDA的优点,有效地提取了行和列的识别信息,并充分考虑了样本的分布信息。在Yale和FERET人脸数据库上的实验结果表明,该方法识别效果优于(2D)2PCALDA、双向二维主成分分析((2D)2PCA)等方法。     

关于二维主成分分析方法的研究

The principal component analysis (PCA), or the eigenfaces method, is a de facto standard in human face recognition. Numerous algorithms tried to generalize PCA in different aspects. More recently, a technique called two-dimensional PCA (2DPCA) was proposed to cut the computational cost of the standard PCA. Unlike PCA that treats images as vectors, 2DPCA views an image as a matrix. With a properly defined criterion, 2DPCA results in an eigenvalue problem which has a much lower dimensionality than that of PCA. In this paper, we show that 2DPCA is equivalent to a special case of an existing feature extraction method, i.e., the block-based PCA. Using the FERET database, extensive experimental results demonstrate that block-based PCA outperforms PCA on datasets that consist of relatively simple images for recognition, while PCA is more robust than 2DPCA in harder situations.     

A new discrete circuit for readout of resistive sensor arrays

In this paper, we present a method that simplifies the interconnect complexity of N × M resistive sensor arrays from N × M to N + M. In this method, we propose to use two sets of interconnection lines in row–column fashion with all the sensor elements having one of their ends connected to a row line and other end to a column line. This interconnection overloading results in crosstalk among all the elements. This crosstalk causes the spreading of information over the whole array. The proposed circuit in this method takes care of this effect by minimizing the crosstalk. The circuit makes use of the concept of virtual same potential at the inputs of an operational amplifier in negative feedback to obtain a sufficient isolation among various elements. We theoretically present the suitability of the method for small/moderate sized sensor arrays and experimentally verify the predicted behavior by lock-in-amplifier based measurements on a light dependent resistor (LDR) in a 4 × 4 resistor array. Finally, we present a successful implementation of this method on a 16 × 16 imaging array of LDR.     

Finger-vein pattern identification using SVM and neural network technique

This paper presents a support vector machine (SVM) technique for finger-vein pattern identification in a personal identification system. Finger-vein pattern identification is one of the most secure and convenient techniques for personal identification. In the proposed system, the finger-vein pattern is captured by infrared LED and a CCD camera because the vein pattern is not easily observed in visible light. The proposed verification system consists of image pre-processing and pattern classification. In the work, principal component analysis (PCA) and linear discriminant analysis (LDA) are applied to the image pre-processing as dimension reduction and feature extraction. For pattern classification, this system used an SVM and adaptive neuro-fuzzy inference system (ANFIS). The PCA method is used to remove noise residing in the discarded dimensions and retain the main feature by LDA. The features are then used in pattern classification and identification. The accuracy of classification using SVM is 98% and only takes 0.015 s. The result shows a superior performance to the artificial neural network of ANFIS in the proposed system.     

Structural two-dimensional principal component analysis for image recognition

In this paper, a new technique called structural two-dimensional principal component analysis (S2DPCA) is proposed for image recognition. S2DPCA is a subspace learning method that identifies the structural information for discrimination. Different from conventional two-dimensional principal component analysis (2DPCA) that only reflects within-row information of images, the goal of S2DPCA is to discover structural discriminative information contained in both within-row and between-row of the images. By contrast with 2DPCA, S2DPCA is directly based on the augmented images encoding corresponding row membership, and the projection directions of S2DPCA are obtained by solving an eigenvalue problem of the augmented image covariance matrix. Computationally, S2DPCA is straightforward and comparative with 2DPCA. Like 2DPCA, the singularity problem is completely avoided in S2DPCA. Experiments on face recognition and handwritten digit recognition are presented to show the effectiveness of the proposed approach.     

分段2维主成分分析的超光谱图像波段选择

目的 超光谱图像具有极高的谱间分辨率,巨大的数据量给分类识别等后续处理带来很大压力。为了有效降低图像数据维数,提出基于分段2DPCA的超光谱图像波段选择算法。方法 首先根据谱间相关性对原始图像进行波段分组,然后根据主成分反映每个光谱波段的信息比重分别对每组图像进行波段选择,从而实现超光谱图像的谱间降维。结果 该算法有效降低了超光谱图像的光谱维数,选择的波段明显反映出不同地物像元矢量的区别。结论 实验结果表明,该波段选择算法相对传统算法速度更快,并且较好地保留了原始图像的局部重要信息,对后续处理有积极意义。     

广义主分量分析及人脸识别

传统的主分量分析和Fisher线性鉴别分析在处理图像识别问题时都是基于图像向量的。该文提出了一种直接基于图像矩阵的主分量分析方法,它的突出优点是大大加快了特征抽取的速度。在ORL标准人脸库上的试验结果表明,该文所提出的方法不仅在识别性能上优于传统的主分量分析方法和Fisher线性鉴别分析方法,而且特征抽取的速度得到了很大的提高。     

A novel adaptive cuckoo search algorithm for intrinsic discriminant analysis based face recognition

This paper presents a novel adaptive cuckoo search (ACS) algorithm for optimization. The step size is made adaptive from the knowledge of its fitness function value and its current position in the search space. The other important feature of the ACS algorithm is its speed, which is faster than the CS algorithm. Here, an attempt is made to make the cuckoo search (CS) algorithm parameter free, without a Levy step. The proposed algorithm is validated using twenty three standard benchmark test functions. The second part of the paper proposes an efficient face recognition algorithm using ACS, principal component analysis (PCA) and intrinsic discriminant analysis (IDA). The proposed algorithms are named as PCA + IDA and ACS–IDA. Interestingly, PCA + IDA offers us a perturbation free algorithm for dimension reduction while ACS + IDA is used to find the optimal feature vectors for classification of the face images based on the IDA. For the performance analysis, we use three standard face databases—YALE, ORL, and FERET. A comparison of the proposed method with the state-of-the-art methods reveals the effectiveness of our algorithm.     

Face recognition by generalized two-dimensional FLD method and multi-class support vector machines

This paper presents a novel scheme for feature extraction, namely, the generalized two-dimensional Fisher's linear discriminant (G-2DFLD) method and its use for face recognition using multi-class support vector machines as classifier. The G-2DFLD method is an extension of the 2DFLD method for feature extraction. Like 2DFLD method, G-2DFLD method is also based on the original 2D image matrix. However, unlike 2DFLD method, which maximizes class separability either from row or column direction, the G-2DFLD method maximizes class separability from both the row and column directions simultaneously. To realize this, two alternative Fisher's criteria have been defined corresponding to row and column-wise projection directions. Unlike 2DFLD method, the principal components extracted from an image matrix in G-2DFLD method are scalars; yielding much smaller image feature matrix. The proposed G-2DFLD method was evaluated on two popular face recognition databases, the AT&T (formerly ORL) and the UMIST face databases. The experimental results using different experimental strategies show that the new G-2DFLD scheme outperforms the PCA, 2DPCA, FLD and 2DFLD schemes, not only in terms of computation times, but also for the task of face recognition using multi-class support vector machines (SVM) as classifier. The proposed method also outperforms some of the neural networks and other SVM-based methods for face recognition reported in the literature.     

一种基于局部排序PCA的线性鉴别算法

主分量分析(Principal Component Analysis,PCA)是模式识别领域中一种重要的特征抽取方法,该方法通过K-L展开式来抽取样本的主要特征。基于此,提出一种拓展的PCA人脸识别方法,即分块排序PCA人脸识别方法(MSPCA)。分块排序PCA方法先对图像矩阵进行分块,对所有分块得到的子图像矩阵利用PCA方法求出矩阵的所有特征值所对应的特征向量并加以标识;然后找出这些所有的特征值中k个最大的特征值所对应的特征向量,用这些特征向量分别去抽取所属的子图像的特征;最后,在MSPCA的基础上,将抽取子图像所得到的特征矩阵合并,把这个合并后的特征矩阵作为新的样本进行PCA+LDA。与PCA和PCA+LDA方法相比,分块排序PCA由于使用子图像矩阵,可以避免使用奇异值分解理论,从而更加简便。在ORL人脸库上的实验结果表明,所提出的方法在识别性能上明显优于经典的PCA和PCA+LDA方法。     

基于DCT融合2DPCA与DLDA的人脸识别

传统的基于主成分分析的人脸识别需要将图像矩阵转化为向量,特征提取需要花费大最时间.二维主成分分析直接利用图像矩阵,特征提取速度快,但特征数量大,影响分类速度.因此,提出了一种基于离散余弦变换(DCT)的二维主成分分析(2DPCA)和直接线性判决分析(DLDA)结合的人脸识别方法.算法首先用DCT对人脸图像进行压缩并重建,然后利用2DPCA和DLDA对人脸图像进行特征提取.最后选用最近邻分类器进行分类.在ORL人脸库上的测试结果表明,与DLDA或2DPCA算法相比,算法具有更高的识别率.