4,151 research outputs found
Gradient-orientation-based PCA subspace for novel face recognition
This article has been made available through the Brunel Open Access Publishing Fund.Face recognition is an interesting and a challenging problem that has been widely studied in the field of pattern recognition and computer vision. It has many applications such as biometric authentication, video surveillance, and others. In the past decade, several methods for face recognition were proposed. However, these methods suffer from pose and illumination variations. In order to address these problems, this paper proposes a novel methodology to recognize the face images. Since image gradients are invariant to illumination and pose variations, the proposed approach uses gradient orientation to handle these effects. The Schur decomposition is used for matrix decomposition and then Schurvalues and Schurvectors are extracted for subspace projection. We call this subspace projection of face features as Schurfaces, which is numerically stable and have the ability of handling defective matrices. The Hausdorff distance is used with the nearest neighbor classifier to measure the similarity between different faces. Experiments are conducted with Yale face database and ORL face database. The results show that the proposed approach is highly discriminant and achieves a promising accuracy for face recognition than the state-of-the-art approaches
Robust Face Representation and Recognition Under Low Resolution and Difficult Lighting Conditions
This dissertation focuses on different aspects of face image analysis for accurate face recognition under low resolution and poor lighting conditions. A novel resolution enhancement technique is proposed for enhancing a low resolution face image into a high resolution image for better visualization and improved feature extraction, especially in a video surveillance environment. This method performs kernel regression and component feature learning in local neighborhood of the face images. It uses directional Fourier phase feature component to adaptively lean the regression kernel based on local covariance to estimate the high resolution image. For each patch in the neighborhood, four directional variances are estimated to adapt the interpolated pixels. A Modified Local Binary Pattern (MLBP) methodology for feature extraction is proposed to obtain robust face recognition under varying lighting conditions. Original LBP operator compares pixels in a local neighborhood with the center pixel and converts the resultant binary string to 8-bit integer value. So, it is less effective under difficult lighting conditions where variation between pixels is negligible. The proposed MLBP uses a two stage encoding procedure which is more robust in detecting this variation in a local patch. A novel dimensionality reduction technique called Marginality Preserving Embedding (MPE) is also proposed for enhancing the face recognition accuracy. Unlike Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which project data in a global sense, MPE seeks for a local structure in the manifold. This is similar to other subspace learning techniques but the difference with other manifold learning is that MPE preserves marginality in local reconstruction. Hence it provides better representation in low dimensional space and achieves lower error rates in face recognition. Two new concepts for robust face recognition are also presented in this dissertation. In the first approach, a neural network is used for training the system where input vectors are created by measuring distance from each input to its class mean. In the second approach, half-face symmetry is used, realizing the fact that the face images may contain various expressions such as open/close eye, open/close mouth etc., and classify the top half and bottom half separately and finally fuse the two results. By performing experiments on several standard face datasets, improved results were observed in all the new proposed methodologies. Research is progressing in developing a unified approach for the extraction of features suitable for accurate face recognition in a long range video sequence in complex environments
Biometric face recognition using multilinear projection and artificial intelligence
PhD ThesisNumerous problems of automatic facial recognition in the linear and multilinear
subspace learning have been addressed; nevertheless, many difficulties remain. This
work focuses on two key problems for automatic facial recognition and feature
extraction: object representation and high dimensionality.
To address these problems, a bidirectional two-dimensional neighborhood preserving
projection (B2DNPP) approach for human facial recognition has been developed.
Compared with 2DNPP, the proposed method operates on 2-D facial images and
performs reductions on the directions of both rows and columns of images.
Furthermore, it has the ability to reveal variations between these directions. To further
improve the performance of the B2DNPP method, a new B2DNPP based on the
curvelet decomposition of human facial images is introduced. The curvelet multi-
resolution tool enhances the edges representation and other singularities along curves,
and thus improves directional features. In this method, an extreme learning machine
(ELM) classifier is used which significantly improves classification rate. The proposed
C-B2DNPP method decreases error rate from 5.9% to 3.5%, from 3.7% to 2.0% and
from 19.7% to 14.2% using ORL, AR, and FERET databases compared with 2DNPP.
Therefore, it achieves decreases in error rate more than 40%, 45%, and 27%
respectively with the ORL, AR, and FERET databases.
Facial images have particular natural structures in the form of two-, three-, or even
higher-order tensors. Therefore, a novel method of supervised and unsupervised
multilinear neighborhood preserving projection (MNPP) is proposed for face
recognition. This allows the natural representation of multidimensional images 2-D, 3-D
or higher-order tensors and extracts useful information directly from tensotial data
rather than from matrices or vectors. As opposed to a B2DNPP which derives only two
subspaces, in the MNPP method multiple interrelated subspaces are obtained over
different tensor directions, so that the subspaces are learned iteratively by unfolding the
tensor along the different directions. The performance of the MNPP has performed in
terms of the two modes of facial recognition biometrics systems of identification and
verification. The proposed supervised MNPP method achieved decrease over 50.8%,
75.6%, and 44.6% in error rate using ORL, AR, and FERET databases respectively,
compared with 2DNPP. Therefore, the results demonstrate that the MNPP approach
obtains the best overall performance in various learning scenarios
DBC based Face Recognition using DWT
The applications using face biometric has proved its reliability in last
decade. In this paper, we propose DBC based Face Recognition using DWT (DBC-
FR) model. The Poly-U Near Infra Red (NIR) database images are scanned and
cropped to get only the face part in pre-processing. The face part is resized
to 100*100 and DWT is applied to derive LL, LH, HL and HH subbands. The LL
subband of size 50*50 is converted into 100 cells with 5*5 dimention of each
cell. The Directional Binary Code (DBC) is applied on each 5*5 cell to derive
100 features. The Euclidian distance measure is used to compare the features of
test image and database images. The proposed algorithm render better percentage
recognition rate compared to the existing algorithm.Comment: 15 pages,9 figures, 4 table
- …