基于图像分块的改进Fisher人脸识别算法

二维方法用于图像矩阵特征提取,虽然速度快,但影响了分类速度。针对二维线性鉴别分析（Two-Dimensional Linear Discriminant Analysis,2DLDA）的特点,研究了一种基于图像分块的改进Fisher人脸识别算法,该算法首先对人脸图像进行压缩降维处理,得到相应的特征矩阵,然后利用改进Fisher算法对特征矩阵进行类间离散度矩阵和类内离散度矩阵的计算,该算法充分考虑了类别信息,避免了传统Fisher算法造成的小样本问题,有效提高了分类速度。基于ORL（Olivetti Research Laboratory）与Yale人脸数据库的实验结果证明了该算法的有效性。     

2维异方差鉴别分析及其在人脸识别中的应用

在2维线性鉴别分析(2DLDA)的基础上.介绍了2维异方差鉴别分析(2DHDA),并将其应用于人脸识别.2DHDA算法去除了2DLDA算法样本类内协方差相等的约束,克服了异方差鉴别分析(HDA)算法的"小样本"问题.首先,根据2DLDA准则定义2DHDA准则;然后,将2DHDA准则取对数,用梯度下降法求得最优投影矩阵,人脸图像向最优投影矩阵投影提取人脸图像的特征;最后,最小距离分类器完成人脸识别.基于ORL与Yale混合人脸数据库的实验结果表明了2DHDA应用于人脸识别的有效性.     

基于QR分解的鉴别维数压缩及其在人脸识别中的应用

维数压缩是当前模式识别研究领域中的一个重要研究方向．但是当前部分维数压缩方法缺乏有效的鉴别信息保留机制，并且在利用Fisher鉴别准则的时候经常会遇到小样本问题．简单介绍了维数压缩中的鉴别信息保留，并且提出了一种新的直接线性鉴别分析方法——DLDA／QR算法．该方法首先利用矩阵的QR分解算法实现目标函数的优化，再在一个较小的空间内实现有效鉴别信息的提取．在ORL人脸数据库上的实验结果验证了算法的有效性．     

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

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

基于分块二维线性鉴别分析的人脸识别

基于2DLDA方法,提出了一种基于图像分块的二维线性鉴别分析(M2DLDA)的人脸识别方法。该方法首先对原始人脸图像进行必要的预处理后进行分块,再对分块后的子图像分别采用2DLDA方法进行特征提取,最后用最小距离分类器进行识别。该方法的优点：分块后能有效的抽取人脸图像的局部特征有利于分类;降低了2DLDA方法提取的特征矩阵的维数;特征提取是基于图像矩阵的,抽取方便快速。在ORL人脸数据库上的实验结果表明：该方法在识别性能上优于2DLDA方法。     

一种基于2DLPP和2DLDA的人脸识别方法研究

局部保持投影（locality preserving projection,LPP）和线性鉴别分析（linear discrimin antanalysis,LDA）是两种有效的一维特征提取方法,广泛应用于人脸识别领域。但采用一维特征提取方法时会存在列向量化时样本的结构信息被破坏和样本在提取特征时必须对协方差矩阵进行特征分解,对于高维小样本的问题很容易出现协方差矩阵奇异的问题。文中提出将二维局部保持投影（2DLPP）和二维线性鉴别分析（2DLDA）这两种方法在特征层进行融合并应用在人脸识别。基于人脸库AR上的实验表明,该方法比传统的IJPP和LDA识别性能更高,因此可作为一种新的人脸识别方法。     

边界近邻零空间鉴别分析

提出了一种边界近部零空间鉴别分析算法。算法首先定义了新的目标函数,通过对该目标函数的理论分析与证明指出首先用PCA将高维样本降维至一个低维子空间,而在此低维子空间该目标函数并不损失任何有效的鉴别信息;算法不但能有效地解决本问题,而且仅需通过3次特征值分解就可求出具有正交性的投影矩阵,从而有效地提高了算法的识别性能。最后也给出了该算法基于核映射的非线性拓展。人脸库上的实验结果证实了所提方法的有效性。     

基于图像抽样重组的2维线性鉴别分析

