SVM Compound Kernel Functions for Vehicle Target Classification

Author(s):  
Edison A. Roxas ◽  
◽  
Ryan Rhay P. Vicerra ◽  
Laurence A. Gan Lim ◽  
Elmer P. Dadios ◽  
...  

The focus of this paper is to explore the use of kernel combinations of the support vector machines (SVMs) for vehicle classification. Being the primary component of the SVM, the kernel functions are responsible for the pattern analysis of the vehicle dataset and to bridge its linear and non-linear features. However, the choice of the type of kernel functions has characteristics and limitations that are highly dependent on the parameters. Thus, in order to overcome these limitations, a method of compounding kernel function for vehicle classification is hereby introduced and discussed. The vehicle classification accuracy of the compound kernel function presented is then compared to the accuracies of the conventional classifications obtained from the four commonly used individual kernel functions (linear, quadratic, cubic, and Gaussian functions). This study provides the following contributions: (1) The classification method is able to determine the rank in terms of accuracies of the four individual kernel functions; (2) The method is able to combine the top three individual kernel functions; and (3) The best combination of the compound kernel functions can be determined.

2016 ◽  
Vol 16 (5) ◽  
pp. 5-14 ◽  
Author(s):  
Hao Huanrui

Abstract The pattern analysis technology based on kernel methods is a new technology, which combines good performance and strict theory. With support vector machine, pattern analysis is easy and fast. But the existing kernel function fits the requirement. In the paper, we explore the new mixed kernel functions which are mixed with Gaussian and Wavelet function, Gaussian and Polynomial kernel function. With the new mixed kernel functions, we check different parameters. The results shows that the new mixed kernel functions have good time efficiency and accuracy. In image recognition we used SVM with two mixed kernel functions, the mixed kernel function of Gaussian and Wavelet function are suitable for more states.


2021 ◽  
Vol 2089 (1) ◽  
pp. 012015
Author(s):  
Lingam Sunitha ◽  
M Bal Raju

Abstract Most important part of Support Vector Machines(SVM) are the kernels. Although there are several widely used kernel functions, a carefully designed kernel will help improve the accuracy of SVM. The proposed work aims to develop a new kernel function for a multi-class support vector machine, perform experiments on various data sets, and compare them with other classification methods. Directly it is not possible multiclass classification with SVM. In this proposed work first designed a model for binary class then extended with the one-verses-all approach. Experimental results have proved the efficiency of the new kernel function. The proposed kernel reduces misclassification and time. Other classification methods observed better results for some data sets collected from the UCI repository.


2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Jinshan Qi ◽  
Xun Liang ◽  
Rui Xu

By utilizing kernel functions, support vector machines (SVMs) successfully solve the linearly inseparable problems. Subsequently, its applicable areas have been greatly extended. Using multiple kernels (MKs) to improve the SVM classification accuracy has been a hot topic in the SVM research society for several years. However, most MK learning (MKL) methods employ L1-norm constraint on the kernel combination weights, which forms a sparse yet nonsmooth solution for the kernel weights. Alternatively, the Lp-norm constraint on the kernel weights keeps all information in the base kernels. Nonetheless, the solution of Lp-norm constraint MKL is nonsparse and sensitive to the noise. Recently, some scholars presented an efficient sparse generalized MKL (L1- and L2-norms based GMKL) method, in which L1  L2 established an elastic constraint on the kernel weights. In this paper, we further extend the GMKL to a more generalized MKL method based on the p-norm, by joining L1- and Lp-norms. Consequently, the L1- and L2-norms based GMKL is a special case in our method when p=2. Experiments demonstrated that our L1- and Lp-norms based MKL offers a higher accuracy than the L1- and L2-norms based GMKL in the classification, while keeping the properties of the L1- and L2-norms based on GMKL.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Rakesh Patra ◽  
Sujan Kumar Saha

