Contextual SVM for hyperspectral classification using Hilbert Space Embedding

Hyperspectral images belong to high-dimensional data having a lot of redundancy information when they are directly used to classification. Support vector machine (SVM) can be employed to map hyperspectral data to high dimensional space effectively and make them linearly separable. In this paper, spectral and spatial information of hyperspectral images were used to construct SVM kernel function respectively. This paper proposed a hyperspectral image classification method utilization spatial-spectral combined kernel SVM in order to improve classification accuracy. The proposed method was used to classify AVIRIS hyperspectral images. The results demonstrated that the proposed SVM method can achieve 96.13% overall accuracy for the single category classification and 84.81% overall accuracy for multi-class classification only using ten percent of the total samples as the training samples. That is to say, the proposed method can make full use of the spectral information and spatial information of hyperspectral data, and effectively distinguish different categories compared with the traditional SVM for classification.

The dynamic time warping (DTW) is state-of-the-art distance measure widely used in sequential pattern matching and it outperforms Euclidean distance in most cases because its matching is elastic and robust. It is tempting to substitute DTW distance for Euclidean distance in the Gaussian RBF kernel and plug it into the state-of-the art classifier support vector machines (SVMs) for sequence classification. However, it is not straightforward that DTW also outperforms Euclidean distance in kernel machines. While counter-examples can be found to numerically prove that DTW is not positive definite symmetric (PDS)acceptable by SVM, little is known why it can not be PDS theoretically. We analyze the DTW kernel and complete a theoretical proof via the connection between PDS kernel and reproducing kernel Hilbert space (RKHS). Our analysis leads to a better understanding that all Hilbertian metrics can be be converted to a PDS kernel in the Gaussian form, while the reverse is not true. The proof can be extended to conclude that elastic matching distance is not eligible to construct PDS kernels (e.g., Edit distance). Experiments were conducted to compare the RBF-kernel and DTW kernel in SVM classifications and the results show that simple Euclidean distance outperforms DTW in kernel machines.

Hyperspectral imaging is concerned with the measurement, analysis, and interpretation of spectra acquired from a given scene (or specific object) at a short, medium or long distance by an airbone or satellite sensor. Over the last few years, hyperspectral image data sets have been collected for a great amount of locations over the world, using a variety of instruments for Earth observation. Despite the increasing importance of hyperspectral images in remote sensing applications, there is no common repository of hyperspectral data intended to distribute and share hyperspectral data sets in the community. Quite opposite, the hyperspectral data sets which are available for public use are spread among different storage locations and present significant heterogeneity regarding the storage format, associated meta-data (if any), or ground-truth availability. As a result, the development of a standardized hyperspectral data repository is a highly desired goal in the remote sensing community. In this paper, we take a necessary first step towards the development of a digital repository for remotely sensed hyperspectral data. The proposed system allows uploading new hyperspectral data sets along with meta-data, ground-truth and analysis results, with the ultimate goal of sharing publicly available hyperspectral images within the remote sensing community. The database has been designed in order to allow storing relevant information for the hyperspectral data available through the system, including basic image characteristics (width, height, number of bands, format) and more advanced meta-data (ground-truth information, publications in which the data has been used). The current implementation consists of a front-end to ease the management of images through a web interface, thus containing both synthetic and real hyperspectral images from two highly representative instruments, such as NASAs Airborne Visible Infra-Red Imaging Spectrometer (AVIRIS) over the Cuprite Mining District in Nevada. Most importantly, the developed system includes a spectral unmixing-based content based image retrieval (CBIR) functionality which allows searching for images on the spectral unmixing information (spectrally pure components or endmembers and their associated abundances in the scene). This information is stored as meta-data associated to each hyperspectral image instance, and then used to search and retrieve images based on information content. This paper presents the design of the system and a preliminary validation of the unmixing-based retrieval functionality using both synthetic and real hyperspectral images stored in the database.

