Midpoint-validation algorithm for support vector machine classification

In this article, we propose a midpoint-validation algorithm for a support vector machine which improves the generalization of the support vector machine so that the midpoint-validation error is minimized. We compared its performance with other techniques for support vector machines, and also tested our proposed method on fifth benchmark problems. The results obtained from the simulation shows the effectiveness of the proposed method.     

Gaze direction estimation using support vector machine with active appearance model

In recent years, research on human-computer interaction is becoming popular, most of which uses body movements, gestures or eye gaze direction. Until now, gazing estimation is still an active research domain. We propose an efficient method to solve the problem of the eye gaze point. We first locate the eye region by modifying the characteristics of the Active Appearance Model (AAM). Then by employing the Support Vector Machine (SVM), we estimate the five gazing directions through classification. The original 68 facial feature points in AAM are modified into 36 eye feature points. According to the two-dimensional coordinates of feature points, we classify different directions of eye gazing. The modified 36 feature points describe the contour of eyes, iris size, iris location, and the position of pupils. In addition, the resolution of cameras does not affect our method to determine the direction of line of sight accurately. The final results show the independence of classifications, less classification errors, and more accurate estimation of the gazing directions.     

Color image segmentation using automatic pixel classification with support vector machine

Automatic segmentation of images is a very challenging fundamental task in computer vision and one of the most crucial steps toward image understanding. In this paper, we present a color image segmentation using automatic pixel classification with support vector machine (SVM). First, the pixel-level color feature is extracted in consideration of human visual sensitivity for color pattern variations, and the image pixel's texture feature is represented via steerable filter. Both the pixel-level color feature and texture feature are used as input of SVM model (classifier). Then, the SVM model (classifier) is trained by using fuzzy c-means clustering (FCM) with the extracted pixel-level features. Finally, the color image is segmented with the trained SVM model (classifier). This image segmentation not only can fully take advantage of the local information of color image, but also the ability of SVM classifier. Experimental evidence shows that the proposed method has a very effective segmentation results and computational behavior, and decreases the time and increases the quality of color image segmentation in compare with the state-of-the-art segmentation methods recently proposed in the literature.     

Action unit classification for facial expression recognition using active learning and SVM

Multimedia Tools and Applications - Automatic facial expression analysis remains challenging due to its low recognition accuracy and poor robustness. In this study, we utilized active learning and...     

基于细菌觅食算法和支持向量机的表情识别

为正确选择应用于人脸表情识别的支持向量机相关参数,提高表情识别准确率,提出一种应用于表情识别的基于细菌觅食算法的支持向量机参数选择方法。利用细菌觅食算法,通过模拟细菌觅食行为的趋向性操作、复制操作和迁移操作对应用于表情识别的支持向量机的参数进行寻优,避免寻优陷入局部最优,实现参数优化。实验结果表明,采用该方法能够使人脸表情识别分类结果具有更高的准确率。     

Wavelets-based facial expression recognition using a bank of support vector machines

A human face does not play its role in the identification of an individual but also communicates useful information about a person’s emotional state at a particular time. No wonder automatic face expression recognition has become an area of great interest within the computer science, psychology, medicine, and human–computer interaction research communities. Various feature extraction techniques based on statistical to geometrical data have been used for recognition of expressions from static images as well as real-time videos. In this paper, we present a method for automatic recognition of facial expressions from face images by providing discrete wavelet transform features to a bank of seven parallel support vector machines (SVMs). Each SVM is trained to recognize a particular facial expression, so that it is most sensitive to that expression. Multi-classification is achieved by combining multiple SVMs performing binary classification using one-against-all approach. The outputs of all SVMs are combined using a maximum function. The classification efficiency is tested on static images from the publicly available Japanese Female Facial Expression database. The experiments using the proposed method demonstrate promising results.     

Imbalanced classification using support vector machine ensemble

Imbalanced data sets often have detrimental effects on the performance of a conventional support vector machine (SVM). To solve this problem, we adopt both strategies of modifying the data distribution and adjusting the classifier. Both minority and majority classes are resampled to increase the generalization ability. For minority class, an one-class support vector machine model combined with synthetic minority oversampling technique is used to oversample the support vector instances. For majority class, we propose a new method to decompose the majority class into clusters and remove two clusters using a distance measure to lessen the effect of outliers. The remaining clusters are used to build an SVM ensemble with the oversampled minority patterns, the SVM ensemble can achieve better performance by considering potentially suboptimal solutions. Experimental results on benchmark data sets are provided to illustrate the effectiveness of the proposed method.     

