Homomorphic Filter Based Image Watermarking

2015 ◽  
Vol 781 ◽  
pp. 543-546
Author(s):  
Piyanart Chotikawanid ◽  
Kharittha Thongkor ◽  
Thumrongrat Amornraksa

This paper proposes a spatial domain image watermarking method based on homomorphic filter. In the proposed method, after applying the homomorphic filter to the host color image, a watermark image is embedded into the natural logarithm reflectance component of the image. Based on the concept that the reflectance component contains most of the image details with low energy, the watermark energy added to this component will be imperceptually noticed by the human eye. The embedding watermark is also protected by a key-based stream cipher, so that without the correct secret key, one cannot reconstruct the watermark. To identify the existence of the embedded watermark, the semi-blind detection approach is applied. The performance of the proposed method in terms of correlation coefficient between the original and extracted watermarks is measured and presented. Its robustness against image blurring and image sharpening at various strengths is also evaluated. The results show the potential of the proposed method for a practical system.

2013 ◽  
Vol 798-799 ◽  
pp. 733-736
Author(s):  
Xiu Hu Tan

Transparency and robustness are two conflicting requirements demanded by digital image watermarking for copyright protection and many other purposes. In this paper, a robust and transparent watermarking scheme for color images is proposed. The color features for the human visual system are utilized to design the color watermarking algorithm. The basic idea is to embed the invisible watermark into the color image by brightness adjustment and feature component choice. And through analysis and constraint the conditions, we can obtain a high detection probability and security, a low false alarm probability. In the same time, because we use different matrix operation to embed (secret key) and extract (public key) a watermark, we are able to release all information for the public, except the secret key. Our method can extract the embedded watermark without reference image. The robustness of our method is demonstrated by various attacks through computer simulation.


2015 ◽  
Vol 343 ◽  
pp. 56-65 ◽  
Author(s):  
Zhuhong Shao ◽  
Yuping Duan ◽  
Gouenou Coatrieux ◽  
Jiasong Wu ◽  
Jinyu Meng ◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Lin Ding ◽  
Chenhui Jin ◽  
Jie Guan ◽  
Qiuyan Wang

Loiss is a novel byte-oriented stream cipher proposed in 2011. In this paper, based on solving systems of linear equations, we propose an improved Guess and Determine attack on Loiss with a time complexity of 2231and a data complexity of 268, which reduces the time complexity of the Guess and Determine attack proposed by the designers by a factor of 216. Furthermore, a related key chosenIVattack on a scaled-down version of Loiss is presented. The attack recovers the 128-bit secret key of the scaled-down Loiss with a time complexity of 280, requiring 264chosenIVs. The related key attack is minimal in the sense that it only requires one related key. The result shows that our key recovery attack on the scaled-down Loiss is much better than an exhaustive key search in the related key setting.


Sign in / Sign up

Export Citation Format

Share Document