Support vector machine (SVM) is one of the popular machine learning techniques used in various text processing tasks including named entity recognition (NER). The performance of the SVM classifier largely depends on the appropriateness of the kernel function. In the last few years a number of task-specific kernel functions have been proposed and used in various text processing tasks, for example, string kernel, graph kernel, tree kernel and so on. So far very few efforts have been devoted to the development of NER task specific kernel. In the literature we found that the tree kernel has been used in NER task only for entity boundary detection or reannotation. The conventional tree kernel is unable to execute the complete NER task on its own. In this paper we have proposed a kernel function, motivated by the tree kernel, which is able to perform the complete NER task. To examine the effectiveness of the proposed kernel, we have applied the kernel function on the openly available JNLPBA 2004 data. Our kernel executes the complete NER task and achieves reasonable accuracy.


Author(s):  
B. Yekkehkhany ◽  
A. Safari ◽  
S. Homayouni ◽  
M. Hasanlou

In this paper, a framework is developed based on Support Vector Machines (SVM) for crop classification using polarimetric features extracted from multi-temporal Synthetic Aperture Radar (SAR) imageries. The multi-temporal integration of data not only improves the overall retrieval accuracy but also provides more reliable estimates with respect to single-date data. Several kernel functions are employed and compared in this study for mapping the input space to higher Hilbert dimension space. These kernel functions include linear, polynomials and Radial Based Function (RBF). <br><br> The method is applied to several UAVSAR L-band SAR images acquired over an agricultural area near Winnipeg, Manitoba, Canada. In this research, the temporal alpha features of H/A/α decomposition method are used in classification. The experimental tests show an SVM classifier with RBF kernel for three dates of data increases the Overall Accuracy (OA) to up to 3% in comparison to using linear kernel function, and up to 1% in comparison to a 3rd degree polynomial kernel function.


This article presented in the context of 2D global facial recognition, using Gabor Wavelet's feature extraction algorithms, and facial recognition Support Vector Machines (SVM), the latter incorporating the kernel functions: linear, cubic and Gaussian. The models generated by these kernels were validated by the cross validation technique through the Matlab application. The objective is to observe the results of facial recognition in each case. An efficient technique is proposed that includes the mentioned algorithms for a database of 2D images. The technique has been processed in its training and testing phases, for the facial image databases FERET [1] and MUCT [2], and the models generated by the technique allowed to perform the tests, whose results achieved a facial recognition of individuals over 96%.


Author(s):  
Alina Lazar ◽  
Bradley A. Shellito

Support Vector Machines (SVM) are powerful tools for classification of data. This article describes the functionality of SVM including their design and operation. SVM have been shown to provide high classification accuracies and have good generalization capabilities. SVM can classify linearly separable data as well as nonlinearly separable data through the use of the kernel function. The advantages of using SVM are discussed along with the standard types of kernel functions. Furthermore, the effectiveness of applying SVM to large, spatial datasets derived from Geographic Information Systems (GIS) is also described. Future trends and applications are also discussed – the described extracted dataset contains seven independent variables related to urban development plus a class label which denotes the urban areas versus the rural areas. This large dataset, with over a million instances really proves the generalization capabilities of the SVM methods. Also, the spatial property allows experts to analyze the error signal.


2014 ◽  
Vol 543-547 ◽  
pp. 1659-1662
Author(s):  
Juan Du ◽  
Wen Long Zhang ◽  
Meng Meng Xie

The kernel was the key technology of SVM; the kernel affected the learning ability and generalization ability of support vector machine. Aiming at the specific application of harmful text information recognition, combining traditional kernel function the paper structured a new combination kernel, modeling for the independent harmful vocabulary and co-occur vocabularies, and then evaluation the linear kernel, homogeneous polynomial kernel, non homogeneous polynomial kernel and combination kernel function in the sample experiment. The experimental results of combination kernel function showed that the effect has increased greatly than other kernel functions for the application of harmful text information filtering. Especially the Rcall value achieved satisfactory results.


Sign in / Sign up

Export Citation Format

Share Document