2017
DOI: 10.1007/s10489-017-0989-x
|View full text |Cite
|
Sign up to set email alerts
|

Image steganalysis using improved particle swarm optimization based feature selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
30
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(30 citation statements)
references
References 13 publications
0
30
0
Order By: Relevance
“…To assess the performance of the proposed ICQPSO algorithm, six benchmark functions are examined, and statistical results are compared with PSO [13], SINPSO [17], APSO [18], QPSO [21], and HCQPSO [31,32]. QPSO and PSO are the basic traditional algorithms.…”
Section: Performance Tests Of Icqpso Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…To assess the performance of the proposed ICQPSO algorithm, six benchmark functions are examined, and statistical results are compared with PSO [13], SINPSO [17], APSO [18], QPSO [21], and HCQPSO [31,32]. QPSO and PSO are the basic traditional algorithms.…”
Section: Performance Tests Of Icqpso Algorithmmentioning
confidence: 99%
“…It is an effective way to improve the FNN performance by replacing the traditional learning algorithm by metaheuristic algorithms such as the particle swarm optimization (PSO) algorithm [13][14][15]. However, when the considered problem is a complex high-dimensional problem, PSO algorithm has the disadvantage of premature convergence [16][17][18][19]. After studying the results of particle convergence behavior, Sun et al [20] proposed a novel metaheuristic algorithm called quantum-behaved particle swarm optimization (QPSO) algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…However, BPSO suffers from the premature convergence and slow convergence rate [15][16][17]. Additionally, one of the major drawbacks of BPSO is the setting of the inertia weight [18]. In order to solve the limitations of BPSO, a new co-evolution binary particle swarm optimization with a multiple inertia weight strategy (CBPSO-MIWS) is proposed in this work.…”
Section: Co-evolution Binary Particle Swarm Optimization With Multiplmentioning
confidence: 99%
“…Each of these decisions can be modeled as an optimization problem or, in many cases, a combinatorial optimization problem (COP). Examples of COPs are found in different areas: machine learning [1], transportation [2], facility layout design [3], logistics [4], scheduling problems [2,5], resource allocation [6,7], routing problems [8], robotics applications [9], image analysis [10], engineering design problems [11], fault diagnosis of machinery [12], and manufacturing problems [13], among others. If the problem is large, metaheuristics have been a good approximation to obtain adequate solutions.…”
Section: Introductionmentioning
confidence: 99%