Automated scaffolding safety analysis: strain feature investigation using support vector machines

2020 ◽  
Vol 47 (8) ◽  
pp. 921-928
Author(s):  
Sayan Sakhakarmi ◽  
Cristian Arteaga ◽  
JeeWoong Park ◽  
Chunhee Cho
Keyword(s):  
Real Time ◽  
Kernel Functions ◽  
Training Data ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Individual Member ◽  
Machine Learning Classification ◽  
Vector Machines ◽  
Potential Failure ◽  
Safety Cases

This study developed a methodology that can use real-time strain data for the assessment of scaffolding safety conditions. The researchers identified 23 safety cases of individual member failure with generic global failure for a four-bay, three-story scaffold model and used scaffold member strain values to identify potential failure cases. A computer simulation on the scaffold model generated the strain datasets required for classification with a support vector machine (SVM). The SVM classification demonstrated a stable prediction accuracy after training with a certain number of strain datasets. Furthermore, the 2nd order polynomial kernel function resulted in better prediction compared to other SVM kernel functions. These results imply that the real-time assessment of scaffolding structures is possible with a limited number of training data for machine-learning classification.

FACE RECOGNITION USING SUPPORT VECTOR MACHINES WITH LOCAL CORRELATION KERNELS

2002 ◽  
Vol 16 (01) ◽  
pp. 97-111 ◽  
Author(s):  
KWANG IN KIM ◽  
JIN HYUNG KIM ◽  
KEECHUL JUNG
Keyword(s):  
Face Recognition ◽  
Support Vector Machines ◽  
Real Time ◽  
Recognition Rate ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Local Correlation ◽  
Correlation Kernel ◽  
Vector Machines ◽  
The Face

This paper presents a real-time face recognition system. For the system to be real time, no external time-consuming feature extraction method is used, rather the gray-level values of the raw pixels that make up the face pattern are fed directly to the recognizer. In order to absorb the resulting high dimensionality of the input space, support vector machines (SVMs), which are known to work well even in high-dimensional space, are used as the face recognizer. Furthermore, a modified form of polynomial kernel (local correlation kernel) is utilized to take account of prior knowledge about facial structures and is used as the alternative feature extractor. Since SVMs were originally developed for two-class classification, their basic scheme is extended for multiface recognition by adopting one-per-class decomposition. In order to make a final classification from several one-per-class SVM outputs, a neural network (NN) is used as the arbitrator. Experiments with ORL database show a recognition rate of 97.9% and speed of 0.22 seconds per face with 40 classes.

scholarly journals Comparison some of kernel functions with support vector machines classifier for thalassemia dataset

2021 ◽  
Vol 10 (2) ◽  
pp. 430
Author(s):  
Ilsya Wirasati ◽  
Zuherman Rustam ◽  
Jane Eva Aurelia ◽  
Sri Hartini ◽  
Glori Stephani Saragih
Keyword(s):  
Kernel Functions ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Medical Field ◽  
Treatment Technology ◽  
Blood Disorder ◽  
Vector Machines ◽  
Improve Accuracy ◽  
Rbf Kernel

<span id="docs-internal-guid-9a30056f-7fff-8ff1-59e1-69f89f4280bd"><span>In the medical field, accurate classification of medical data is really important because of its impact on disease detection and patient’s treatment. Technology, machine learning, is needed to help medical staff to improve accuracy to classify disease. This research discussed some kernel functions, such as gaussian radial basis function (RBF) kernel, Polynomial kernel, and linear kernel with support vector machine (SVM) to classify thalassemia data. Thalassemia is a genetic blood disorder which is also one of the major public health problems. In this paper, there is an explanation about thalassemia, SVM, and some of the kernel functions that serve as a comprehensive source for the next research about this topic. Furthermore, there is a comparison result from three kernel functions to find out which one has the best performance. The result is gaussian RBF kernel with SVM is the best method with an average of accuracy 99,63%. </span></span>

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.

scholarly journals Polyhedral conic kernel-like functions for SVMs

2019 ◽  
pp. 1172-1180 ◽  
Author(s):  
GÜRKAN ÖZTÜRK ◽  
EMRE ÇİMEN
Keyword(s):  
Kernel Functions ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Grid Search ◽  
New Approach ◽  
Nonlinear Classification ◽  
Vector Machines ◽  
Grid Search Method ◽  
Best Parameters ◽  
Selection Of

In this study, we propose a new approach that can be used as a kernel-like function for support vector machines (SVMs) in order to get nonlinear classification surfaces. We combined polyhedral conic functions (PCFs) with the SVM method. To get nonlinear classification surfaces, kernel functions are used with SVMs. However, the parameter selection of the kernel function affects the classification accuracy. Generally, in order to get successful classifiers which can predict unknown data accurately, best parameters are explored with the grid search method which is computationally expensive. We solved this problem with the proposed method. There is no need to optimize any parameter in the proposed method. We tested the proposed method on three publicly available datasets. Next, the classification accuracies of the proposed method were compared with the linear, radial basis function (RBF), Pearson universal kernel (PUK), and polynomial kernel SVMs. The results are competitive with those of the other methods.

scholarly journals SUPERVISED CLASSIFICATION PROCESSES FOR THE CHARACTERIZATION OF HERITAGE ELEMENTS, CASE STUDY: CUENCA-ECUADOR

