Abstract
This paper deals with a probabilistic weighted multi-class support vector machines for face recognition. The support vector machines (SVM) has been applied to many application fields such as pattern recognition in last decade. The support vector machines determine the hyperplane which separates largest fraction of samples of the similar class on the same side. The SVM also maximizes the distance from the either class to the separating hyperplane. It has been observed that in many realistic applications, the achieved training data is frequently tainted by outliers and noises. Support vector machines are very sensitive to outliers and noises. It may happen that a number of points in the training dataset are misplaced from their true position or even on the wrong side of the feature space. The weighted support vector machines are designed to overcome the outlier sensitivity problem of the support vector machines. The main issue in the training of the weighted support vector machines algorithm is to build up a consistent weighting model which can imitate true noise distribution in the training dataset, i.e., reliable data points should have higher weights, and the outliers should have lower weights. Therefore, the weighted support vector machines are trained depending on the weights of the data points in the training set. In the proposed probabilistic weighted multi-class support vector machines the weights are generated by probabilistic method. The weighted multi-class support vector machines have been constructed using a combination of the weighted binary support vector machines and one-against-all decision strategies. Numerous experiments have been performed on the AR, CMU PIE and FERET face databases using different experimental strategies. The experimental results show that the performance of the probabilistic weighted multi-class support vector machines is superior to the multi-class support vector machines in terms of recognition rate.
Highlights
The support vector machines (SVM) can be considered as an estimated implementation of the structural risk minimization method [1]
We evaluate the performance of the proposed probabilistic weighted multi-class support vector machines on the AR face database [22], [23], CMU PIE face database [24], and FERET face database [25]
We present the probabilistic weighted multi-class support vector machines for efficient face recognition
Summary
The SVM can be considered as an estimated implementation of the structural risk minimization method [1]. Song et al [6], [7] proposed a robust SVM (RSVM) in which to generate an adaptive margin, the space between centre of every class of the training sample and the data point is computed. This method has a drawback because it is very difficult to tune the penalty parameter. The probabilistic method is used to generate the weights of the proposed probabilistic weighted multi-class support vector machines training algorithm These weights are incorporated with all data points of the training set. The extracted features are applied on the proposed probabilistic weighted multi-class support vector machines for training, classification and recognition.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
