Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/11690
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSenthilnath, J.-
dc.contributor.authorOmkar, S.N.-
dc.contributor.authorMani, V.-
dc.contributor.authorTejovanth, N.-
dc.contributor.authorDiwakar, P.G.-
dc.contributor.authorArchana, Shenoy, B.-
dc.date.accessioned2020-03-31T08:35:27Z-
dc.date.available2020-03-31T08:35:27Z-
dc.date.issued2012-
dc.identifier.citationIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2012, Vol.5, 3, pp.762-768en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/11690-
dc.description.abstractThis paper presents hierarchical clustering algorithms for land cover mapping problem using multi-spectral satellite images. In unsupervised techniques, the automatic generation of number of clusters and its centers for a huge database is not exploited to their full potential. Hence, a hierarchical clustering algorithm that uses splitting and merging techniques is proposed. Initially, the splitting method is used to search for the best possible number of clusters and its centers using Mean Shift Clustering (MSC), Niche Particle Swarm Optimization (NPSO) and Glowworm Swarm Optimization (GSO). Using these clusters and its centers, the merging method is used to group the data points based on a parametric method (k-means algorithm). A performance comparison of the proposed hierarchical clustering algorithms (MSC, NPSO and GSO) is presented using two typical multi-spectral satellite images - Landsat 7 thematic mapper and QuickBird. From the results obtained, we conclude that the proposed GSO based hierarchical clustering algorithm is more accurate and robust. 2012 IEEE.en_US
dc.titleHierarchical clustering algorithm for land cover mapping using satellite imagesen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
11690.pdf1.01 MBAdobe PDFThumbnail
View/Open


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