ADAPTIVE CHEBYSHEV FUSION OF VEGETATION IMAGERY BASED ON SVM CLASSIFIER

2016 ◽  
Vol 78 (6-11) ◽  
Author(s):  
Zaid Omar ◽  
Nur’Aqilah Hamzah ◽  
Tania Stathaki

A novel adaptive image fusion method by using Chebyshev polynomial analysis (CPA), for applications in vegetation satellite imagery, is introduced in this paper. Fusion is a technique that enables the merging of two satellite cameras: panchromatic and multi-spectral, to produce higher quality satellite images to address agricurtural and vegetation issues such as soiling, floods and crop harvesting. Recent studies show Chebyshev polynomials to be effective in image fusion mainly in medium to high noise conditions, as per real-life satellite conditions. However, its application was limited to heuristics. In this research, we have proposed a way to adaptively select the optimal CPA parameters according to user specifications. Support vector machines (SVM) is used as a classifying tool to estimate the noise parameters, from which the appropriate CPA degree is utilised to perform image fusion according to a look-up table. Performance evaluation affirms the approach’s ability in reducing the computational complexity to perform fusion. Overall, adaptive CPA fusion is able to optimize an image fusion system’s resources and processing time. It therefore may be suitably incorporated onto real hardware for use on vegetation satellite imagery.    

Author(s):  
Hesham M. Al-Ammal

Detection of anomalies in a given data set is a vital step in several applications in cybersecurity; including intrusion detection, fraud, and social network analysis. Many of these techniques detect anomalies by examining graph-based data. Analyzing graphs makes it possible to capture relationships, communities, as well as anomalies. The advantage of using graphs is that many real-life situations can be easily modeled by a graph that captures their structure and inter-dependencies. Although anomaly detection in graphs dates back to the 1990s, recent advances in research utilized machine learning methods for anomaly detection over graphs. This chapter will concentrate on static graphs (both labeled and unlabeled), and the chapter summarizes some of these recent studies in machine learning for anomaly detection in graphs. This includes methods such as support vector machines, neural networks, generative neural networks, and deep learning methods. The chapter will reflect the success and challenges of using these methods in the context of graph-based anomaly detection.


2020 ◽  
Vol 9 (9) ◽  
pp. 533 ◽  
Author(s):  
Ricardo Afonso ◽  
André Neves ◽  
Carlos Viegas Damásio ◽  
João Moura Pires ◽  
Fernando Birra ◽  
...  

Every year, wildfires strike the Portuguese territory and are a concern for public entities and the population. To prevent a wildfire progression and minimize its impact, Fuel Management Zones (FMZs) have been stipulated, by law, around buildings, settlements, along national roads, and other infrastructures. FMZs require monitoring of the vegetation condition to promptly proceed with the maintenance and cleaning of these zones. To improve FMZ monitoring, this paper proposes the use of satellite images, such as the Sentinel-1 and Sentinel-2, along with vegetation indices and extracted temporal characteristics (max, min, mean and standard deviation) associated with the vegetation within and outside the FMZs and to determine if they were treated. These characteristics feed machine-learning algorithms, such as XGBoost, Support Vector Machines, K-nearest neighbors and Random Forest. The results show that it is possible to detect an intervention in an FMZ with high accuracy, namely with an F1-score ranging from 90% up to 94% and a Kappa ranging from 0.80 up to 0.89.


2003 ◽  
Vol 15 (7) ◽  
pp. 1667-1689 ◽  
Author(s):  
S. Sathiya Keerthi ◽  
Chih-Jen Lin

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.


2011 ◽  
Vol 20 (03) ◽  
pp. 563-575 ◽  
Author(s):  
MEI LING HUANG ◽  
YUNG HSIANG HUNG ◽  
EN JU LIN

