2015
DOI: 10.7463/00309.0116072
|View full text |Cite
|
Sign up to set email alerts
|

Review of the particle swarm optimization method (PSO) for a global optimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Taking into account the enumerated shortcomings of existing clustering methods, a new one was developed, which allows establishing border between foreground and background with higher accuracy. It combines the elements of particle swarm optimization method [16] and k-means method.…”
Section: B Processing Of the Image Preparation Resultsmentioning
confidence: 99%
“…Taking into account the enumerated shortcomings of existing clustering methods, a new one was developed, which allows establishing border between foreground and background with higher accuracy. It combines the elements of particle swarm optimization method [16] and k-means method.…”
Section: B Processing Of the Image Preparation Resultsmentioning
confidence: 99%
“…In order to resolve the issue of arbitrary choices on clustering parameters, authors decided to use some elements of particle swarm [19] optimization.…”
Section: Related Work and Theoretical Backgroundmentioning
confidence: 99%
“…xi are the normalized [19] values of RGB vector of the pixel x i ; c j is the centroid of the cluster C j ; r' cj ; g' cj ; b ' cj are the normalized values of RGB vector of the centroid c j . 5) Then for the pixel x i it is necessary to find a centroid c a , a ∈ [1; M] relative to which the square root of distance function value will be minimum and a centroid c b ; b ∈ [1; M] relative to which the value of color function value will be minimum.…”
Section: Related Work and Theoretical Backgroundmentioning
confidence: 99%
“…Particle swarm optimization is a computational optimization method that metaphorically imitates the patterns seen in fish schooling or bird flights. It involves modifying a set of candidate solutions in turn based on their fitness rating to obtain the best solution for a certain problem [4].…”
Section: Introductionmentioning
confidence: 99%