2021
DOI: 10.1007/s12065-020-00544-z
|View full text |Cite
|
Sign up to set email alerts
|

Clustering method and sine cosine algorithm for image segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
23
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 42 publications
(23 citation statements)
references
References 41 publications
0
23
0
Order By: Relevance
“…These clustering algorithms are the most common used clustering algorithms in different fields because of their efficiency compared to other algorithms. 21,[23][24][25][26][27] 2.1.1 | K-means clustering K-means is a clustering algorithm that introduced in 1967 by MacQueen. 28 The procedure to cluster the data is based on defining a certain number of clusters (K).…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…These clustering algorithms are the most common used clustering algorithms in different fields because of their efficiency compared to other algorithms. 21,[23][24][25][26][27] 2.1.1 | K-means clustering K-means is a clustering algorithm that introduced in 1967 by MacQueen. 28 The procedure to cluster the data is based on defining a certain number of clusters (K).…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…Abdel-Basset et al [23] have remarkably utilized SCA to tackle multi-objective problems for real-time task scheduling in multiprocessor systems. Khrissi et al [24] have smartly incorporated SCA with clustering methods to revolutionize the field of image segmentation. Meanwhile, Kumar & Hussain [25] have judiciously merged SCA, where the Cauchy and Gaussian strategies efficiently optimized global exploration and local exploitation ability, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Many image segmentation algorithms have been proposed in the literature, from the traditional techniques, such as thresholding [ 30 , 31 , 32 , 33 ], edge-based segmentation [ 34 , 35 ], histogram-based bundling, region-based segmentation [ 36 , 37 , 38 , 39 ], clustering-based segmentation [ 40 , 41 , 42 , 43 , 44 ], watershed methods [ 45 , 46 , 47 , 48 , 49 ], to more advanced algorithms such as active contours [ 50 , 51 , 52 , 53 ], graph cuts [ 54 , 55 , 56 , 57 ], conditional and Markov random fields [ 58 , 59 , 60 , 61 ], and sparsity-based methods [ 62 , 63 , 64 ].…”
Section: Introductionmentioning
confidence: 99%