Fuzzy C-Means Technique for Band Reduction and Segmentation of Hyperspectral Satellite Image

Fuzzy C-Means Technique for Band Reduction and Segmentation of Hyperspectral Satellite Image

Saravanakumar V., Kavitha M. Saravanan, Balaram V. V. S. S. S., Anantha Sivaprakasam S.
Copyright: © 2021 |Pages: 22
DOI: 10.4018/IJFSA.2021100105
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper put forward for the segmentation process on the hyperspectral remote sensing satellite scene. The prevailing algorithm, fuzzy c-means, is performed on this scene. Moreover, this algorithm is performed in both inter band as well as intra band clustering (i.e., band reduction and segmentation are performed by this algorithm). Furthermore, a band that has topmost variance is selected from every cluster. This structure diminishes these bands into three bands. This reduced band is de-correlated, and subsequently segmentation is carried out using this fuzzy algorithm.
Article Preview
Top

1. Introduction

In recent decade, hyperspectral remote sensing scene (Jose M.Bioucas-Dias et al, 2013) has clinched mindfulness in research as well as analysis. As of now, with space borne sensors, for example, the EO -1 Hyperion, the hyperspectral image (HSI) assortment is right now increasing to apply (John P.Kerekes and Jerrold E Baum, 2003), satellite sensor look into examines. Application consisting of water management (Govender M et al., (2007), crop growing and ecological observing have progresses through the guide of this imagery. The significance of victimization imaging spectrometry libels in the spectral as opposed to spatial resolution contrast with multispectral imagery. Hyperspectral sensors have the flexibility to obtain urban land (Jon Atli Benediktsson et.al, 2005) cover for complex analysis of huge, thick territories, in this manner empowering a refresh of surface material databases for use in urban advancement. Jung. A, et.al, 2005, examined the HSI associated its exposure of vegetation in an urban panorama and determined that once discriminating exclusive sorts of flora. They endeavoured to identify the impact of vegetation on miniaturized scale natural issues among built-up condition. This satellite-based gadget will gather statistics for a region of enthusiasm (Shefali Aggarwal, 2003), for the littoral atmosphere to include: submerged dangers, currents, lubricate slicks, underneath type, impressive visibility, tides, luminescence possible, shoreline portrayal, environmental irrigate steam in addition to sub-unmistakable cirrus alongside earthbound images of flora and soil.

The branch of image process deliberates about with computer process of images from this present reality. An image is depicting an array of finite elements, wherever every part is named a constituent or pixel. Image understanding (AnanthSivaprakasam et al., 2018) is a prevalent advance in imaginative and prescient systems. In any case, it is partitioning an image into homogenous and expressive parts or objects. Consequent to segmentation, the objects are perceived and taken by classification technique (Suma K.G, and Saravanakumar.V, 2018).

Cluster Analysis is characterized as the assortment of unsupervised (Liu.L et al, 2018) classification techniques for grouping objects or segmenting (Kavitha M, et.al, 2020) datasets into subsets of data referred to as clusters. By using an appropriate clustering algorithm, a cluster is formed with objects which are more like each other when in contrast to others in various clusters. Despite the fact of various ways to categorize them, the clustering algorithms can be commonly grouped in three categories namely as hierarchical, non-hierarchical and mixture techniques. Even though heaps of algorithms existing, in practice the use of plethora of these algorithms has been confined because of their complexity, efficiency, and availability in by and by used statistical software. The choice of a decent algorithm to keep running on a certain dataset relies upon myriad criteria equivalent to data size, data structures, and the objectives of cluster analysis (Li.Z et.al., 2018). As announced in myriad studies the non-hierarchical partitioning algorithms, i.e the algorithms belonging to K-Means (KM) family provide sensible clustering leads to shorter times in contrast to the hierarchical algorithms on massive datasets. KM may not be prolific to determine overlie clusters, and it is now not invariant to non-linear transformations of data. Thus, portrayals of a specific datasets with Cartesian coordinates and polar coordinates may give distinctive clustering results. It additionally neglects to cluster noisy data and non-linear datasets.

Complete Article List

Search this Journal:
Reset
Volume 13: 1 Issue (2024)
Volume 12: 1 Issue (2023)
Volume 11: 4 Issues (2022)
Volume 10: 4 Issues (2021)
Volume 9: 4 Issues (2020)
Volume 8: 4 Issues (2019)
Volume 7: 4 Issues (2018)
Volume 6: 4 Issues (2017)
Volume 5: 4 Issues (2016)
Volume 4: 4 Issues (2015)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing