Abstract

Spectral similarity measures can be regarded as potential metrics for kernel functions, and can be used to generate spectral-similarity-based kernels. However, spectral-similarity-based kernels have not received significant attention from researchers. In this paper, we propose two novel spectral-similarity-based kernels based on spectral angle mapper (SAM) and spectral information divergence (SID) combined with the radial basis function (RBF) kernel: Power spectral angle mapper RBF (Power-SAM-RBF) and normalized spectral information divergence-based RBF (Normalized-SID-RBF) kernels. First, we prove these spectral-similarity-based kernels to be Mercer’s kernels. Second, we analyze their efficiency in terms of local and global kernels. Finally, we consider three hyperspectral datasets to analyze the effectiveness of the proposed spectral-similarity-based kernels. Experimental results demonstrate that the Power-SAM-RBF and SAM-RBF kernels can obtain an impressive performance, particularly the Power-SAM-RBF kernel. For example, when the ratio of the training set is 20 % , the kappa coefficient of Power-SAM-RBF kernel (0.8561) is 1.61 % , 1.32 % , and 1.23 % higher than that of the RBF kernel on the Indian Pines, University of Pavia, and Salinas Valley datasets, respectively. We present three conclusions. First, the superiority of the Power-SAM-RBF kernel compared to other kernels is evident. Second, the Power-SAM-RBF kernel can provide an outstanding performance when the similarity between spectral signatures in the same hyperspectral dataset is either extremely high or extremely low. Third, the Power-SAM-RBF kernel provides even greater benefits compared to other commonly used kernels when the sizes of the training sets increase. In future work, multiple kernels combining with the spectral-similarity-based kernel are expected to be provide better hyperspectral classification.

Highlights

  • Hyperspectral data, which span the visible to infrared spectrum and cover hundreds of bands, can provide important spectral information regarding land cover

  • The spectral information divergence (SID)-radial basis function (RBF) kernel performs worse than the Linear and RBF kernels when the proportion of training data is small

  • The spectral information divergence-based RBF (SID-RBF) and Normalized-SID-RBF kernels exhibit the worst performance among all kernels for all proportions of training data

Read more

Summary

Introduction

Hyperspectral data, which span the visible to infrared spectrum and cover hundreds of bands, can provide important spectral information regarding land cover. Hyperspectral sensors record the collected information as a series of images; these images provide the spatial distribution of solar radiation reflected from a point of observation [1]. Such a high-dimensional spectral feature space is suitable for a wide range of applications, including land-cover classification [1], ground target detection [2], anomaly detection [3], and spectral unmixing [4]. Classification performance is strongly affected by the dimensionality of the feature space (e.g., the Hughes phenomenon [7]) This problem can typically be simplified by employing a feature extraction to reduce the dimensionality of the hyperspectral images (HSIs) while maintaining as much valuable data as possible. Conventional statistical approaches, such as k-nearest neighbors, a maximum likelihood (ML) or Bayes classification method [8,9], and random forest [10], are used to perform HSI classification

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call