2017 Computing Conference 2017
DOI: 10.1109/sai.2017.8252090
|View full text |Cite
|
Sign up to set email alerts
|

A PSO/HS based algorithm for optimization tasks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…Using the previous frame image as the background model of the current frame has a good real-time performance because the time interval among adjacent frames is short. Its background is not accumulated [6], and the update speed is fast. The algorithm is simple, and the computation amount is small.…”
Section: Frame Difference Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Using the previous frame image as the background model of the current frame has a good real-time performance because the time interval among adjacent frames is short. Its background is not accumulated [6], and the update speed is fast. The algorithm is simple, and the computation amount is small.…”
Section: Frame Difference Methodsmentioning
confidence: 99%
“…x y adjacent area, and K refers to the times of iteration. Formulas (6) and (7) imply that the amount of computation of the HS optical flow equation depends on the iteration. When the initial value is close to the real value, the convergence of iteration is fast.…”
Section: Suppose ( )mentioning
confidence: 99%