2017 ◽  
Vol IV-2/W2 ◽  
pp. 39-45
Author(s):  
J. C. Briones ◽  
V. Heras ◽  
C. Abril ◽  
E. Sinchi
Keyword(s):  
Kernel Functions ◽  
Aerial Images ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Preventive Conservation ◽  
Heritage Sites ◽  
Monitoring Process ◽  
Vector Machines ◽  
Ideal Tool ◽  
High Level

The proper control of built heritage entails many challenges related to the complexity of heritage elements and the extent of the area to be managed, for which the available resources must be efficiently used. In this scenario, the preventive conservation approach, based on the concept that prevent is better than cure, emerges as a strategy to avoid the progressive and imminent loss of monuments and heritage sites. Regular monitoring appears as a key tool to identify timely changes in heritage assets. This research demonstrates that the supervised learning model (Support Vector Machines &amp;ndash; SVM) is an ideal tool that supports the monitoring process detecting visible elements in aerial images such as roofs structures, vegetation and pavements. The linear, gaussian and polynomial kernel functions were tested; the lineal function provided better results over the other functions. It is important to mention that due to the high level of segmentation generated by the classification procedure, it was necessary to apply a generalization process through opening a mathematical morphological operation, which simplified the over classification for the monitored elements.

scholarly journals Combining Fractional Cover Images with One-Class Classifiers Enables Near Real-Time Monitoring of Fallows in the Northern Grains Region of Australia

2020 ◽  
Vol 12 (8) ◽  
pp. 1337
Author(s):  
Liya Zhao ◽  
François Waldner ◽  
Peter Scarth ◽  
Benjamin Mack ◽  
Zvi Hochman
Keyword(s):  
Support Vector Machines ◽  
Real Time ◽  
Land Surface ◽  
Cropping Systems ◽  
Training Data ◽  
Support Vector ◽  
Fractional Cover ◽  
Vector Machines ◽  
Unlabelled Data ◽  
Time Accuracy

Fallows are widespread in dryland cropping systems. However, timely information about their spatial extent and location remains scarce. To overcome this lack of information, we propose to classify fractional cover data from Sentinel-2 with biased support vector machines. Fractional cover images describe the land surface in intuitive, biophysical terms, which reduces the spectral variability within the fallow class. Biased support vector machines are a type of one-class classifiers that require labelled data for the class of interest and unlabelled data for the other classes. They allow us to extrapolate in-situ observations collected during flowering to the rest of the growing season to generate large training data sets, thereby reducing the data collection requirements. We tested this approach to monitor fallows in the northern grains region of Australia and showed that the seasonal fallow extent can be mapped with >92% accuracy both during the summer and winter seasons. The summer fallow extent can be accurately mapped as early as mid-December (1–4 months before harvest). The winter fallow extent can be accurately mapped from mid-August (2–4 months before harvest). Our method also detected emergence dates successfully, indicating the near real-time accuracy of our method. We estimated that the extent of fallow fields across the northern grains region of Australia ranged between 50% in winter 2017 and 85% in winter 2019. Our method is scalable, sensor independent and economical to run. As such, it lays the foundations for reconstructing and monitoring the cropping dynamics in Australia.

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 A Multiple Kernel Learning Model Based on p-Norm

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Jinshan Qi ◽  
Xun Liang ◽  
Rui Xu
Keyword(s):  
Multiple Kernel Learning ◽  
Research Society ◽  
Kernel Functions ◽  
Support Vector ◽  
Kernel Weights ◽  
Multiple Kernel ◽  
Vector Machines ◽  
Norm Constraint ◽  
Special Case ◽  
Elastic Constraint

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.

scholarly journals Evaluating Grayware Characteristics and Risks

2011 ◽  
Vol 2011 ◽  
pp. 1-28 ◽  
Author(s):  
Zhongqiang Chen ◽  
Zhanyan Liang ◽  
Yuan Zhang ◽  
Zhongrong Chen
Keyword(s):  
Information Gain ◽  
Feature Space ◽  
Training Data ◽  
Support Vector ◽  
Learning Models ◽  
Generalization Capability ◽  
Self Organizing Maps ◽  
Defense Strategies ◽  
Security Applications ◽  
Vector Machines

Grayware encyclopedias collect known species to provide information for incident analysis, however, the lack of categorization and generalization capability renders them ineffective in the development of defense strategies against clustered strains. A grayware categorization framework is therefore proposed here to not only classify grayware according to diverse taxonomic features but also facilitate evaluations on grayware risk to cyberspace. Armed with Support Vector Machines, the framework builds learning models based on training data extracted automatically from grayware encyclopedias and visualizes categorization results with Self-Organizing Maps. The features used in learning models are selected with information gain and the high dimensionality of feature space is reduced by word stemming and stopword removal process. The grayware categorizations on diversified features reveal that grayware typically attempts to improve its penetration rate by resorting to multiple installation mechanisms and reduced code footprints. The framework also shows that grayware evades detection by attacking victims' security applications and resists being removed by enhancing its clotting capability with infected hosts. Our analysis further points out that species in categoriesSpywareandAdwarecontinue to dominate the grayware landscape and impose extremely critical threats to the Internet ecosystem.

Sign in / Sign up

Export Citation Format

Share Document