An effective feature selection method for hyperspectral image classification based on genetic algorithm and support vector machine

With the development and popularization of the remote-sensing imaging technology, there are more and more applications of hyperspectral image classification tasks, such as target detection and land cover investigation. It is a very challenging issue of urgent importance to select a minimal and effective subset from those mass of bands. This paper proposed a hybrid feature selection strategy based on genetic algorithm and support vector machine (GA–SVM), which formed a wrapper to search for the best combination of bands with higher classification accuracy. In addition, band grouping based on conditional mutual information between adjacent bands was utilized to counter for the high correlation between the bands and further reduced the computational cost of the genetic algorithm. During the post-processing phase, the branch and bound algorithm was employed to filter out those irrelevant band groups. Experimental results on two benchmark data sets have shown that the proposed approach is very competitive and effective.     

Optimizing parameters of support vector machine using fast messy genetic algorithm for dispute classification

Hybrid system is a potential tool to deal with construction engineering and management problems. This study proposes an optimized hybrid artificial intelligence model to integrate a fast messy genetic algorithm (fmGA) with a support vector machine (SVM). The fmGA-based SVM (GASVM) is used for early prediction of dispute propensity in the initial phase of public–private partnership projects. Particularly, the SVM mainly provides learning and curve fitting while the fmGA optimizes SVM parameters. Measures in term of accuracy, precision, sensitivity, specificity, and area under the curve and synthesis index are used for performance evaluation of proposed hybrid intelligence classification model. Experimental comparisons indicate that GASVM achieves better cross-fold prediction accuracy compared to other baseline models (i.e., CART, CHAID, QUEST, and C5.0) and previous works. The forecasting results provide the proactive-warning and decision-support information needed to manage potential disputes.     

Patent classification system using a new hybrid genetic algorithm support vector machine

Nowadays, decision-making activities of knowledge-intensive enterprises depend heavily on the successful classification of patents. A considerable amount of time is required to achieve successful classification because of the complexity associated with patent information and of the large number of potential patents. Several different patent classification approaches have been developed in the past, but most of these studies focus on using computational models for the International Patent Classification (IPC) system rather than using these models in real-world cases of patent classification. In contrast to previous studies that combined algorithms and the IPC system directly without using expert screening, this study proposes a novel artificial intelligence (AI)-aided patent decision-making process. In this process, an expert screening approach is integrated with a hybrid genetic-based support vector machine (HGA-SVM) model for developing a patent classification system with the high classification accuracy and generalization ability for real-world patent searching cases. The proposed approach is tested on a real-world case—an expert's patent document searching history that contains 234 patent documents of semiconductor equipment components. The research results demonstrate that our proposed hybrid genetic algorithm approach can optimize all the parameters of the SVM for developing a patent classification system with a high accuracy. The proposed HGA-SVM model is able to dynamically and automatically classify patent documents by recording and learning the experts’ knowledge and logic. Finally, we propose a new decision-making process for improving the development of the SVM patent classification and searching system.     

Dynamic classification for video stream using support vector machine

A dynamic classification using the support vector machine (SVM) technique is presented in this paper as a new ‘incremental’ framework for multiple-classifying video stream data. The contribution of this study is the derivation of a unique, fast and simple to implement technique that allows multi-classification of behavioral motions based on an adaptation of the least-square SVM (LS-SVM) formulation. This dynamic approach leads to an extension of SVM beyond its current static image-based learning capabilities. The proposed incremental multi-classification method is applied to video stream data, which consists of an articulated humanoid model monitored by a surveillance camera. The initial supervised off-line learning phase is followed by a visual behavior data acquisition and then an incremental learning phase. The resulting error rate and the confidence level for the proposed technique demonstrate its validity and merits in articulated motion learning. Furthermore, the enabled online learning allows an adaptive domain knowledge insertion and provides the advantage of reducing both the model training time and the information storage requirements of the overall system which are both essential for dynamic soft computing applications.     

Operator functional state classification using least-square support vector machine based recursive feature elimination technique

