Abstract

Hyperspectral remote sensing has been gaining attention from the past few decades. Due to the diverse and high dimensionality nature of the remote sensing data, it is called as remote sensing Big Data. Hyperspectral images have high dimensionality due to number of spectral bands and pixels having continuous spectrum. These images provide us with more details than other images but still, it suffers from ‘curse of dimensionality’. Band selection is the conventional method to reduce the dimensionality and remove the redundant bands. Many methods have been developed in the past years to find the optimal set of bands. Generalized covering-based rough set is an extended method of rough sets in which indiscernibility relations of rough sets are replaced by coverings. Recently, this method is used for attribute reduction in pattern recognition and data mining. In this paper, we will discuss the implementation of covering-based rough sets for optimal band selection of hyperspectral images and compare these results with the existing methods like PCA, SVD and rough sets.

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.