The performances of regular support vector machines and random forests are experimentally compared for hyperspectral imaging land cover classification. Special characteristics of hyperspectral imaging dataset present diverse processing problems to be resolved under robust mathematical formalisms such as image classification. As a result, pixel purity index algorithm is used to obtain endmember spectral responses from Indiana pine hyperspectral image dataset. The generalized reduced gradient optimization algorithm is thereafter executed on the research data to estimate fractional abundances in the hyperspectral image and thereby obtain the numeric values for land cover classification. The Waikato environment for knowledge analysis (WEKA) data mining framework is selected as a tool to carry out the classification process by using support vector machines and random forests classifiers. Results show that performance of support vector machines is comparable to that of random forests. This study makes a positive contribution to the problem of land cover classification by exploring generalized reduced gradient method, support vector machines, and random forests to improve producer accuracy and overall classification accuracy. The performance comparison of these classifiers is valuable for a decision maker to consider tradeoffs in method accuracy versus method complexity.

In this paper, a soft classification algorithm based on composite kernels, which incorporate both spectral and spatial information, is proposed for hyperspectral image. Compared with hard classification, soft classification provides more information about the probabilities one pixel belongs to each class. To calculate these probabilities, the proposed algorithm uses Support Vector Machine (SVM), and it successfully converts SVM output values into probabilities, while at the same time integrates spatial and spectral information by composite kernels. To validate the proposed algorithm, experiments are conducted on hyperspectral images with 126 and 186 bands, and experimental results show that soft classification using SVM can yield better results compared with Maximum Likelihood Classifier (MLC),and the introduction of spectral-spatial kernels can greatly improve classification accuracies.

To overcome the difficulty of automating and intelligently classifying the ground features in remote-sensing hyperspectral images, machine learning methods are gradually introduced into the process of remote-sensing imaging. First, the PaviaU, Botswana, and Cuprite hyperspectral datasets are selected as research subjects in this study, and the objective is to process remote-sensing hyperspectral images via machine learning to realize the automatic and intelligent classification of features. Then, the basic principles of the support vector machine (SVM) and extreme learning machine (ELM) classification algorithms are introduced, and they are applied to the datasets. Next, by adjusting the parameter estimates using a restricted Boltzmann machine (RBM), a new terrain classification model of hyperspectral images that is based on a deep belief network (DBN) is constructed. Next, the SVM, ELM, and DBN classification algorithms for hyperspectral image terrain classification are analysed and compared in terms of accuracy and consistency. The results demonstrate that the average detection accuracies of ELM on the three datasets are 89.54%, 96.14%, and 96.28%, and the Kappa coefficient values are 0.832, 0.963, and 0.924; the average detection accuracies of SVM are 88.90%, 92.11%, and 91.68%, and the Kappa coefficient values are 0.768, 0.913, and 0.944; the average detection accuracies of the DBN classification model are 92.36%, 97.31%, and 98.84%, and the Kappa coefficient values are 0.883, 0.944, and 0.972. The results also demonstrate that the classification accuracy of the DBN algorithm exceeds those of the previous two methods because it fully utilizes the spatial and spectral information of hyperspectral remote-sensing images. In summary, the DBN algorithm that is proposed in this study has high application value in object classification for remote-sensing hyperspectral images.

Wavelet SVM in Reproducing Kernel Hilbert Space for hyperspectral remote sensing image classification

In order to alleviate the subsequent computation burden and storage requirement, band selection has been widely adopted to reduce the dimensionality of hyperspectral images, and the current methods mainly consist of the supervised and the unsupervised. Although these supervised methods have better performance, those unsupervised methods dominate the band selection field. In this letter, based on the unique properties of hyperspectral images, we propose a very simple but effective supervised band selection algorithm based on the local spatial information of the hyperspectral image and wrapper method. By using both the information of labeled and unlabeled pixels of the hyperspectral image, our proposed algorithm consistently outperforms the classical wrapper method. We use five widely used real hyperspectral data to demonstrate the effectiveness of our proposed algorithms. We also analyze the relationship between our band selection algorithm and the well-known Markov random field classifier.

