Sketched symbol recognition using Zernike moments

This study investigated the effect of a new approach, the support vector machine, as a classifier tool to identify the weeds in corn fields at early growth stage. Image segmentation was done by transforming original color images to gray level images according to the statistical values of red, green, blue components. The Gray Level Co-occurrence Matrix (GLCM) and statistical properties of the histogram from the gray level images were further used to obtain the texture features of the weeds and corn seedlings. These texture features were used in the classification procedure. Principle component analysis was used to select the texture features according to their better contributions to reduce space dimensions. A Support Vector Machine (SVM) classifier was employed to recognize the weeds and the corn seedlings. The results indicated that the SVM classifiers with different feature selections could identify successfully weed-corn with a higher accuracy ranged from 92.31 to 100%. A comparison study of the recognition capabilities of SVM and back-propagation (BP) neural-network classifier using the same data set was conducted. It was found that the SVM classifier provided the best recognition performance with an accuracy of 100%, which exceeded the accuracy of 80% given by the BP classifier. Key words: Corn seedling, weeds, texture, support vector machine, recognize.

The problem with development of the support vector machine (SVM) classifiers using modified particle swarm optimization (PSO) algorithm and their ensembles has been considered. Solving this problem would allow fulfilling the high-precision data classification, especially Big Data classification, with the acceptable time expenditures. The modified PSO algorithm conducts a simultaneous search of the type of kernel functions, the parameters of the kernel function and the value of the regularization parameter for the SVM classifier. The idea of particles' «regeneration» served as the basis for the modified PSO algorithm. In the implementation of this algorithm, some particles change the type of their kernel function to the one which corresponds to the particle with the best value of the classification accuracy. The offered PSO algorithm allows reducing the time expenditures for the developed SVM classifiers, which is very important for Big Data classification problem. In most cases such SVM classifier provides the high quality of data classification. In exceptional cases the SVM ensembles based on the decorrelation maximization algorithm for the different strategies of the decision-making on the data classification and the majority vote rule can be used. Also, the two-level SVM classifier has been offered. This classifier works as the group of the SVM classifiers at the first level and as the SVM classifier on the base of the modified PSO algorithm at the second level. The results of experimental studies confirm the efficiency of the offered approaches for Big Data classification.

Shape descriptors and mapping methods for full-field comparison of experimental to simulation data

Cancer survival classification using integrated data sets and intermediate information.

In order to improve the performance of Support Vector Machine (SVM) classifier for imbalanced data, this paper proposes dynamic cost-sensitive SVM classifier based on chaos particle swarm optimization (CPDC_SVM). Firstly, this paper introduces dynamic cost-sensitive thought to SVM classifier, and gives the method for structuring dynamic cost and cost-sensitive SVM model. Secondly, we propose the evaluation methodology performance for classifier, and adopts decimal base to code the particles. At last, chaos thought is introduced in particle swarm optimization algorithm, and the Algorithm of the dynamic cost-sensitive SVM classifier is given, which improves convergent speed and accuracy of particle swarm optimization, and can optimize dynamic cost-sensitive SVM well, so CPDC_SVM adds effectively the convergence speed and accuracy for the particle swarm optimization algorithm. Experimental results show CPDC_SVM has higher precision than traditional SVM classifier, and dynamic cost and chaos particle swarm optimization can improve the performance for classifier.

Communication is the ultimate of man’s search for conveying his ideas, emotions, and concepts. Dance is one of the media of communication through which dancers share notion of feelings, with the spectators through gestures, i.e., mudra. Gesture recognition propagates a concept without verbal speech or listening, and in dance recognition, the notion is transferred through various dance poses and actions. This activity in a way really paves way to enhance Indian Sign Language. This study focuses to solve the mudra resemblance in Bharatanatyam through a new system developed with image processing and classification technique using histogram of oriented gradient (HOG) feature extraction techniques and support vector machine (SVM) classifier. SVM classifies the features of HOG into mudras as text labels. Popular feature vectors such as scale-invariant feature transform (SIFT), speed up robust feature (SURF), and local binary pattern (LBP) are hardened against HOG for accuracy and speediness, and this innovative proposed concept is useful for online dance learners.

