Robust image watermarking using the social group optimization algorithm

Author(s):  
Dilip Golda ◽  
B. Prabha ◽  
K. Murali ◽  
K. Prasuna ◽  
Sai Sri Vatsav ◽  
...  
2019 ◽  
Vol 8 (2S3) ◽  
pp. 1184-1187

Antenna array optimization is a major research problem in the field of electromagnetic and antenna engineering. The optimization typically involves in handling several radiation parameters like Sidelobe level (SL) and beamwidth (BW). In this paper, the linear antenna array (LAA) configuration is considered with symmetrical distribution of excitation and special distribution. The objective of the design problem considered involves in generating optimized patterns in terms of SLL and BW and check the robustness of the social group optimization algorithm (SGOA). The analysis of the design problem is carried out in terms of radiation pattern plots. The simulation is carried out in Matlab.


Author(s):  
Anima Naik ◽  
Suresh Chandra Satapathy

Abstract From the past few decades, the popularity of meta-heuristic optimization algorithms is growing compared to deterministic search optimization algorithms in solving global optimization problems. This has led to the development of several optimization algorithms to solve complex optimization problems. But none of the algorithms can solve all optimization problems equally well. As a result, the researchers focus on either improving exiting meta-heuristic optimization algorithms or introducing new algorithms. The social group optimization (SGO) Algorithm is a meta-heuristic optimization algorithm that was proposed in the year 2016 for solving global optimization problems. In the literature, SGO is shown to perform well as compared to other optimization algorithms. This paper attempts to compare the performance of the SGO algorithm with other optimization algorithms proposed between 2017 and 2019. These algorithms are tested through several experiments, including multiple classical benchmark functions, CEC special session functions, and six classical engineering problems etc. Optimization results prove that the SGO algorithm is extremely competitive as compared to other algorithms.


Author(s):  
V. V. S. S. S. Chakravarthy ◽  
P. S. R. Chowdary ◽  
Suresh Chandra Satapathy ◽  
Jaume Anguera ◽  
Aurora Andújar

2022 ◽  
Vol 11 (1) ◽  
pp. 55-72 ◽  
Author(s):  
Anima Naik ◽  
Pradeep Kumar Chokkalingam

In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous values generated from SGO into binary ones. The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms. Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.


Sign in / Sign up

Export Citation Format

Share Document