Lithological mapping using satellite images, particularly hyperspectral data, helps in effectively defining the best initial targets for regional exploration. In this study, ZY1-02D hyperspectral image (HSI) data with moderate spectral and very high spatial resolution were employed for lithological mapping using spectral indices along with support vector machine (SVM) machine learning and spatial–spectral transformer (SSTF) deep learning methods in the Kohat–Pothohar Plateau at the eastern edge of the Main Boundary Thrust (MBT) in Pakistan. The research was accomplished using spectral profiles of minerals accompanied by false color composite (FCC), principal component analysis (PCA), SVM, and SSTF methods for classifying the main lithological units. The lithological discrimination map derived from the ZY1-02D data matched well with the known deposits and field inspections. The principal component analysis (PCA) obtained the highest eigenvalues and provided a significant discrimination of lithologies, particularly with hyperspectral data. The results revealed lithological units, three of which contained limestone and gypsum, while other lithological units were defined as sandstone, clay, and conglomerates. Field investigation and laboratory sample analysis through X-ray diffraction (XRD), photomicrographs, and spectral analysis confirmed the occurrence of limestone, gypsum, and sandstone, which are useful in identifying lithological units in the study area. This study will assist in more accurate geological discrimination and play a vital role in identifying oil and gas reservoirs, coal, gypsum, uranium, salt, and limestone deposits. Furthermore, the results of the SVM and SSTF techniques were quantitatively compared with the geological boundaries mapped in the field, showing an accuracy of nearly 89.7% and 92.1%, respectively. Overall, the methodology adopted showed great performance and strong potential for mapping alteration areas and lithological discriminations applied on the ZY1-02D hyperspectral data.

Hyperspectral image classification is a challenging problem for machine learning methods due to the small number of labelled samples and high spectral variability. In this paper, to solve this problem, a novel superpixel and multi-classifier fusion (SMCF)-based classification method for hyperspectral images is proposed. This method takes full advantage of the spectral information of superpixels and the spatial information of hyperspectral images and includes the following three steps. First, superpixels are used to increase the number of training samples and their spectral diversity. Second, label propagation (LP) is used to classify the hyperspectral images. Although LP is an efficient semi-supervised classification method, the corresponding performance is poor for certain land cover types with dispersed spatial distributions. Thus, a support vector machine (SVM) classifier is introduced to classify the hyperspectral images. Finally, the results of the SVM and LP classifiers are combined using our new class-specific weighted fusion algorithm. In the experiments, we selected three widely used and real hyperspectral data sets for evaluation. The final classification performance was evaluated based on two common metrics: the overall accuracy (OA) and the Kappa coefficient. The experimental results show that the proposed SMCF method is superior to six well-known classification methods, even when only 1% or less of the labelled samples are used.

Integration of feature vector selection and support vector machine for classification of imbalanced data

Abstract. Hyperspectral image enhancement has been a concern for the remote sensing society for detailed end member detection. Hyperspectral remote sensor collects images in hundreds of narrow, continuous spectral channels, whereas multispectral remote sensor collects images in relatively broader wavelength bands. However, the spatial resolution of the hyperspectral sensor image is comparatively lower than that of the multispectral. As a result, spectral signatures from different end members originate within a pixel, known as mixed pixels. This paper presents an approach for obtaining an image which has the spatial resolution of the multispectral image and spectral resolution of the hyperspectral image, by fusion of hyperspectral and multispectral image. The proposed methodology also addresses the band remapping problem, which arises due to different regions of spectral coverage by multispectral and hyperspectral images. Therefore we apply algorithms to restore the spatial information of the hyperspectral image by fusing hyperspectral bands with only those bands which come under each multispectral band range. The proposed methodology is applied over Henry Island, of the Sunderban eco-geographic province. The data is collected by the Hyperion hyperspectral sensor and LISS IV multispectral sensor.

