Abstract

Scholars have performed much research on reducing the redundancy of hyperspectral data. As a measure of the similarity between hyperspectral bands, structural similarity is used in band selection methods. However, existing structural similarity methods calculate all the structural similarity between bands, which leads to excessively long runtimes for these methods. Aiming to address this problem, this paper proposes a band subspace partition method and combines it with the SR-SSIM band selection method to obtain an improved band selection method: E-SR-SSIM. E-SR-SSIM consists of two parts: band subspace partition and band subspace band selection. In the first part, the hyperspectral dataset is divided into subdatasets corresponding to a number of subspaces. In the second part, a modified SR-SSIM method is used for all subdatasets to select the most representative band in each subdataset. The Indian Pines, Salinas Kennedy Space Center and Wuhan unmanned aerial vehicle-borne hyperspectral image LongKou public datasets are used to implement the experiment. The experiment uses random forest as the supervised classifier: 10% of each category sample is randomly selected as training data, and the remaining 90% is used as test data. The evaluation indicators selected in the experiment are overall accuracy, average accuracy, kappa and recall. The experimental results show that E-SR-SSIM can effectively reduce the runtime while ensuring classification compared with SR-SSIM, and quantitative proof that the band subspace partition reduces the calculated amount of structural similarity is obtained through a mathematical analysis. The improved band subspace partition method could partition a dataset more reasonably than the original band subspace partition method.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.