图像识别中的2维线性鉴别分析(2DLDA)实际上是将图像的各个列(或行)视为样本向量,但这些样本向量不能满足统计学中的独立同分布要求。为克服2DLDA的不足,提出了基于图像抽样重组的2DLDA (SR2DLDA),它对图像进行下抽样,并将抽样所得的不同小图像重组成矩阵,然后对这些矩阵实施2DLDA。由于抽样重组的矩阵改善了各个列向量的独立性与分布同一性,因而SR2DLDA的识别性能有可能优于2DLDA,也优于LDA。在ORL人脸库、UMIST人脸库和FERET人脸库上的实验验证了SR2DLDA的有效性。     

完备的双子空间边界近邻鉴别分析

针对边界Fisher鉴别分析算法不能够有效解决小样本问题,提出了一种完备的双子空间边界近邻鉴别分析算法。该算法通过理论分析将MFA的目标函数分解成两部分,对此目标函数的求解,首先要对高维样本进行PCA降维至一个低维子空间, 而这一过程并不损失任何有效的鉴别信息,对此通过定理1和定理2进行了证明;然后再分别求出类内边界近邻互补子空间的两投影矩阵。最后人脸库上的实验结果表明了所提方法的有效性。     

基于2DLDA与SVM的人脸识别算法

二维线性鉴别分析（2DLDA）算法能有效解决线性鉴别分析（LDA）算法的“小样本”效应,支持向量机(SVM)具有结构风险最小化的特点,将两者结合起来用于人脸识别。首先,利用小波变换获取人脸图像的低频分量,忽略高频分量;然后,用2DLDA算法提取人脸图像低频分量的线性鉴别特征,用“一对多”的SVM多类分类算法完成人脸识别。基于ORL人脸数据库和Yale人脸数据库的实验结果验证了2DLDA+SVM算法应用于人脸识别的有效性。     

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.     

Feature Extraction Using Fractional-Order Embedding Direct Linear Discriminant Analysis

In this paper, a novel LDA-based dimensionality reduction method called fractional-order embedding direct LDA (FEDLDA) is proposed. More specifically, we redefine the fractional-order between-class and within-class scatter matrices which can significantly reduce the deviation of sample covariance matrices caused by the noise disturbance and limited number of training samples; then the novel feature extraction criterion based on the direct LDA (DLDA) and the idea of fractional-order embedding is applied. Experiments on AT&T, Yale and AR face image databases are performed to test and evaluate the effectiveness of the proposed algorithms. Extensive experimental results show that FEDLDA outperforms DLDA and other closely related methods in terms of classification accuracy and efficiency.     

Optimal decompositions of matrices with grades into binary and graded matrices

We study the problem of decomposition of object-attribute matrices whose entries contain degrees to which objects have attributes. The degrees are taken from a bounded partially ordered scale. Examples of such matrices are binary matrices, matrices with entries from a finite chain, or matrices with entries from the unit interval [0, 1]. We study the problem of decomposition of a given object-attribute matrix I with degrees into an object-factor matrix A with degrees and a binary factor-attribute matrix B, with the number of factors as small as possible. We present a theorem which shows that decompositions which use particular formal concepts of I as factors for the decomposition are optimal in that the number of factors involved is the smallest possible. We show that the problem of computing an optimal decomposition is NP-hard and present two heuristic algorithms for its solution along with their experimental evaluation. For the first algorithm, we provide its approximation ratio. Experiments indicate that the second algorithm, which is considerably faster than the first one, delivers decompositions whose quality is comparable to the decompositions delivered by the first algorithm. We also present an illustrative example demonstrating a factor analysis interpretation of the decomposition studied in this paper.     

求分块周期三对角矩阵逆矩阵的新算法

根据分块三对角矩阵逆矩阵的特殊结构,利用其LU和UL分解,并使用Sheman-Morrison-Woodbury公式,得到一个求分块周期三对角矩阵逆矩阵的新算法,并由该算法得到求周期三对角矩阵和对称周期三对角矩阵逆矩阵的新算法。新算法比传统算法的计算复杂度和计算时间要低。     

The Boolean column and column-row matrix decompositions

