A new nonlinear feature extraction method for face recognition

Hyperspectral image provides abundant spectral information for remote discrimination of subtle differences in ground covers. However, the increasing spectral dimensions, as well as the information redundancy, make the analysis and interpretation of hyperspectral images a challenge. Feature extraction is a very important step for hyperspectral image processing. Feature extraction methods aim at reducing the dimension of data, while preserving as much information as possible. Particularly, nonlinear feature extraction methods (e.g. kernel minimum noise fraction (KMNF) transformation) have been reported to benefit many applications of hyperspectral remote sensing, due to their good preservation of high-order structures of the original data. However, conventional KMNF or its extensions have some limitations on noise fraction estimation during the feature extraction, and this leads to poor performances for post-applications. This paper proposes a novel nonlinear feature extraction method for hyperspectral images. Instead of estimating noise fraction by the nearest neighborhood information (within a sliding window), the proposed method explores the use of image segmentation. The approach benefits both noise fraction estimation and information preservation, and enables a significant improvement for classification. Experimental results on two real hyperspectral images demonstrate the efficiency of the proposed method. Compared to conventional KMNF, the improvements of the method on two hyperspectral image classification are 8 and 11%. This nonlinear feature extraction method can be also applied to other disciplines where high-dimensional data analysis is required.

Traditional face recognition methods such as Principal Components Analysis(PCA), Independent Component Analysis(ICA) and Linear Discriminant Analysis(LDA) are linear discriminant methods, but in the real situation, a lot of problems can't be linear discriminated; therefore, researchers proposed face recognition method based on kernel techniques which can transform the nonlinear problem of inputting space into the linear problem of high dimensional space. In this paper, we propose a recognition method based on kernel function which combines kernel Fisher Discriminant Analysis(KFDA) with kernel Principle Components Analysis(KPCA) and use typical ORL(Olivetti Research Laboratory) face database as our experimental database. There are four key steps: constructing feature subspace, image projection, feature extraction and image recognition. We found that the recognition accuracy has been greatly improved by using nonlinear identification method and combined feature extraction methods. We use MATLAB software as the platform, and use the GUI to demonstrate the process of face recognition in order to achieving human-computer interaction and making the process and result more intuitive.

Hyperspectral sensors record the reflectance from the Earth's surface over the full range of solar wavelengths with high spectral resolution. The resulting high-dimensional data contain rich information for a wide range of applications. However, for a specific application, not all the measurements are important and useful. The original feature space may not be the most effective space for representing the data. Feature mining, which includes feature generation, feature selection (FS), and feature extraction (FE), is a critical task for hyperspectral data classification. Significant research effort has focused on this issue since hyperspectral data became available in the late 1980s. The feature mining techniques which have been developed include supervised and unsupervised, parametric and nonparametric, linear and nonlinear methods, which all seek to identify the informative subspace. This paper provides an overview of both conventional and advanced feature reduction methods, with details on a few techniques that are commonly used for analysis of hyperspectral data. A general form that represents several linear and nonlinear FE methods is also presented. Experiments using two widely available hyperspectral data sets are included to illustrate selected FS and FE methods.

This paper presents theoretical relationships among several generalized LDA algorithms and proposes computationally efficient approaches for them utilizing the relationships. Generalized LDA algorithms are extended nonlinearly by kernel methods resulting in nonlinear discriminant analysis. Performances and computational complexities of these linear and nonlinear discriminant analysis algorithms are compared.

Face recognition as an important biometric identification method, with its friendly, natural, convenient advantages, has obtained more and more attention. This paper intends to research a face recognition system including face detection, feature extraction and face recognition, mainly through researching on related theory and the key technology of various preprocessing methods in face detection process, using KPCA method, focuses on the different recognition results in different preprocessing methods. In this paper, we choose YCbCr color space for skin segmentation and choose integral projection for face location. We use erosion and dilation of the opening and closing operation and illumination compensation method to preprocess face images, and then use the face recognition method based on kernel principal component analysis method for analysis and research, and the experiments were carried out using the typical face database. The algorithms experiment on MATLAB platform. Experimental results show that integration of the kernel method based on PCA algorithm under certain conditions make the extracted features represent the original image information better for using nonlinear feature extraction method, which can obtain higher recognition rate. In the image preprocessing stage, we found that images under various operations may appear different results, so as to obtain different recognition rate in recognition stage. At the same time, in the process of the kernel principal component analysis, the value of the power of the polynomial function can affect the recognition result.

Determination of structural characteristics of forests at large scales is an important problem in both scientific studies and development of management practices. Light detection and ranging (LIDAR) waveform data have been demonstrated to be valuable for estimating forest structural parameters even in dense forests, although challenges inherent to the LIDAR acquisition systems must be addressed. A new approach for processing LIDAR waveform data to estimate forest structural parameters is proposed. It was applied to Laser Vegetation Imaging Sensor waveform data acquired over old-growth tropical forest in the La Selva Biological Station, Costa Rica. Linear and nonlinear feature extraction methods were utilized to derive a lower dimensional feature space from high-dimensional LIDAR waveform data. The resulting features were used to estimate mean canopy heights through multiple linear regression analysis. Experimental results obtained by the new approach were statistically comparable to estimates obtained using features extracted via traditional waveform analysis, and the proposed approach successfully discovered another meaningful lower dimensional feature space without manual interpretation.

