Code to perform feature selection. Here feature selection is done using a modified version of Memetic Algorithm called LAHCMA.
Code for Simulated Annealing is also provided.
This is code for paper entitled - "Feature selection for facial emotion recognition using late hill-climbing based memetic algorithm"
Four mat files need to be created:
- train.mat - contains the data to be used for training
- trainLabel.mat - contains one hot encoded class labels for training data
- test.mat - contains the data to be used for validation
- testLabel.mat - contains one hot encoded class labels for validation data
The following 3 classifiers can be chosen using variable ch in classify.m
- SVM
- MLP
- KNN
Note: SVM classifier in 'onevsall' setting, linear kernel, using SMO solver gave best results.
- Put all the data files in a folder name Data/datax/ folder, where x is any number
- Call function maxRelMinRed(data,class,str) in maxRelMinRed.m file - this generates the redundancy and relevance matrix to be used in LAHCRR
- run file main_loop.m
Link for algorithm details: Paper
Facial Emotion Recognition (FER) is an important research domain which allows us to provide a better interactive environment between humans and computers. Some standard and popular features extracted from facial expression images include Uniform Local Binary Pattern (uLBP), Horizontal-Vertical Neighborhood Local Binary Pattern (hvnLBP), Gabor filters, Histogram of Oriented Gradients (HOG) and Pyramidal HOG (PHOG). However, these feature vectors may contain some features that are irrelevant or redundant in nature, thereby increasing the overall computational time as well as recognition error of a classification system. To counter this problem, we have proposed a new feature selection (FS) algorithm based on Late Hill Climbing and Memetic Algorithm (MA). A novel local search technique called Late Acceptance Hill Climbing through Redundancy and Relevancy (LAHCRR) has been used in this regard. It combines the concepts of Local Hill-Climbing and minimal-Redundancy Maximal-Relevance (mRMR) to form a more effective local search mechanism in MA. The algorithm is then evaluated on the said feature vectors extracted from the facial images of two popular FER datasets, namely RaFD and JAFFE. LAHCRR is used as local search in MA to form Late Hill Climbing based Memetic Algorithm (LHCMA). LHCMA is compared with state-of-the-art methods. The experimental outcomes show that the proposed FS algorithm reduces the feature dimension to a significant amount as well as increases the recognition accuracy as compared to other methods.