Shared Feature Extraction for Nearest Neighbor Face Recognition

Abstract

Abstract-In this paper, we propose a new supervised linear feature extraction technique for multiclass classification problems that is specially suited to the nearest neighbor classifier (NN). The problem of finding the optimal linear projection matrix is defined as a classification problem and the Adaboost algorithm is used to compute it in an iterative way. This strategy allows the introduction of a multitask learning (MTL) criterion in the method and results in a solution that makes no assumptions about the data distribution and that is specially appropriated to solve the small sample size problem. The performance of the method is illustrated by an application to the face recognition problem. The experiments show that the representation obtained following the multitask approach improves the classic feature extraction algorithms when using the NN classifier, especially when we have a few examples from each class.Index Terms-Face recognition, feature extraction, multitask learning (MTL), nearest neighbor classification (NN), small sample size problem.

Optimizing the k-NN metric weights using differential evolution

“…The k nearest neighbor (k-NN) classifier is considered as one of the most widely used techniques in machine learning [1][2][3][4][5][6]. In a simple k-NN algorithm the distances between the testing pattern and all training patterns are calculated and then a voting criterion is applied using the class label of nearest k training vectors to obtain the output classes.…”

An Ordered-Patch-Based Image Classification Approach on the Image Grassmannian Manifold

“…In addition, this covers a wide variety of application areas such as handwritten digit recognition [1]- [3], face recognition [4]- [6], scene recognition [7], [8], and even human-computer interaction [9], [10]. Most of the previous approaches for image classification are based on global image features [11], and hence are sensitive to changes in environmental conditions.…”