Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/8638
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKelam, H.
dc.contributor.authorVenkatesan, M.
dc.date.accessioned2020-03-30T10:22:30Z-
dc.date.available2020-03-30T10:22:30Z-
dc.date.issued2019
dc.identifier.citationAdvances in Intelligent Systems and Computing, 2019, Vol.750, , pp.263-273en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8638-
dc.description.abstractHyperspectral 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. � 2019, Springer Nature Singapore Pte Ltd.en_US
dc.titleOptimal Band Selection Using Generalized Covering-Based Rough Sets�on Hyperspectral Remote Sensing Big Dataen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.