Soft urban water cover extraction using mixed training samples and Support Vector Machines

China has been facing serious land degradation and desertification in its north and northwest arid and semi-arid areas. Monitoring the dynamics of percentage vegetation cover (PVC) using remote sensing imagery in these areas has become critical. However, because these areas are large, remote, and sparsely populated, and also because of the existence of mixed pixels, there have been no accurate and cost-effective methods available for this purpose. Spectral unmixing methods are a good alternative as they do not need field data and are low cost. However, traditional linear spectral unmixing (LSU) methods lack the ability to capture the characteristics of spectral reflectance and scattering from endmembers and their interactions within mixed pixels. Moreover, existing nonlinear spectral unmixing methods, such as random forest (RF) and radial basis function neural network (RBFNN), are often costly because they require field measurements of PVC from a large number of training samples. In this study, a cost-effective approach to mapping PVC in arid and semi-arid areas was proposed. A method for selection and purification of endmembers mainly based on Landsat imagery was first presented. A probability-based spectral unmixing analysis (PBSUA) and a probability-based optimized k nearest-neighbors (PBOkNN) approach were then developed to improve the mapping of PVC in Duolun County in Inner Mongolia, China, using Landsat 8 images and field data from 920 sample plots. The proposed PBSUA and PBOkNN methods were further validated in terms of accuracy and cost-effectiveness by comparison with two LSU methods, with and without purification of endmembers, and two nonlinear approaches, RF and RBFNN. The cost-effectiveness was defined as the reciprocal of cost timing relative root mean square error (RRMSE). The results showed that (1) Probability-based spectral unmixing analysis (PBSUA) was most cost-effective and increased the cost-effectiveness by 29.3% 29.3%, 33.5%, 50.8%, and 53.0% compared with two LSU methods, PBOkNN, RF, and RBFNN, respectively; (2) PBSUA, RF, and RBFNN gave RRMSE values of 22.9%, 21.8%, and 22.8%, respectively, which were not significantly different from each other at the significance level of 0.05. Compatibly, PBOkNN and LSU methods with and without purification of endmembers resulted in significantly greater RRMSE values of 27.5%, 32.4%, and 43.3%, respectively; (3) the average estimates of the sample plots and predicted maps from PBSUA, PBOkNN, RF, and RBFNN fell in the confidence interval of the test plot data, but those from two LSU methods did not, although the LSU with purification of endmembers improved the PVC estimation accuracy by 25.2% compared with the LSU without purification of endmembers. Thus, this study indicated that the proposed PBSUA had great potential for cost-effectively mapping PVC in arid and semi-arid areas.

Support vector machine (SVM) and artificial neural network (ANN) systems were applied to a drug/nondrug classification problem as an example of binary decision problems in early-phase virtual compound filtering and screening. The results indicate that solutions obtained by SVM training seem to be more robust with a smaller standard error compared to ANN training. Generally, the SVM classifier yielded slightly higher prediction accuracy than ANN, irrespective of the type of descriptors used for molecule encoding, the size of the training data sets, and the algorithm employed for neural network training. The performance was compared using various different descriptor sets and descriptor combinations based on the 120 standard Ghose-Crippen fragment descriptors, a wide range of 180 different properties and physicochemical descriptors from the Molecular Operating Environment (MOE) package, and 225 topological pharmacophore (CATS) descriptors. For the complete set of 525 descriptors cross-validated classification by SVM yielded 82% correct predictions (Matthews cc = 0.63), whereas ANN reached 80% correct predictions (Matthews cc = 0.58). Although SVM outperformed the ANN classifiers with regard to overall prediction accuracy, both methods were shown to complement each other, as the sets of true positives, false positives (overprediction), true negatives, and false negatives (underprediction) produced by the two classifiers were not identical. The theory of SVM and ANN training is briefly reviewed.

Support vector machine is a new and promising technique for pattern classification and regression estimation. The training of support vector machine is characterized by convex optimization problem, up to the determination of a few additional tuning parameters. Moreover, the model complexity follows from this convex optimization problem. In this paper we introduce sequential support vector machine for regression estimation. The support vector machine is trained by the particle filter. By the method of training support vector machine we can design the controller based on support vector machine. Afterwards we discuss feedforward control based on support vector machine. Support vector machine builds the inverse model of plant in the feedforward control based on support vector machine. In order to demonstrate the availability of this new controller designing method, we give a simulation of the simple nonlinear system for output tracking problem. The results of simulation demonstrate this method of new controller designing is very effective.