Powdery mildew (PM, Blumeria graminis f. sp. tritici) is a devastating disease for wheat growth and production. It is highly meaningful that the disease severities can be objectively and accurately identified by image visualization technology. In this study, an integral method was proposed based on a hyperspectral imaging dataset and machine learning algorithms. The disease severities of wheat leaves infected with PM were quantitatively identified based on hyperspectral images and image segmentation techniques. A technical procedure was proposed to perform the identification and evaluation of leaf-scale wheat PM, specifically including three primary steps of the acquisition and preprocessing of hyperspectral images, the selection of characteristic bands, and model construction. Firstly, three-dimensional reduction algorithms, namely principal component analysis (PCA), random forest (RF), and the successive projections algorithm (SPA), were comparatively used to select the bands that were most sensitive to PM. Then, three diagnosis models were constructed by a support vector machine (SVM), RF, and a probabilistic neural network (PNN). Finally, the best model was selected by comparing the overall accuracies. The results show that the SVM model constructed by PCA dimensionality reduction had the best result, and the classification accuracy reached 93.33% by a cross-validation method. There was an obvious improvement of the identification accuracy with the model, which achieved an 88.00% accuracy derived from the original hyperspectral images. This study can provide a reference for accurately estimating the disease severity of leaf-scale wheat PM and other plant diseases by non-contact measurement technology.

Potato late blight, which is caused by Phytophthorainfestans (Mont.) de Bary, is a worldwide devastating disease for potato. It decreased yields of potato and caused unpredictable losses all over the world. Various simple statistical methods and forecasting models have been developed to predict and manage potato late blight. Meanwhile, there is a rising need to develop prediction models reflecting peroxidase (POD) activity, which is an important health index that varies with infection and correlated with stress resistance in plants. Thus, the aim of this research was to develop kinetic models to predict POD activity. Infection-induced changes in potato leaves stored in an artificial climate chest at 25°C were analyzed using hyperspectroscopy. Four prediction models were developed by using linear partial least squares (PLS) and nonlinear support vector machine (SVM) methods based on the full spectrum and effective wavelengths. The effective wavelengths were selected by the successive projection algorithm (SPA). In this study, the prediction model developed by means of SPA-SVM method obtained the best performance, with a Rp (correlation coefficient of prediction) value of 0.923 and a RMSEp (root mean square error of prediction) value of 24.326. Five-order kinetics models according to the prediction model were developed, and late blight disease can be predicted using this model. This study provided a theoretical basis for the prediction of latencies of late blight. Keywords: POD (peroxidase) activity, kinetic model, potato leaves, late blight, hyperspectral data, latency prediction DOI: 10.25165/j.ijabe.20191202.4574 Citation: Li Q Y, Hu Y H. Kinetic models of peroxidase activity in potato leaves infected with late blight based on hyperspectral data. Int J Agric & Biol Eng, 2019; 12(2): 160–165.

Remote sensing Hyperspectral Image (HSI) comprises significant information about the earth’s surface which is actually acquired by hundred of narrow and adjacent spectral bands. The intended performance of classification accuracy does not attain due to the volume of the original HSI dataset and the enormous quantity of spectral bands. As such, dimensionality reduction approaches using feature extraction and selection are typically adopted to enhance classification performance. The unsupervised Principal Component Analysis (PCA), as well as the supervised Linear Discriminant Analysis (LDA), are commonly used as linear feature extraction methods for feature subspace detection. However, due to considering the effects of global variation, both PCA and LDA fail to extract local characteristics of HSI. In this paper, we propose a segmented LDA-based (SLDA) feature extraction where we apply the LDA in a segmented way to extract better local characteristics as well as global characteristics from the HSI. Per-pixel classification using a Support Vector Machine (SVM) is applied to our proposed SLDA method, PCA, Segmented-PCA (SPCA), and LDA on the Indian Pines agricultural HSI dataset. The experimental results show that the overall classification performance of SLDA (90.60%) remarkably outperforms all the other investigated methods: PCA (85.55%), SPCA (86.96%), LDA (86.45%), and the complete original dataset without employing any feature reduction method (83.10%). The proposed SLDA also requires the least amount of space complexity in different implementation scenarios.