Face Recognition Based on Support Vector Machine and Nearest Neighbor Classifier

Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-

LOCAL BAGGING AND ITS APPLICATIONON FACE RECOGNITION

Bagging is not quite suitable for stable classifiers such as nearest neighbor classifiers due to the lack of diversity and it is difficult to be directly applied to face recognition as well due to the small sample size （SSS） property of face recognition. To solve the two problems,local Bagging （L-Bagging） is proposed to simultaneously make Bagging apply to both nearest neighbor classifiers and face recognition. The major difference between L-Bagging and Bagging is that L-Bagging performs the bootstrap sampling on each local region partitioned from the original face image rather than the whole face image. Since the dimensionality of local region is usually far less than the number of samples and the component classifiers are constructed just in different local regions,L-Bagging deals with SSS problem and generates more diverse component classifiers. Experimental results on four standard face image databases （AR,Yale,ORL and Yale B） indicate that the proposed L-Bagging method is effective and robust to illumination,occlusion and slight pose variation.

Traffic sign recognition algorithm based on shape signature and dual-tree complex wavelet transform

A novel traffic sign recognition system is presented in this work. Firstly, the color segmentation and shape classifier based on signature feature of region are used to detect traffic signs in input video sequences. Secondly, traffic sign color-image is preprocessed with gray scaling, and normalized to 64×64 size. Then, image features could be obtained by four levels DT-CWT images. Thirdly, 2DICA and nearest neighbor classifier are united to recognize traffic signs. The whole recognition algorithm is implemented for classification of 50 categories of traffic signs and its recognition accuracy reaches 90%. Comparing image representation DT-CWT with the well-established image representation like template, Gabor, and 2DICA with feature selection techniques such as PCA, LPP, 2DPCA at the same time, the results show that combination method of DT-CWT and 2DICA is useful in traffic signs recognition. Experimental results indicate that the proposed algorithm is robust, effective and accurate.

Feature Extraction of Radar Range Profiles Based on Normalized Central Moments

The normalized central moments are widely used in pattern recognition because of scale and translation invariance. The moduli of normalized central moments of the 1-dimensional complex range profiles are used here as feature vector for radar target recognition. The common feature extraction method for high resolution range profile obtained by using Fourier-modified direct Mellin transform is inefficient and unsatisfactory in recognition rate And. generally speaking, the automatic target recognition method based on inverse synthetic aperture radar 2-dimensional imaging is not competent for real time object identification task because it needs complicated motion compensation which is sometimes too difficult to carry out. While the method applied here is competent for real-time recognition because of its computational efficiency. The result of processing experimental data indicates that this method is good at recognition.

Local Binary Patterns and Its Variants for Finger Knuckle Print Recognition in Multi-Resolution Domain

Finger Knuckle Print biometric plays a vital role in establishing security for real-time environments. The success of human authentication depends on high speed and accuracy. This paper proposed an integrated approach of personal authentication using texture based Finger Knuckle Print (FKP) recognition in multiresolution domain. FKP images are rich in texture patterns. Recently, many texture patterns are proposed for biometric feature extraction. Hence, it is essential to review whether Local Binary Patterns or its variants perform well for FKP recognition. In this paper, Local Directional Pattern (LDP), Local Derivative Ternary Pattern (LDTP) and Local Texture Description Framework based Modified Local Directional Pattern (LTDF_MLDN) based feature extraction in multiresolution domain are experimented with Nearest Neighbor and Extreme Learning Machine (ELM) Classifier for FKP recognition. Experiments were conducted on PolYU database. The result shows that LDTP in Contourlet domain achieves a promising performance. It also proves that Soft classifier performs better than the hard classifier.

Combining Committee-Based Semi-Supervised Learning and Active Learning

Many data mining applications have a large amount of data but labeling data is usually difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supervised learning addresses this problem by using unlabeled data together with labeled data in the training process. Co-Training is a popular semi-supervised learning algorithm that has the assumptions that each example is represented by multiple sets of features （views） and these views are sufficient for learning and independent given the class. However, these assumptions axe strong and are not satisfied in many real-world domains. In this paper, a single-view variant of Co-Training, called Co-Training by Committee （CoBC） is proposed, in which an ensemble of diverse classifiers is used instead of redundant and independent views. We introduce a new labeling confidence measure for unlabeled examples based on estimating the local accuracy of the committee members on its neighborhood. Then we introduce two new learning algorithms, QBC-then-CoBC and QBC-with-CoBC, which combine the merits of committee-based semi-supervised learning and active learning. The random subspace method is applied on both C4.5 decision trees and 1-nearest neighbor classifiers to construct the diverse ensembles used for semi-supervised learning and active learning. Experiments show that these two combinations can outperform other non committee-based ones.

Multi-Level Max-Margin Analysis for Semantic Classification of Satellite Images

The performance of scene classification of satellite images strongly relies on the discriminative power of the low-level and mid-level feature representation. This paper presents a novel approach, named multi-level max-margin analysis （M 3 DA） for semantic classification for high-resolution satellite images. In our M 3 DA model, the maximum entropy discrimination latent Dirichlet allocation （MedLDA） model is applied to learn the topic-level features first, and then based on a bag-of-words repre- sentation of low-level local image features, the large margin nearest neighbor （LMNN） classifier is used to optimize a multiple soft label composed of word-level features （generated by SVM classifier） and topic-level features. The categorization performances on 21-class land-use dataset have demonstrated that the proposed model in multi-level max-margin scheme can distinguish different categories of land-use scenes reasonably.