Feature selection for face recognition based on data partitioning

Feature selection is an important consideration in several applications where one needs to choose a smaller subset of features from a complete set of raw measurements such that the improved subset generates as good or better classification performance compared to original data. In this paper, we describe a novel feature selection approach that is based on the estimation of classification complexity through data partitioning. This approach allows us to select the N best features from a given set in an order of their ability to separate data from different classes. In this paper, we perform our experiments on the ORL face database that consists of 400 images. The results show that the proposed approach outperforms the probability distance approach and is a viable method for implementing more advanced search methods of feature selection.

[1]  Alistair G. Rust,et al.  Image redundancy reduction for neural network classification using discrete cosine transforms , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[2]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[3]  Josef Kittler,et al.  A comparison of colour texture attributes selected by statistical feature selection and neural network methods , 1997, Pattern Recognit. Lett..

[4]  Fuad Rahman,et al.  Measuring classification complexity of image databases: a novel approach , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[5]  Josef Kittler,et al.  Mathematics Methods of Feature Selection in Pattern Recognition , 1975, Int. J. Man Mach. Stud..

[6]  Pavel Paclík,et al.  Adaptive floating search methods in feature selection , 1999, Pattern Recognit. Lett..

[7]  David G. Stork,et al.  Pattern Classification , 1973 .