We perceive the digital watermark detection as classification problem in image processing. We classify watermarked images as positive class whilst unwatermarked images as negative class. Support Vector Machine (SVM) is used as classifier of the watermarked and unwatermarked digital images. Two watermarking schemes i.e. Cox's spread spectrum (SS) and Single Value Decomposition (SVD) are used to embed watermark into digital images. These algorithms are selected based on their different level of robustness to Stirmark attacks. The payload of the watermark used for both algorithms is consistent at certain number of bits. SVM is trained with both the watermarked and unwatermarked images. Receiver Operating Characteristics (ROC) graphs are plotted to assess the statistical detection behavior of both the correlation detector and SVM classifier. We found that straight forward application of SVM leads to generalization problem. We suggest remedies to preprocess the training data in order to achieve substantially better performance from SVM classifier than those resulting from the straightforward application of SVM. Both watermarked and unwatermarked images are attacked under Stirmark and are then tested with the correlation detectors and SVM classifier. A comparison of the ROC of the correlation detectors and SVM classifier is performed to assess the accuracy of SVM classifier relative to correlation detectors. We found that SVM classifier has higher robustness to Stirmark attacks.

BackgroundThis study aimed to screen the feature modules and characteristic genes related to ulcerative colitis (UC) and construct a support vector machine (SVM) classifier to distinguish UC patients.MethodsFour datasets that contained UC and control samples were obtained from the Gene Expression Omnibus database. Differentially expressed genes (DEGs) with consistency were screened via the MetaDE method. The weighted gene coexpression network (WGCNA) was used to distinguish significant modules based on the four datasets. The protein–protein interaction network was established based on intersection genes. Enrichment analysis of Gene Ontology (GO) biological processes (BPs) and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway enrichment were established based on DAVID. An SVM combined with recursive feature elimination was also applied to construct a disease classifier for the disease diagnosis of UC patients. The efficacy of the SVM classifier was evaluated through receiver operating characteristic curves.ResultsTwelve highly preserved modules were obtained using the WGCNA, and 2009 DEGs with significant consistency were selected using the MetaDE method. Sixteen significantly related GO BPs and 12 KEGG pathways were obtained, such as cytokine-cytokine receptor interaction, cell adhesion molecules, and leukocyte transendothelial migration. Subsequently, 41 genes were used to construct an SVM classifier, such as CXCL1, CCR2, IL1B, and IL1A. The area under the curve (AUC) was 0.999 in the training dataset, whereas the AUC was 0.886, 0.790, and 0.819 in the validation set (GSE65114, GSE37283, and GSE36807, respectively).ConclusionsAn SVM classifier based on feature genes might correctly identify healthy people or UC patients.

Landsat-like moderate resolution remote sensing images are widely used in land use and land cover (LULC) classification. Limited by coarser resolutions, most of the traditional LULC classifications that are based on moderate resolution remote sensing images focus on the spectral features of a single pixel. Inspired by the spatial evaluation methods in landscape ecology, this study proposed a new method to extract neighborhood characteristics around a pixel for moderate resolution images. 3 landscape-metric-like indexes, i.e., mean index, standard deviation index, and distance weighted value index, were defined as adjacent region features to include the surrounding environmental characteristics. The effects of the adjacent region features and the different feature set configurations on improving the LULC classification were evaluated by a series of well-controlled LULC classification experiments using K nearest neighbor (KNN) and support vector machine (SVM) classifiers on a Landsat 8 Operational Land Imager (OLI) image. When the adjacent region features were added, the overall accuracies of both the classifiers were higher than when only spectral features were used. For the KNN and SVM classifiers that used only spectral features, the overall accuracies of the LULC classification were 85.45% and 88.87%, respectively, and the accuracies were improved to 94.52% and 96.97%. The classification accuracies of all the LULC types improved. Highly heterogeneous LULC types that are easily misclassified achieved greater improvements. As comparisons, the grey-level co-occurrence matrix (GLCM) and convolutional neural network (CNN) approaches were also implemented on the same dataset. The results revealed that the new method outperformed GLCM and CNN approaches and can significantly improve the classification performance that is based on moderate resolution data.

