2014
DOI: 10.5120/15441-4051
|View full text |Cite
|
Sign up to set email alerts
|

Parallelization of the Algorithm K-means Applied in Image Segmentation

Abstract: Algorithm k-means is useful for grouping operations; however, when is applied to large amounts of data, its computational cost is high. This research propose an optimization of k-means algorithm by using parallelization techniques and synchronization, which is applied to image segmentation. In the results obtained, the parallel k-means algorithm, improvement 50% to the algorithm sequential k-means.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…In partitioning tasks, K-means is frequently used and known to be effective and fast [26], [27]. In our research, we developed an enhanced version of K-means called Advanced K-means, specifically for network partitioning.…”
Section: Methodsmentioning
confidence: 99%
“…In partitioning tasks, K-means is frequently used and known to be effective and fast [26], [27]. In our research, we developed an enhanced version of K-means called Advanced K-means, specifically for network partitioning.…”
Section: Methodsmentioning
confidence: 99%