The Support Vector Machine (SVM) is an effective classification tool. Though extremely effective, SVMs are not a panacea. SVM training and testing is computationally expensive. Also, tuning the kernel parameters is a complicated procedure. On the other hand, the Nearest Neighbor (KNN) classifier is computationally efficient. In order to achieve the classification efficiency of an SVM and the computational efficiency of a KNN classifier, it has been shown previously that, rather than training a single global SVM, a separate SVM can be trained for the neighbourhood of each query point. In this work, we have extended this Local SVM (LSVM) formulation. Our Local Adaptive SVM (LASVM) formulation trains a local SVM in a modified neighborhood space of a query point. The main contributions of the paper are twofold: First, we present a novel LASVM algorithm to train a local SVM. Second, we discuss in detail the motivations behind the LSVM and LASVM formulations and its possible impacts on tuning the kernel parameters of an SVM. We found that training an SVM in a local adaptive neighborhood can result in significant classification performance gain. Experiments have been conducted on a selection of the UCIML, face, object, and digit databases.

I335 the training of Support Vector Machine (SVM) classification model, some problems such as over-fitting, under-fitting, slow training speed and prediction affected by penalty and kernel function parameters are exposed. A fault classification method of rolling bearing based on Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) and Grey Wolf Optimization (GWO) -SVM is proposed. Firstly, the acquire signals are adaptively decomposed into a plurality of Intrinsic Mode Function(IMF) component by CEEMDAN, and the energy entropy of each IMF component is extracted to form a set of high dimensional feature vector. Then, the processed feature vectors are introduced into the diagnosis network of GWO-SVM algorithm to build a fault classification model of motor rolling bearing. The classification results show that the CEEMDAN and GWO-SVM fault classification network of motor rolling bearing has higher accuracy and shorter diagnosis time than Particle Swarm Optimization (PSO) -SVM and Cross Validation (CV) -SVM.

This paper presents an optimized support vector machine (SVM) training processor employing the alternative direction method of multipliers (ADMM) optimizer. Low-rank approximation is exploited to reduce the dimension of the kernel matrix by employing the Nyström method. Verified in four datasets, the proposed ADMM-based training processor with rank approximation reduces 32× of matrix dimension with only 2% drop in inference accuracy. Compared to the conventional sequential minimal optimization (SMO) algorithm, the ADMM-based training algorithm is able to achieve a 9.8×10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">7</sup> shorter latency for training 2048 samples. Hardware optimization techniques, including pre-computation and memory sharing, are proposed to reduce the computational complexity by 62% and the memory usage by 60%. As a proof of concept, an epileptic seizure detector is designed to demonstrate the effectiveness of the proposed optimization techniques. The chip achieves a 153,310× higher energy efficiency and a 364× higher throughput-to-area ratio for SVM training than a high-end CPU. This work provides a promising solution for edge devices which require low-power and real-time training.

This paper proposes a fuzzy rule extraction method from support vector machines. Support vector machines (SVM) are learning systems based on statistical learning theory that have been successfully applied to a wide variety of application. However, SVM are "black box" models, that is, they generate a solution with linear combination of kernel functions which has a quite difficult interpretation. Methods for rule extraction from trained SVM have already been proposed, however, the rules generated by these methods have, in their antecedents, intervals or functions. This format decreases the interpretability of the generated rules and jeopardizes the knowledge extraction capability. Hence, to increase the linguistic interpretability of the generated rules, we propose in this paper a methodology for extracting fuzzy rules from a trained SVM, where the rule's antecedents are associated with fuzzy sets.

Hybrid computational models for the characterization of oil and gas reservoirs

An improved image segmentation algorithm based on support vector machines was proposed, which belonged to hybrid segmentation techniques. Considering image segmentation based on support vector machines required the user to provide the training data, an automatic data providing method was proposed to obtain training data used by support vector machines instead of directly taking some pieces of the image by user. In the improved algorithm, feature vectors of homogeneous region were firstly classified using unsupervised classification technique, and then feature vectors and class labels were fed into support vector machines for training and latter for predicting the labels of unknown samples once the training was complete. The experiments show that the proposed algorithm is efficient for both smooth image segmentation and texture image segmentation. Meanwhile, the classified model trained using one representative image can be applied to the set of similar images and 3D volume data.

