scholarly journals The Impact of Different Kernel Functions on the Performance of Scintillation Detection Based on Support Vector Machines

Sensors ◽  
2019 ◽  
Vol 19 (23) ◽  
pp. 5219 ◽  
Author(s):  
Caner Savas ◽  
Fabio Dovis
Keyword(s):  
Support Vector Machines ◽  
Kernel Functions ◽  
Gaussian Kernel ◽  
Polynomial Kernel ◽  
Ionospheric Scintillation ◽  
Support Vector ◽  
Running Time ◽  
Scintillation Detection ◽  
Vector Machines ◽  
The Impact

Scintillation caused by the electron density irregularities in the ionospheric plasma leads to rapid fluctuations in the amplitude and phase of the Global Navigation Satellite Systems (GNSS) signals. Ionospheric scintillation severely degrades the performance of the GNSS receiver in the signal acquisition, tracking, and positioning. By utilizing the GNSS signals, detecting and monitoring the scintillation effects to decrease the effect of the disturbing signals have gained importance, and machine learning-based algorithms have been started to be applied for the detection. In this paper, the performance of Support Vector Machines (SVM) for scintillation detection is discussed. The effect of the different kernel functions, namely, linear, Gaussian, and polynomial, on the performance of the SVM algorithm is analyzed. Performance is statistically assessed in terms of probabilities of detection and false alarm of the scintillation event. Real GNSS signals that are affected by significant phase and amplitude scintillation effect, collected at the South African Antarctic research base SANAE IV and Hanoi, Vietnam have been used in this study. This paper questions how to select a suitable kernel function by analyzing the data preparation, cross-validation, and experimental test stages of the SVM-based process for scintillation detection. It has been observed that the overall accuracy of fine Gaussian SVM outperforms the linear, which has the lowest complexity and running time. Moreover, the third-order polynomial kernel provides improved performance compared to linear, coarse, and medium Gaussian kernel SVMs, but it comes with a cost of increased complexity and running time.

Kernel Functions Derived from Fuzzy Clustering and Their Application to Kernel Fuzzyc-Means

2011 ◽  
Vol 15 (1) ◽  
pp. 90-94 ◽  
Author(s):  
Jeongsik Hwang ◽  
◽  
Sadaaki Miyamoto
Keyword(s):  
Data Analysis ◽  
Support Vector Machines ◽  
Fuzzy Clustering ◽  
Kernel Functions ◽  
Gaussian Kernel ◽  
Support Vector ◽  
Monotone Functions ◽  
Completely Monotone Functions ◽  
Completely Monotone ◽  
Vector Machines

Among widely used kernel functions, such as support vector machines, in data analysis, the Gaussian kernel is most often used. This kernel arises in entropy-based fuzzyc-means clustering. There is reason, however, to check whether other types of functions used in fuzzyc-means are also kernels. Using completely monotone functions, we show they can be kernels if a regularization constant proposed by Ichihashi is introduced. We also show how these kernel functions are applied to kernel-based fuzzyc-means clustering, which outperform the Gaussian kernel in a typical example.

Persian Handwritten Number Recognition Using Adapted Framing Feature and Support Vector Machines

2016 ◽  
Vol 15 (01) ◽  
pp. 1650004 ◽  
Author(s):  
Hedieh Sajedi ◽  
Mehran Bahador
Keyword(s):  
Support Vector Machines ◽  
Recognition Rate ◽  
Nearest Neighbors ◽  
Polynomial Kernel ◽  
Support Vector ◽  
K Nearest Neighbors ◽  
New Approach ◽  
Number Recognition ◽  
Vector Machines

In this paper, a new approach for segmentation and recognition of Persian handwritten numbers is presented. This method utilizes the framing feature technique in combination with outer profile feature that we named this the adapted framing feature. In our proposed approach, segmentation of the numbers into digits has been carried out automatically. In the classification stage of the proposed method, Support Vector Machines (SVM) and k-Nearest Neighbors (k-NN) are used. Experimentations are conducted on the IFHCDB database consisting 17,740 numeral images and HODA database consisting 102,352 numeral images. In isolated digit level on IFHCDB, the recognition rate of 99.27%, is achieved by using SVM with polynomial kernel. Furthermore, in isolated digit level on HODA, the recognition rate of 99.07% is achieved by using SVM with polynomial kernel. The experiments illustrate that applying our proposed method resulted higher accuracy compared to previous researches.

scholarly journals Efficient Technique for Facial Image Recognition With Support Vector Machines in 2D Images With Cross-validation in Matlab

2020 ◽  
Vol 15 ◽  
Keyword(s):  
Support Vector Machines ◽  
Cross Validation ◽  
Facial Recognition ◽  
Kernel Functions ◽  
Efficient Technique ◽  
Support Vector ◽  
Facial Image ◽  
Vector Machines ◽  
Validation Technique ◽  
2D Images

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%.

Support Vector Machine for Recognition of White Blood Cells of Leukaemia

2011 ◽  
pp. 93-122 ◽  
Author(s):  
Stanislaw Osowski ◽  
Tomasz Markiewicz
Keyword(s):  
Support Vector Machines ◽  
Blood Cells ◽  
White Blood Cells ◽  
Myelogenous Leukaemia ◽  
Image Feature ◽  
Gaussian Kernel ◽  
Support Vector ◽  
Vector Machines ◽  
Kernel Support Vector Machines ◽  
The Individual

This chapter presents an automatic system for white blood cell recognition in myelogenous leukaemia on the basis of the image of a bone-marrow smear. It addresses the following fundamental problems of this task: the extraction of the individual cell image of the smear, generation of different features of the cell, selection of the best features, and final recognition using an efficient classifier network based on support vector machines. The chapter proposes the complete system solving all these problems, beginning from cell extraction using the watershed algorithm; the generation of different features based on texture, geometry, morphology, and the statistical description of the intensity of the image; feature selection using linear support vector machines; and finally classification by applying Gaussian kernel support vector machines. The results of numerical experiments on the recognition of up to 17 classes of blood cells of myelogenous leukaemia have shown that the proposed system is quite accurate and may find practical application in hospitals in the diagnosis of patients suffering from leukaemia.

Classification in GIS Using Support Vector Machines

2010 ◽  
pp. 106-112 ◽  
Author(s):  
Alina Lazar ◽  
Bradley A. Shellito
Keyword(s):  
Support Vector Machines ◽  
Urban Development ◽  
Rural Areas ◽  
Urban Areas ◽  
Kernel Functions ◽  
Support Vector ◽  
Future Trends ◽  
Error Signal ◽  
Vector Machines

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.

scholarly journals Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel

2003 ◽  
Vol 15 (7) ◽  
pp. 1667-1689 ◽  
Author(s):  
S. Sathiya Keerthi ◽  
Chih-Jen Lin
Keyword(s):  
Support Vector Machines ◽  
Model Selection ◽  
Heuristic Method ◽  
Gaussian Kernel ◽  
Support Vector ◽  
Svm Classifier ◽  
Vector Machines ◽  
Rbf Kernel ◽  
Linear Svm ◽  
Generalization Errors

Support vector machines (SVMs) with the gaussian (RBF) kernel have been popular for practical use. Model selection in this class of SVMs involves two hyper parameters: the penalty parameter C and the kernel width σ. This letter analyzes the behavior of the SVM classifier when these hyper parameters take very small or very large values. Our results help in understanding the hyperparameter space that leads to an efficient heuristic method of searching for hyperparameter values with small generalization errors. The analysis also indicates that if complete model selection using the gaussian kernel has been conducted, there is no need to consider linear SVM.

Sign in / Sign up

Export Citation Format

Share Document