Image Processing Based Classification of Enzymatic Browning in Chopped Apples

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.

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.

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.

Cancer survival classification using integrated data sets and intermediate information.

Biomedical data are widely accepted in developing prediction models for identifying a specific tumour, drug discovery and human cancers detection. However, previous studies usually focused on different classifiers, and overlook the class imbalance problem in real-world biomedical datasets. This paper mainly focuses on reviewing and evaluating some popular and recently developed resampling and feature selection (FS) methods for class imbalance learning with data distribution being considered. Experimental results show that: 1) resampling and FS techniques exhibit better performance using support vector machine (SVM) classifier; 2) techniques such as random undersampling and FS perform better than other data pre-processing methods with T location-scale distribution when using SVM and K-nearest neighbours (KNN) classifiers. Random oversampling outperforms other methods on negative binomial distribution using Random Forest with lower level of imbalance ratio; 3) FS outperforms other data pre-processing methods in most cases, thus, FS with SVM classifier is the best choice for imbalanced biomedical data learning.

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.

Protein phosphorylation plays a potential role in regulating protein conformation and functions. As a result, identifying an uncharacterized protein sequence as a phosphorylated protein is a very meaningful problem and an urgent issue for both basic research and drug development. Although various types of computational methods have been developed to identify the phosphorylation sites for a recognized phosphorylated protein, very few computational methods have been developed to identify whether an uncharacterized protein can be phosphorylated or not. Therefore, there exists some scope for further improvement to characterize a protein as phosphorylated or not. Among all the residues of protein molecules, three types of amino acid residues, namely serine, threonine, and tyrosine, have been found to be susceptible to phosphorylation, which leads to the requirement of multi-label phosphorylated protein identification. Therefore, in this study, a novel computational tool termed iMulti-HumPhos has been developed to predict multi-label phosphorylated proteins by (1) extracting three different sets of features from protein sequences, (2) defining an individual kernel for each set of features and combining them into a single kernel using multiple kernel learning, and (3) constructing a multi-label predictor using a combination of support vector machines (SVMs) where each SVM has been trained with the combined kernel. In addition, we have balanced the effect of the skewed training dataset by the Different Error Costs method for the development of our system. The experimental results show that the iMulti-HumPhos predictor provides significantly better performance than the existing predictor Multi-iPPseEvo. A user-friendly web-server of iMulti-HumPhos is available at .

Probability distribution function-based classification of structural MRI for the detection of Alzheimer’s disease

Magnetic Resonance images are used to identify tears in the meniscus, a debilitating condition of the knee. In this paper, a two-staged computerized system for diagnosing meniscus tears is proposed. In the first stage, we apply an Active Contour with Level Sets model to calculate the location and shape of the meniscus area. In the second stage, 180 features, consisting of textural information in the spatial and spectral domains, were extracted from each suspected meniscus tear. Sequential floating forward selection (SFFS) was applied to select the relevant features. The feature vectors were then input to a support vector machine (SVM) classifier to detect meniscus tears. The Az value of the receiver operating characteristic (ROC) curve were used to evaluate the classification performance. Experimental results show that the dimension of the feature vector was reduced from 180 to 64 after the SFFS. Meanwhile, the SVM classifier combined with the SFFS feature selection (Az = 0.9123) outperformed the SVM classifier without feature selection (Az = 0.7273).

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.

Fast Laplacian twin support vector machine with active learning for pattern classification

Modeling the Various Merging Behaviors at Expressway On-Ramp Bottlenecks Using Support Vector Machine Models

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.

Automated accurate fire detection system using ensemble pretrained residual network

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