Kernel discriminant analysis (KDA) and the kernel principal component analysis (KPCA), which are the extension of the linear discriminant analysis (LDA) and the principal component analysis (PCA), respectively, from linear domain to nonlinear domain via the kernel trick, are two very popular nonlinear feature extraction methods. In this paper, we present a new feature extraction algorithm by combing KDA and KPCA, and then apply it to the face recognition task. The experimental results on Yale face dataset show that the proposed method can significantly improve the performance both KDA and KPCA.

The nonlinear characteristics in hyperspectral data is considered as an influential factor curtailing the classification accuracy. To deal with the problem, a new method for classification is developed, especially for hyperspectral imagery (HSI). It is a supervised method based on Locally Linear Embedding (LLE) and k-Nearest Neighbor (KNN), named with KNN based supervised LLE (S-LLE KNN). We use two real HIS dataset of AVIRIS in experiment section and compare overall classification accuracy and accuracy of each class in different methods, the results shows that the supervised nonlinear feature extraction method contributes more to classification accuracies methods.

In this paper, a new face recognition method based on PCA (principal Component Analysis), LDA (Linear Discriminant Analysis) and neural networks is proposed. This method consists of four steps: i) Preprocessing, ii) Dimension reduction using PCA, iii) feature extraction using LDA and iv) classification using neural network. Combination of PCA and LDA is used for improving the capability of LDA when a few samples of images are available and neural network classifier is used to reduce number misclassification caused by not-linearly separable classes. The proposed method was tested on Yale face database. Experimental results on this database demonstrated the effectiveness of the proposed method for face recognition with less misclassification in comparison with previous methods.

Systematic comparison of unsupervised feature extraction methods for enhancing discrimination accuracy of brown rice flour adulteration in LIBS

The Common Spatial Patterns (CSP) method is a widely used spatial filtering technique that can extract discriminative features for Electroencephalogram (EEG)-based brain computer interface (BCI) classification tasks. Since the EEG signal acquired on the scalp is a nonlinear composition of multiple signal and noise sources, in order to characterize the nonlinear data structure, nonlinear CSP methods have been proposed by using the kernel technique. Most kernel CSP methods calculate temporal covariance structure in a kernel feature space that leads to a large kernel matrix with each dimension equal to the number of time points multiplied by the number of classes. In this work, a kernel CSP method exploiting spatial covariance structure in the feature space is developed where the size of kernel matrix is the number of EEG channels, which is usually much less than that of time points. The proposed method was evaluated using motor imagery EEG data. Results indicate that the kernel CSP using spatial analysis can provide comparable performance to the existing methods using temporal analysis with less computational load.

During long-term operation of analogue circuits, fault diagnosis is important for preventing the occurrence of hazards. However, noise often accompanies sampled signals and makes the task of fault diagnosis more difficult. Therefore, developing a robust feature extraction technique is an indispensable part of fault diagnosis. The locally linear embedding (LLE) algorithm has recently emerged as a promising technique for dimensional reduction and feature extraction because it preserves linear neighborhoods, and it is quite effective when there is a locally linear dependent structure embedded in fault data. However, LLE is sensitive to noise. Therefore, the maximum correntropy criterion is adopted to resist non-Gaussian noise by seeking the optimal weight coefficient, and a half-quadratic optimization procedure is introduced to address the objective function. Moreover, softmax regression is applied to locate faults. Finally, two typical analogue circuit systems are used to demonstrate the robustness of the modified algorithm to non-Gaussian noise. The experimental results show that the robust LLE algorithm can outperform LLE in the extraction of fault features when there is non-Gaussian noise in the fault signals, and the proposed fault diagnosis method has a better effect in locating faults compared with other feature extraction methods.

Feature extraction is a very important preprocessing step for classification of hyperspectral images. The linear discriminant analysis (LDA) method fails to work in small sample size situations. Moreover, LDA has poor efficiency for non-Gaussian data. LDA is optimized by a global criterion. Thus, it is not sufficiently flexible to cope with the multi-modal distributed data. We propose a new feature extraction method in this paper, which uses the boundary semi-labeled samples for solving small sample size problem. The proposed method, which called hybrid feature extraction based on boundary semi-labeled samples (HFE-BSL), uses a hybrid criterion that integrates both the local and global criteria for feature extraction. Thus, it is robust and flexible. The experimental results with three real hyperspectral images show the good efficiency of HFE-BSL compared to some popular and state-of-the-art feature extraction methods.

Detection of maize seed germination rate based on improved locally linear embedding

Recently, many dimensionality reduction algorithms, including local methods and global methods, have been presented. The representative local linear methods are locally linear embedding (LLE) and linear preserving projections (LPP), which seek to find an embedding space that preserves local information to explore the intrinsic characteristics of high dimensional data. However, both of them still fail to nicely deal with the sparsely sampled or noise contaminated datasets, where the local neighborhood structure is critically distorted. On the contrary, principal component analysis (PCA), the most frequently used global method, preserves the total variance by maximizing the trace of feature variance matrix. But PCA cannot preserve local information due to pursuing maximal variance. In order to integrate the locality and globality together and avoid the drawback in LLE and PCA, in this paper, inspired by the dimensionality reduction methods of LLE and PCA, we propose a new dimensionality reduction method for face recognition, namely, unsupervised linear difference projection (ULDP). This approach can be regarded as the integration of a local approach (LLE) and a global approach (PCA), so that it has better performance and robustness in applications. Experimental results on the ORL, YALE and AR face databases show the effectiveness of the proposed method on face recognition.