Image Hiding with an Improved Genetic Algorithm and an Optimal Pixel Adjustment Process

Author(s):  
Lin-Yu Tseng ◽  
Yung-Kuan Chan ◽  
Yu-An Ho ◽  
Yen-Ping Chu
2013 ◽  
Vol 7 (3) ◽  
pp. 1-15 ◽  
Author(s):  
Omar Banimelhem ◽  
Lo’ai Tawalbeh ◽  
Moad Mowafi ◽  
Mohammed Al-Batati

This paper proposes a more secure image hiding scheme using Optimal Pixel Adjustment Process (OPAP) and Genetic Algorithm (GA). The security issues of key selection that is used in image hiding are addressed. Thus, a more secure scheme is proposed in order to improve the security as well as the quality of the stego-image. Since GA is a semi-blind algorithm, it may select a key that affects the security. Therefore, the authores improve the security by applying image transformation not only using the GA key, but also using a user key. The user key is used to disarrange the pixel locations of the secret image. Then, the GA, using OPAP, selects the key that maximizes the quality as well as the security of the stego-image. From implementation point of view, the scheme uses a simple and fast transformation method that increases the difference between the secret image and its transformed version. The results showed that the resultant disarranged image cannot be detected, and at the same time the stego-image quality is still high.


Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


2021 ◽  
Vol 183 ◽  
pp. 108041
Author(s):  
Xiuli Chai ◽  
Xiangcheng Zhi ◽  
Zhihua Gan ◽  
Yushu Zhang ◽  
Yiran Chen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document