Two-Dimensional Heteroscedastic Feature Extraction Technique for Face Recognition

One limitation of vector-based LDA and its matrix-based extension is that they cannot deal with heteroscedastic data. In this paper, we present a novel two-dimensional feature extraction technique for face recognition which is capable of handling the heteroscedastic data in the dataset. The technique is a general form of two-dimensional linear discriminant analysis. It generalizes the interclass scatter matrix of two-dimensional LDA by applying the Chernoff distance as a measure of separation of every pair of clusters with the same index in different classes. By employing the new distance, our method can capture the discriminatory information presented in the difference of covariance matrices of different clusters in the datasets while preserving the computational simplicity of eigenvalue-based techniques. So our approach is a proper technique for high-dimensional applications such as face recognition. Experimental results on CMU-PIE, AR and AT & T face databases demonstrate the effectiveness of our method in term of classification accuracy

Semi-supervised tensor-based graph embedding learning and its application to visual discriminant tracking

An appearance model adaptable to changes in object appearance is critical in visual object tracking. In this paper, we treat an image patch as a 2-order tensor which preserves the original image structure. We design two graphs for characterizing the intrinsic local geometrical structure of the tensor samples of the object and the background. Graph embedding is used to reduce the dimensions of the tensors while preserving the structure of the graphs. Then, a discriminant embedding space is constructed. We prove two propositions for finding the transformation matrices which are used to map the original tensor samples to the tensor-based graph embedding space. In order to encode more discriminant information in the embedding space, we propose a transfer-learningbased semi-supervised strategy to iteratively adjust the embedding space into which discriminative information obtained from earlier times is transferred. We apply the proposed semi-supervised tensor-based graph embedding learning algorithm to visual tracking. The new tracking algorithm captures an object’s appearance characteristics during tracking and uses a particle filter to estimate the optimal object state. Experimental results on the CVPR 2013 benchmark dataset demonstrate the effectiveness of the proposed tracking algorithm

Palmprint identification using restricted fusion

2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Two-dimensional approximately harmonic projection for gait recognition

This paper presents a two-dimensional approximately harmonic projection (2DAHP) algorithm for gait recognition. 2DAHP is originated from the approximately harmonic projection (AHP), while 2DAHP offers some advantages over AHP. 1) 2DAHP can preserve the local geometrical structure and cluster structure of image data as AHP. 2) 2DAHP encodes images as matrices or second-order tensors rather than one-dimensional vectors, so 2DAHP can keep the correlation among different coordinates of image data. 3) 2DAHP avoids the singularity problem suffered by AHP. 4) 2DAHP runs faster than AHP. Extensive experiments on gait recognition show the effectiveness and efficiency of the proposed method

Algorithm Symmetric 2-DLDA for Recognizing Handwritten Capital Letters

Statistical pattern recognition is the process of using statistical techniques to obtain information and make informed decisions based on data measurements. It is possible to solve the doubt inherent in the objective function of the 2-Dimension Linear Discriminant Analysis by employing the symmetrical 2-Dimension Linear Discriminant Analysis approach. Symmetrical 2-dimensional linear discriminant analysis has found widespread use as a method of introducing handwritten capital letters. Symmetric 2-DLDA, according to Symmetric 2-DLDA, produces better and more accurate results than Symmetric 2-DLDA. So far, pattern recognition has been based solely on computer knowledge, with no connection to statistical measurements, such as data variation and Euclidean distance, particularly in symmetrical images. As a result, the aim of this research is to create algorithms for recognizing capital letter patterns in a wide range of handwriting. The ADL2-D symmetric method is used in this study as the development of the ADL2-D method. The research results in an algorithm that considers the left and right sides of the image matrix, as opposed to ADL2-D, which does not consider the left and right sides of the image matrix. In pattern recognition, the results with symmetric ADL2-D are more accurat