Matrix decompositions are used for many data mining purposes. One of these purposes is to find a concise but interpretable representation of a given data matrix. Different decomposition formulations have been proposed for this task, many of which assume a certain property of the input data (e.g., nonnegativity) and aim at preserving that property in the decomposition. In this paper we propose new decomposition formulations for binary matrices, namely the Boolean CX and CUR decompositions. They are natural combinations of two previously presented decomposition formulations. We consider also two subproblems of these decompositions and present a rigorous theoretical study of the subproblems. We give algorithms for the decompositions and for the subproblems, and study their performance via extensive experimental evaluation. We show that even simple algorithms can give accurate and intuitive decompositions of real data, thus demonstrating the power and usefulness of the proposed decompositions.     

Two-dimensional discriminant transform for face recognition

This paper develops a new image feature extraction and recognition method coined two-dimensional linear discriminant analysis (2DLDA). 2DLDA provides a sequentially optimal image compression mechanism, making the discriminant information compact into the up-left corner of the image. Also, 2DLDA suggests a feature selection strategy to select the most discriminative features from the corner. 2DLDA is tested and evaluated using the AT&T face database. The experimental results show 2DLDA is more effective and computationally more efficient than the current LDA algorithms for face feature extraction and recognition.     

Incremental two-dimensional linear discriminant analysis with applications to face recognition

Two dimensional linear discriminant analysis (2DLDA) has been verified as an effective method to solve the small sample size (SSS) problem in linear discriminant analysis (LDA). However, most of the existing 2DLDA techniques do not support incremental subspace analysis for updating the discriminant eigenspace. Incremental learning has proven to enable efficient training if large amounts of training data have to be processed or if not all data are available in advance as, for example, in on-line situations. Instead of having to re-training across the entire training data whenever a new sample is added, this paper proposed an incremental two-dimensional linear discriminant analysis (I2DLDA) algorithm with closed-form solution to extract facial features of the appearance image on-line. The proposed I2DLDA inherits the advantages of the 2DLDA and the Incremental LDA (ILDA) and overcomes the number of the classes or chunk size limitation in the ILDA because the size of the between-class scatter matrix and the size of the within-class scatter matrix in the I2DLDA are much smaller than the ones in the ILDA. The results on experiments using the ORL and XM2VTS databases show that the I2DLDA is computationally more efficient than the batch 2DLDA and can achieve better recognition results than the ILDA.     

Unifying and optimizing parallel linear algebra algorithms

Two issues in linear algebra algorithms for multicomputers are addressed. First, how to unify parallel implementations of the same algorithm in a decomposition-independent way. Second, how to optimize naive parallel programs maintaining the decomposition independence. Several matrix decompositions are viewed as instances of a more general allocation function called subcube matrix decomposition. By this meta-decomposition, a programming environment characterized by general primitives that allow one to design meta-algorithms independently of a particular decomposition. The authors apply such a framework to the parallel solution of dense matrices. This demonstrates that most of the existing algorithms can be derived by suitably setting the primitives used in the meta-algorithm. A further application of this programming style concerns the optimization of parallel algorithms. The idea to overlap communication and computation has been extended from 1-D decompositions to 2-D decompositions. Thus, a first attempt towards a decomposition-independent definition of such optimization strategies is provided     

A Holographic Diffraction Label Recognition Algorithm Based on Fusion Double Tensor Features

As an efficient technique for anti-counterfeiting, holographic diffraction labels has been widely applied to various fields. Due to their unique feature, traditional image recognition algorithms are not ideal for the holographic diffraction label recognition. Since a tensor preserves the spatiotemporal features of an original sample in the process of feature extraction, in this paper we propose a new holographic diffraction label recognition algorithm that combines two tensor features. The HSV (Hue Saturation Value) tensor and the HOG (Histogram of Oriented Gradient) tensor are used to represent the color information and gradient information of holographic diffraction label, respectively. Meanwhile, the tensor decomposition is performed by high order singular value decomposition, and tensor decomposition matrices are obtained. Taking into consideration of the different recognition capabilities of decomposition matrices, we design a decomposition matrix similarity fusion strategy using a typical correlation analysis algorithm and projection from similarity vectors of different decomposition matrices to the PCA (Principal Component Analysis) sub-space , then, the sub-space performs KNN (K-Nearest Neighbors) classification is performed. The effectiveness of our fusion strategy is verified by experiments. Our double tensor recognition algorithm complements the recognition capability of different tensors to produce better recognition performance for the holographic diffraction label system.