This paper proposed two psychophysiological-data-driven classification frameworks for operator functional states (OFS) assessment in safety-critical human-machine systems with stable generalization ability. The recursive feature elimination (RFE) and least square support vector machine (LSSVM) are combined and used for binary and multiclass feature selection. Besides typical binary LSSVM classifiers for two-class OFS assessment, two multiclass classifiers based on multiclass LSSVM-RFE and decision directed acyclic graph (DDAG) scheme are developed, one used for recognizing the high mental workload and fatigued state while the other for differentiating overloaded and base-line states from the normal states. Feature selection results have revealed that different dimensions of OFS can be characterized by specific set of psychophysiological features. Performance comparison studies show that reasonable high and stable classification accuracy of both classification frameworks can be achieved if the RFE procedure is properly implemented and utilized.     

一种新的软间隔支持向量机分类算法

软间隔支持向量机（SVM）分类算法是目前最具有代表性的模式分类算法之一,它在应用中的一个主要困难是确定控制参数C.提出一种新的软间隔SVM分类算法,通过松弛变量改变约束条件,允许数据点进入分离区域但不越过分类超平面,从而避免了参数C的确定问题.计算机实验和故障诊断实例表明,基于新算法的SVM分类器有较高的分类准确性和较好的泛化性能,能够实际应用于模式分类.     

基于支持向量机和遗传算法的人脸识别研究

采用自适应遗传算法(AGA)优化筛选改进高斯核函数支持向量机(SVM)参数模型进行人脸特征分类。支持向量机的泛化性能主要取决于核函数类型和核函数参数及惩罚系数C,本文在传统高斯核函数基础上提出改进高斯核函数作为支持向量机的非线性映射函数,并使用自适应遗传算法优化筛选核函数参数和支持向量机惩罚系数,将优化后的SVM模型用于人脸库进行实验仿真。实验结果表明,本文方法比传统高斯核函数支持向量机分类器模型有更高识别率。     

Improved barnacles mating optimizer algorithm for feature selection and support vector machine optimization

Pattern Analysis and Applications - With the rapid development of computer technology, data collection becomes easier, and data object presents more complex. Data analysis method based on machine...     

Online learning method using support vector machine for surface-electromyogram recognition

Research surface electromyogram (s-EMG) signal recognition using neural networks is a method which identifies the relation between s-EMG patterns. However, it is not sufficiently satisfying for the user because s-EMG signals change according to muscle wasting or to changes in the electrode position, etc. A support vector machine (SVM) is one of the most powerful tools for solving classification problems, but it does not have an online learning technique. In this article, we propose an online learning method using SVM with a pairwise coupling technique for s-EMG recognition. We compared its performance with the original SVM and a neural network. Simulation results showed that our proposed method is better than the original SVM. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Simultaneous feature selection and classification using kernel-penalized support vector machines

We introduce an embedded method that simultaneously selects relevant features during classifier construction by penalizing each feature’s use in the dual formulation of support vector machines (SVM). This approach called kernel-penalized SVM (KP-SVM) optimizes the shape of an anisotropic RBF Kernel eliminating features that have low relevance for the classifier. Additionally, KP-SVM employs an explicit stopping condition, avoiding the elimination of features that would negatively affect the classifier’s performance. We performed experiments on four real-world benchmark problems comparing our approach with well-known feature selection techniques. KP-SVM outperformed the alternative approaches and determined consistently fewer relevant features.     

Web-based algorithm for cylindricity evaluation using support vector machine learning

This paper introduces a cylindricity evaluation algorithm based on support vector machine learning with a specific kernel function, referred to as SVR, as a viable alternative to traditional least square method (LSQ) and non-linear programming algorithm (NLP). Using the theory of support vector machine regression, the proposed algorithm in this paper provides more robust evaluation in terms of CPU time and accuracy than NLP and this is supported by computational experiments. Interestingly, it has been shown that the SVR significantly outperforms LSQ in terms of the accuracy while it can evaluate the cylindricity in a more robust fashion than NLP when the variance of the data points increases. The robust nature of the proposed algorithm is expected because it converts the original nonlinear problem with nonlinear constraints into other nonlinear problem with linear constraints. In addition, the proposed algorithm is programmed using Java Runtime Environment to provide users with a Web based open source environment. In a real-world setting, this would provide manufacturers with an algorithm that can be trusted to give the correct answer rather than making a good part rejected because of inaccurate computational results.