2019
DOI: 10.1556/606.2019.14.3.19
|View full text |Cite
|
Sign up to set email alerts
|

Fast K-Means technique for hyper-spectral image segmentation by multiband reduction

Abstract: The proposed work addresses a novelty in techniques for segmentation of remotely sensed hyper-spectral scenes. Incorporated inter band cluster and intra band cluster techniques has investigated. With a new constrain validate the new segmentation methods in this proposed work, the fast K-Means is used in inter clustering part. The inter band clustering is carried out by fast K-Means methods includes weighted and careful seeding procedures. The intra band clustering processed using Particle Swarm Clustering algo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Padmavathi and angadurai used the color feature of the leaf image to segment the leaf image into multiple parts by color [9]. Kumar et al proposed a new remote sensing hyperspectral scene segmentation technique [10]. But their proposed AI segmentation algorithm is not accurate enough.…”
Section: Introductionmentioning
confidence: 99%
“…Padmavathi and angadurai used the color feature of the leaf image to segment the leaf image into multiple parts by color [9]. Kumar et al proposed a new remote sensing hyperspectral scene segmentation technique [10]. But their proposed AI segmentation algorithm is not accurate enough.…”
Section: Introductionmentioning
confidence: 99%
“…1 p refers to new point to be classified either dark square label or empty circle label. Here, p belongs to the dark square class if k 5 1; if k 5 5, then it is classified as the small circle class due to majority vote rule [6,7].…”
Section: Related Workmentioning
confidence: 99%
“…Many clustering algorithms have been proposed so far: k-means, single link, CURE (meaning Clustering Using Representatives), DBSCAN (meaning Density-Based Spatial Clustering of Applications with Noise), and Expectation Maximization are well-known examples; see [15]. Several clustering algorithms have been successfully applied in contexts like information retrieval [16], bioinformatics [17], medicine [18], image segmentation [19], and cybersecurity [20], among others. An important class of clustering algorithms is graphbased clustering algorithms.…”
Section: Graph-based Clusteringmentioning
confidence: 99%