Bond rating is regarded as an important event for measuring financial risk of companies and for determining the investment returns of investors. As a result, it has been a popular research topic for researchers to predict companies' credit ratings by applying statistical and machine learning techniques. The statistical techniques, including multiple regression, multiple discriminant analysis (MDA), logistic models (LOGIT), and probit analysis, have been traditionally used in bond rating. However, one major drawback is that it should be based on strict assumptions. Such strict assumptions include linearity, normality, independence among predictor variables and pre-existing functional forms relating the criterion variablesand the predictor variables. Those strict assumptions of traditional statistics have limited their application to the real world. Machine learning techniques also used in bond rating prediction models include decision trees (DT), neural networks (NN), and Support Vector Machine (SVM). Especially, SVM is recognized as a new and promising classification and regression analysis method. SVM learns a separating hyperplane that can maximize the margin between two categories. SVM is simple enough to be analyzed mathematical, and leads to high performance in practical applications. SVM implements the structuralrisk minimization principle and searches to minimize an upper bound of the generalization error. In addition, the solution of SVM may be a global optimum and thus, overfitting is unlikely to occur with SVM. In addition, SVM does not require too many data sample for training since it builds prediction models by only using some representative sample near the boundaries called support vectors. A number of experimental researches have indicated that SVM has been successfully applied in a variety of pattern recognition fields. However, there are three major drawbacks that can be potential causes for degrading SVM's performance. First, SVM is originally proposed for solving binary-class classification problems. Methods for combining SVMs for multi-class classification such as One-Against-One, One-Against-All have been proposed, but they do not improve the performance in multi-class classification problem as much as SVM for binary-class classification. Second, approximation algorithms (e.g. decomposition methods, sequential minimal optimization algorithm) could be used for effective multi-class computation to reduce computation time, but it could deteriorate classification performance. Third, the difficulty in multi-class prediction problems is in data imbalance problem that can occur when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. SVM ensemble learning is one of machine learning methods to cope with the above drawbacks. Ensemble learning is a method for improving the performance of classification and prediction algorithms. AdaBoost is one of the widely used ensemble learning techniques. It constructs a composite classifier by sequentially training classifiers while increasing weight on the misclassified observations through iterations. The observations that are incorrectly predicted by previous classifiers are chosen more often than examples that are correctly predicted. Thus Boosting attempts to produce new classifiers that are better able to predict examples for which the current ensemble's performance is poor. In this way, it can reinforce the training of the misclassified observations of the minority class. This paper proposes a multiclass Geometric Mean-based Boosting (MGM-Boost) to resolve multiclass prediction problem. Since MGM-Boost introduces the notion of geometric mean into AdaBoost, it can perform learning process considering the geometric mean-based accuracy and errors of multiclass. This study applies MGM-Boost to the real-world bond rating case for Korean companies to examine the feasibility of MGM-Boost. 10-fold cross validations for threetimes with different random seeds are performed in order to ensure that the comparison among three different classifiers does not happen by chance. For each of 10-fold cross validation, the entire data set is first partitioned into tenequal-sized sets, and then each set is in turn used as the test set while the classifier trains on the other nine sets. That is, cross-validated folds have been tested independently of each algorithm. Through these steps, we have obtained the results for classifiers on each of the 30 experiments. In the comparison of arithmetic mean-based prediction accuracy between individual classifiers, MGM-Boost (52.95%) shows higher prediction accuracy than both AdaBoost (51.69%) and SVM (49.47%). MGM-Boost (28.12%) also shows the higher prediction accuracy than AdaBoost (24.65%) and SVM (15.42%)in terms of geometric mean-based prediction accuracy. T-test is used to examine whether the performance of each classifiers for 30 folds is significantly different. The results indicate that performance of MGM-Boost is significantly different from AdaBoost and SVM classifiers at 1% level. These results mean that MGM-Boost can provide robust and stable solutions to multi-classproblems such as bond rating.

Abstract:Bankruptcy prediction and credit scoring are the two important problems facing financial decision support. The multilayer perceptron (MLP) network has shown its applicability to these problems and its performance is usually superior to those of other traditional statistical models. Support vector machines (SVMs) are the core machine learning techniques and have been used to compare with MLP as the benchmark. However, the performance of SVMs is not fully understood in the literature because an insufficient number of data sets is considered and different kernel functions are used to train the SVMs. In this paper, four public data sets are used. In particular, three different sizes of training and testing data in each of the four data sets are considered (i.e. 3:7, 1:1 and 7:3) in order to examine and fully understand the performance of SVMs. For SVM model construction, the linear, radial basis function and polynomial kernel functions are used to construct the SVMs. Using MLP as the benchmark, the SVM classifier only performs better in one of the four data sets. On the other hand, the prediction results of the MLP and SVM classifiers are not significantly different for the three different sizes of training and testing data.