Support Vector Machines (SVMs) are based on the concept of decision planes that define decision boundaries, and Least Squares Support Vector (LS-SVM) Machine is the reformulation of the principles of SVM. In this study a diagnosis on a BUPA liver disorders dataset, is conducted LS-SVM with the Taguchi method. The BUPA Liver Disorders dataset includes 345 samples with 6 features and 2 class labels. The system approach has two stages. In the first stage, in order to effectively determine the parameters of the kernel function, the Taguchi method is used to obtain better parameter settings. In the second stage, diagnosis of the BUPA liver disorders dataset is conducted using the LS-SVM classifier; the classification accuracy is 95.07%; the AROC is 99.12%. Compared with the results of related research, our proposed system is both effective and reliable.


2010 ◽  
Vol 08 (01) ◽  
pp. 39-57 ◽  
Author(s):  
REZWAN AHMED ◽  
HUZEFA RANGWALA ◽  
GEORGE KARYPIS

Alpha-helical transmembrane proteins mediate many key biological processes and represent 20%–30% of all genes in many organisms. Due to the difficulties in experimentally determining their high-resolution 3D structure, computational methods to predict the location and orientation of transmembrane helix segments using sequence information are essential. We present TOPTMH, a new transmembrane helix topology prediction method that combines support vector machines, hidden Markov models, and a widely used rule-based scheme. The contribution of this work is the development of a prediction approach that first uses a binary SVM classifier to predict the helix residues and then it employs a pair of HMM models that incorporate the SVM predictions and hydropathy-based features to identify the entire transmembrane helix segments by capturing the structural characteristics of these proteins. TOPTMH outperforms state-of-the-art prediction methods and achieves the best performance on an independent static benchmark.


2012 ◽  
Vol 2012 ◽  
pp. 1-7 ◽  
Author(s):  
Hao Jiang ◽  
Wai-Ki Ching

High dimensional bioinformatics data sets provide an excellent and challenging research problem in machine learning area. In particular, DNA microarrays generated gene expression data are of high dimension with significant level of noise. Supervised kernel learning with an SVM classifier was successfully applied in biomedical diagnosis such as discriminating different kinds of tumor tissues. Correlation Kernel has been recently applied to classification problems with Support Vector Machines (SVMs). In this paper, we develop a novel and parsimonious positive semidefinite kernel. The proposed kernel is shown experimentally to have better performance when compared to the usual correlation kernel. In addition, we propose a new kernel based on the correlation matrix incorporating techniques dealing with indefinite kernel. The resulting kernel is shown to be positive semidefinite and it exhibits superior performance to the two kernels mentioned above. We then apply the proposed method to some cancer data in discriminating different tumor tissues, providing information for diagnosis of diseases. Numerical experiments indicate that our method outperforms the existing methods such as the decision tree method and KNN method.


2013 ◽  
Vol 333-335 ◽  
pp. 1080-1084
Author(s):  
Zhang Fei ◽  
Ye Xi

In this paper, we will propose a novel classification method of high-resolution SAR using local autocorrelation and Support Vector Machines (SVM) classifier. The commonly applied spatial autocorrelation indexes, called Moran's Index; Geary's Index, Getis's Index, will be used to depict the feature of the land-cover. Then, the SVM based on these indexes will be applied as the high-resolution SAR classifier. A Cosmo-SkyMed scene in ChengDu city, China is used for our experiment. It is shown that the method proposed can lead to good classification accuracy.


2015 ◽  
Vol 24 (03) ◽  
pp. 1550010 ◽  
Author(s):  
Yassine Ben Ayed

In this paper, we propose an alternative keyword spotting method relying on confidence measures and support vector machines. Confidence measures are computed from phone information provided by a Hidden Markov Model based speech recognizer. We use three kinds of techniques, i.e., arithmetic, geometric and harmonic means to compute a confidence measure for each word. The acceptance/rejection decision of a word is based on the confidence vector processed by the SVM classifier for which we propose a new Beta kernel. The performance of the proposed SVM classifier is compared with spotting methods based on some confidence means. Experimental results presented in this paper show that the proposed SVM classifier method improves the performances of the keyword spotting system.


Sign in / Sign up

Export Citation Format

Share Document