Variation of Light intensity and its direction have been the main challenges in many face recognition systems that lead to the different normal and abnormal shadows. Today, various methods are presented for face recognition under different lighting conditions which requ More
Variation of Light intensity and its direction have been the main challenges in many face recognition systems that lead to the different normal and abnormal shadows. Today, various methods are presented for face recognition under different lighting conditions which require previous knowledge about Light source and the angle of radiation as well. In this paper, a new approach is proposed to extract the knowledge of/about the lighting angle/direction in face images based on learning techniques. At First, some effective coefficients on lighting variation are extracted on DCT domain. They will be used to determine lighting classes after normalization. Then, three different learning algorithms, Decision tree, SVM, and WAODE (Weightily Averaged One-Dependence Estimators) are used to learn the lighting classes. The algorithms have been tested on the well known YaleB and Extended Yale face databases. The comparative results indicate that the SVM achieves the best average accuracy for classification. On the other hand, WAODE Bayesian approach attains the better accuracy in classes with large lighting angle because of its resistance against data loss.
Manuscript profile
Support Vector machine is one of the most popular and efficient algorithms in machine learning. There are several versions of this algorithm, the latest of which is the fuzzy least squares twin support vector machines. On the other hand, in many machine learning applica More
Support Vector machine is one of the most popular and efficient algorithms in machine learning. There are several versions of this algorithm, the latest of which is the fuzzy least squares twin support vector machines. On the other hand, in many machine learning applications input data is continuously generated, which has made many traditional algorithms inefficient to deal with them. In this paper, for the first time, an incremental version of the fuzzy least squares twin support vector algorithm is presented. The proposed algorithmis represented in both online and quasi-online modes. To evaluate the accuracy and precision of the proposed algorithmfirst we run our algorithm on 6 datasets of the UCI repository. Results showthe proposed algorithm is more efficient than other algorithms (even non-incremental versions). In the second phase in the experiments, we consider an application of Internet of Things, and in particular in data related to daily activities which inherently are incremental. According to experimental results, the proposed algorithm has the best performance compared to other incremental algorithms.
Manuscript profile