Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/15106
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPrabhavathy P.
dc.contributor.authorTripathy B.K.
dc.contributor.authorVenkatesan M.
dc.date.accessioned2021-05-05T10:16:27Z-
dc.date.available2021-05-05T10:16:27Z-
dc.date.issued2021
dc.identifier.citationAdvances in Intelligent Systems and Computing , Vol. 1180 AISC , , p. 148 - 160en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-030-49339-4_16
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/15106-
dc.description.abstractHyperspectral imagery is one of the research area in the field of Remote sensing. Hyperspectral sensors record reflectance (also called spectra signature) of object or material or region across the electromagnetic spectrum. Mineral identification is an urban application in the field of Remote sensing of Hyperspectral data. EO-1 hyperion dataset is unlabeled data. Various types of clustering algorithms are proposed to identify minerals. In this work principal component analysis is used to reduced it’s dimension by reducing bands. Hard-clustering and soft-clustering algorithms are applied on given data to classify the minerals into classes. K-means is hard type of clustering which classify only non-overlapping cluster however, PFCM is soft type of clustering which allow a data points to belongs more than one cluster. Further, results are compared using cluster validity index using DBI value. Both clustering algorithms are experiments on original HSI image and reduced bands. Result shows that PFCM is perform better than K-means for the both type of images. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.en_US
dc.titleUnsupervised learning method for mineral identification from hyperspectral dataen_US
dc.typeConference Paperen_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.