2014
DOI: 10.1080/18756891.2013.869901
|View full text |Cite
|
Sign up to set email alerts
|

Curve-Fitting on Graphics Processors Using Particle Swarm Optimization

Abstract: Curve fitting is a fundamental task in many research fields. In this paper we present results demonstrating the fitting of 2D images using CUDA (compute unified device architecture) on NVIDIA graphics processors via particle swarm optimization (PSO). Particle swarm optimization is particularly well-suited to implementation on graphics processors using CUDA as each CUDA thread can be made to model a single particle in a swarm with the swarm itself defined by thread blocks. The motivation for this work was the r… 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

2016
2016
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…One way to profit from such powerful hardware is to run multiple swarms simultaneously. This kind of implementation can be seen in [24,47,[47][48][49][50][51][52][53][54][55][56]. SI algorithms have a non-deterministic behavior, therefore each run typically produces different results.…”
Section: Parallel and Cooperative Swarmsmentioning
confidence: 99%
“…One way to profit from such powerful hardware is to run multiple swarms simultaneously. This kind of implementation can be seen in [24,47,[47][48][49][50][51][52][53][54][55][56]. SI algorithms have a non-deterministic behavior, therefore each run typically produces different results.…”
Section: Parallel and Cooperative Swarmsmentioning
confidence: 99%
“…We apply PSO algorithm [29][30][31] to determine coordinates of control points of Bezier curve, as shape of Bezier curve is completely determined by its control point. PSO algorithm, compared with other advanced optimal algorithms like genetic algorithm and simulated annealing algorithm, is more robust and timesaving in terms of relatively small data sets, as its inherent process is more concise.…”
Section: Bounce Mechanismmentioning
confidence: 99%
“…ICA and PSO [5][6][7] are evolutionary optimization methods which have shown great performance in the global optimum achievement. In the present work, ICA and PSO are employed to optimize the initial weights of ANN.…”
Section: Introductionmentioning
confidence: 99%