pixel permutation
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 8)

H-INDEX

3
(FIVE YEARS 2)

2021 ◽  
Vol 6 (2 (114)) ◽  
pp. 103-116
Author(s):  
Vitalii Martovytskyi ◽  
Igor Ruban ◽  
Nataliia Bolohova ◽  
Оleksandr Sievierinov ◽  
Oleg Zhurylo ◽  
...  

Active attacks and natural impacts can lead to two types of image-container distortions: noise-like and geometric. There are also image processing operations, e.g. scaling, rotation, truncation, pixel permutation which are much more detrimental to digital watermarks (DWM). While ensuring resistance to removal and geometric attacks is a more or less resolved problem, the provision of resistance to local image changes and partial image deletion is still poorly understood. The methods discussed in this paper are aimed at ensuring resistance to attacks resulting in partial image loss or local changes in the image. This study's objective is to develop methods for generating a distortion-resistant digital watermark using the chaos theory. This will improve the resistance of methods of embedding the digital watermark to a particular class of attacks which in turn will allow developers of DWM embedding methods to focus on ensuring the method resistance to other types of attacks. An experimental study of proposed methods was conducted. Histograms of DWMs have shown that the proposed methods provide for the generation of DWM of a random obscure form. However, the method based on a combination of Arnold’s cat maps and Henon maps has noticeable peaks unlike the method based on shuffling the pixels and their bits only with Arnold’s cat maps. This suggests that the method based only on Arnold’s cat maps is more chaotic. This is also evidenced by the value of the coefficient of correlation between adjacent pixels close to zero (0.0109) for color DWMs and 0.030 for black and white images.


Author(s):  
K. Abhimanyu Kumar Patro ◽  
Mukesh Drolia ◽  
Akash Deep Yadav ◽  
Bibhudendra Acharya

In this present era, where everything is getting digitalized, information or data in any form, important to an organization or individual, are at a greater risk of being attacked under acts, commonly known as cyber-attack. Hence, a proper and more efficient cryptosystem is the prime need of the hour to secure the data (especially the image data). This chapter proposes an efficient multi-point crossover operation-based chaotic image encryption system to secure images. The multi-point crossover operation is performed on both the rows and columns of bit-planes in the images. The improved one-dimensional chaotic maps are then used to perform pixel-permutation and diffusion operations. The main advantage of this technique is the use of multi-point crossover operation in bit-levels. The multi-point crossover operation not only increases the security of cipher images but also increases the key space of the algorithm. The outcomes and analyses of various parameters show the best performance of the algorithm in image encryption and different common attacks.


2020 ◽  
Vol 37 (1) ◽  
pp. 95-100
Author(s):  
Abdelaziz Mokhnache ◽  
Lahcene Ziet

2019 ◽  
Vol 78 (19) ◽  
pp. 27569-27590 ◽  
Author(s):  
Shamama Anwar ◽  
Solleti Meghana

2018 ◽  
Vol 100 ◽  
pp. 200-207 ◽  
Author(s):  
Xiaowei Li ◽  
Dan Xiao ◽  
Qiong-Hua Wang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document