The monitoring of urban cover is very important for the planner, management, governmental and non-governmental organizations for optimizing the use of urban resources and minimizing the environmental losses. The study here aims at analyzing the changes that occurred in urban green cover over a time span of 1991-2001 using multi-date Landsat satellite images data over the Varanasi district, India and its relation to demographical changes. The Support Vector Machines (SVMs) classifier has been used for image classification. The urbanization indicators such as Land Consumption Ratio (LCR) and Land Absorption Coefficient (LAC) were also used in order to understand the changes in urban cover and population dynamics. All the analysis indicates significant changes in the urban cover values with increasing population at both spatial and temporal scale.

This paper proposes to use border training patterns in order to improve Support Vector Machine (SVM) classification accuracy of hyperspectral images. In the proposed approach, border training patterns which are close to the separating hyperplane, are obtained in two consecutive steps and considered as final training set. In the first step, clustering is performed to the full initial training data of each class. Then, cluster centers of each class are taken as the reduced size training data and forwarded to the second step. In the second step, this reduced size training data is used in the training of SVM and cluster centers which are obtained as support vectors at this step are regarded to be located close to the hyperplane border. Finally, cluster centers which are found as support vectors and original training samples contained in these clusters only are assigned as border training patterns. Experimental results are presented to show that the proposed approach improves SVM classification accuracy.

In this paper, we have proposed an improved & logistic digital watermarking scheme, which collected based on Support Vector Machine (SVM) for color image. The watermark is implanted into the discrete wavelet domain of the original image and extracted by training support vector machine, which have the element of the image. For performance enhancement of support vector machine, we consider the adding of momentum coefficient to reduce the error and enhance the rate of the learning. The watermark can be successfully extracted by training the support vector machine, and the (SVM) watermarking algorithm is good for many kinds of common attacks. The experimental results reveal that the proposed algorithm can achieve the desired result and high corpulence to general image processing technique & geometric distortion.

This paper presents a novel feature selection method which is named filtered and supported sequential forward search (FS/spl I.bar/SFS) in the context of support vector machines (SVM). In comparison with conventional wrapper methods employing the sequential forward search (SFS) strategy, it has two important properties that reduce the computation time of SVM training during the feature selection process. First, instead of utilizing all the training samples to obtain the classifier, FS/spl I.bar/SFS, by taking advantage of the existence of support vectors in SVM, dynamically maintains an active data set for each SVM to be trained on. In this way, the computational demand of a single SVM training decreases. Secondly, a new criterion, in which the discriminant ability of individual features and the correlation between them are both taken into consideration, is proposed to effectively filter out non-essential features before every SFS iteration begins. As a result, the total amount of training is significantly reduced. The proposed approach is tested on both synthetic and real data to demonstrate its effectiveness and efficiency.

In conventional distributed machine learning methods, distributed support vector machines (SVM) algorithms are trained over pre-configured intranet/internet environments to find out an optimal classifier. These methods are very complicated and costly for large datasets. Hence, we propose a method that is referred as the Cloud SVM training mechanism (CloudSVM) in a cloud computing environment with MapReduce technique for distributed machine learning applications. Accordingly, (i) SVM algorithm is trained in distributed cloud storage servers that work concurrently; (ii) merge all support vectors in every trained cloud node; and (iii) iterate these two steps until the SVM converges to the optimal classifier function. Single computer is incapable to train SVM algorithm with large scale data sets. The results of this study are important for training of large scale data sets for machine learning applications. We provided that iterative training of splitted data set in cloud computing environment using SVM will converge to a global optimal classifier in finite iteration size.

Human thermal comfort is influenced by psychological as well as physiological factors. Several comfort indices, such as PMV, PPD, TSENS, ET*, DISC, and SET* (see nomenclature) have been developed. These indices attempt to correlate human thermal comfort with environmental conditions. This paper describes the use of a learning algorithm “support vector machine (SVM) learning” for prediction of the thermal comfort indices. The SVM is an artificial intelligent approach that can capture the input/output mapping from the given data. Support vector machines were developed based on the Structural Risk Minimization principle. Different sets of representative experimental environmental factors that affect a homogenous person’s thermal balance were used for training the SVM algorithm. The results demonstrate good correlation between SVM predicted values and those obtained from conventional thermal comfort, such as Fanger Model and “2-Node” model. The “trained SVM” with representative data could be easily and more effectively used to predict the indices compared to other conventional estimation methods.