An Efficient Distributed Watermarking Scheme z

                               Using Block Information Measure                                            

 ¹K. A. Nagaty, ¹T. M. Nazmy, ²S. M. Talat, ²M. Ali

1) Faculty of Computer and Information Sciences

2) Ain-Shams University ²Faculty of Science-Physics Department  Ain-Shams University

Abstract:
This paper presents a new distributed watermarking scheme. In the field of image watermarking, researches have been mainly focused on exploiting the characteristics of the human visual system without trying to distribute the original watermark on the image to increase watermark resistance against hostile attacks. In this scheme, we have two objectives. First is to select the locations in the image which contain less detailed information to use them in watermark insertion. Second is to divide the watermark into pieces and distribute them on the image to ensure watermark resistance against hostile attacks. This is achieved by dividing the image into equal blocks and by keeping the entropy measure to a predefined value we distribute the watermark pieces among blocks of low entropy. A watermarking method based on proportion coefficients which operate in the frequency domain was used to add a watermark pieces with different robustness to a digital image to ensure watermark invisibility and resistance against hostile attacks. Experimental results are presented to demonstrate that the proposed approach can give good image quality and robust against some common image processing attacks such as uniform Gaussian noise, mean filtering, and multiple watermarking.
Keywords:Block Information Measure,Distributed Watermarking Proportion Coefficients, DCT Coefficients.