An improved SVM classifier based on double chains quantum genetic algorithm and its application in analogue circuit diagnosis

e14528 Background: Treatment monitoring in patients with High-Grade Glioma (HGG) and identification of disease progression, remains a major challenge in clinical neurooncology. We aimed to develop a support vector machine (SVM) classifier utilising combined longitudinal conventional and Dynamic Susceptibility Contrast (DSC) perfusion MRI to classify between Stable Disease (SD), Pseudoprogression (PsP) and Progressive Disease (PD) in glioma patients under surveillance. Methods: Conventional (269) and perfusion (62) MRI studies of HGG patients acquired between 2012 and 2018 were prospectively analysed. Study participants were separated into two groups: Group I with a single DSC time point (64 participants) and Group II with multiple DSC time points (19 participants). The SVM classifier was trained using all available MRI for each group. Classification accuracy was assessed for the use of features extracted from different feature dataset and time point combinations and compared to the experienced radiologists’ predictions. Results: The study included 64 participants (mean age: 48.5 ± 12.8 yrs [standard deviation], 24 female). SVM classification based on combined perfusion and structural features outperformed standalone datasets across all groups. For the clinically relevant classification step (SD/PSP vs PD), both feature combination as well as the addition of multiple DSC time points, improved classification performance (lowest median error rate: 0.016). The SVM algorithm outperformed radiologists in predicting lesion destiny in both groups. Optimal performance was observed in Group II, in which SVM sensitivity/specificity/accuracy was 100/91.67/94.7% for analysis based on the first time point and 85.71/100/ 94.7% based on multiple time points compared to 60/78/68% and 70/90/84.2% for the respective radiologist classifications. In Group I, the SVM also exceeded radiologist predictions, albeit by a smaller margin and resulted in sensitivity/specificity of 86.49/75.00/81.53% (SVM) compared to 75.7/68.9/73.84% (radiologists). Conclusions: Our results indicate that the addition of multiple longitudinal perfusion time points as well as the combination of structural and perfusion features significantly enhance classification outcome in treatment monitoring of HGGs and machine-learning-assisted diagnosis has potentially superior accuracy than the radiologist's visual evaluation and expertise.

PurposeCurrent practices in data classification and retrieval have experienced a surge in the use of multimedia content. Identification of desired information from the huge image databases has been facing increased complexities for designing an efficient feature extraction process. Conventional approaches of image classification with text-based image annotation have faced assorted limitations due to erroneous interpretation of vocabulary and huge time consumption involved due to manual annotation. Content-based image recognition has emerged as an alternative to combat the aforesaid limitations. However, exploring rich feature content in an image with a single technique has lesser probability of extract meaningful signatures compared to multi-technique feature extraction. Therefore, the purpose of this paper is to explore the possibilities of enhanced content-based image recognition by fusion of classification decision obtained using diverse feature extraction techniques.Design/methodology/approachThree novel techniques of feature extraction have been introduced in this paper and have been tested with four different classifiers individually. The four classifiers used for performance testing were K nearest neighbor (KNN) classifier, RIDOR classifier, artificial neural network classifier and support vector machine classifier. Thereafter, classification decisions obtained using KNN classifier for different feature extraction techniques have been integrated by Z-score normalization and feature scaling to create fusion-based framework of image recognition. It has been followed by the introduction of a fusion-based retrieval model to validate the retrieval performance with classified query. Earlier works on content-based image identification have adopted fusion-based approach. However, to the best of the authors’ knowledge, fusion-based query classification has been addressed for the first time as a precursor of retrieval in this work.FindingsThe proposed fusion techniques have successfully outclassed the state-of-the-art techniques in classification and retrieval performances. Four public data sets, namely, Wang data set, Oliva and Torralba (OT-scene) data set, Corel data set and Caltech data set comprising of 22,615 images on the whole are used for the evaluation purpose.Originality/valueTo the best of the authors’ knowledge, fusion-based query classification has been addressed for the first time as a precursor of retrieval in this work. The novel idea of exploring rich image features by fusion of multiple feature extraction techniques has also encouraged further research on dimensionality reduction of feature vectors for enhanced classification results.

Using information technology such as search engine for collecting and monitoring of network public opinion is a practical and effective method. This paper puts forward an improved algorithm of SVM classifier based on incremental learning online, and then implements a topic crawler system for network public opinion and to grab the public opinion.