Distribution of Watermark According to Image Complexity for Higher Stability

  • Mansour Jamzad
  • Farzin Yaghmaee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3212)


One of the main objectives of all watermarking algorithms is to provide a secure method for detecting all or part of the watermark pattern in case of usual attacks to a watermarked image. In this paper we introduce a method that is suitable for any spatial domain watermarking algorithms, such that, it can provide a measure for the level of robustness when a given watermark is supposed to be embedded in a known host image . In order to increase the robustness of the watermarked image, for a watermark of n bits, we embed it s times. Doing this, the entire image is divided into 16 equal size blocks. For each block the complexity of the sub-image in that block is measured. The number of repetition of watermark bits saved in each block is determined according to the complexity level of that block. The complexity of a sub-images is measured using its quad tree representation. This approach not only secures the watermarked image with respect to usual attacks, but also, enables us to save longer bit patterns of watermark, while maintaining a good level of similarity between the original image and the watermarked one.

For evaluating the performance of our method we have tested our method on 1000 images having low, medium and high level of complexity, and compared the result with the same set of images without considering the complexity of sub-images in blocks. Our new method provided %17 higher stability.


Watermark bit distribution quad-tree image complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kutter, M., Jordan, F., Bossen, F.: Digital watermarking of color image using amplitude modulation. Journal of electron imaging 7(2), 326–332 (1998)CrossRefGoogle Scholar
  2. 2.
    Chen, B.: Design and analysis of digital water marking, information embedding and data hiding systems PHD thesis, MIT university (June 2000) Google Scholar
  3. 3.
    Yaghmaee, F., Jamzad, M.: A robust watermarking method for color images using Naive-Bayes classifier. In: IASTED Con on signal and image processing (SIP 2003) (August 2003)Google Scholar
  4. 4.
    Cao, J., Fowler, J., Younan, N.: An image-adaptive watermark based on redundant wavelet transform. In: IEEE Con on image processing, October 2001, pp. 277–280 (2001)Google Scholar
  5. 5.
    Podilchuk, C.I., Delp, E.J.: Digital Watermarking: algorithms and applications. IEEE Signal Processing Magazine (July 2003)Google Scholar
  6. 6.
    Franco, R., Malah, D.: Adaptive Image Partitioning for Fractal Coding Achieving Designated Rates Under a Complexity Constraint. In: IEEE 2001 International Conference on Image Processing (2001)Google Scholar
  7. 7.
    Chandramouli, N.M.: How Many Pixels to Watermark. In: The International Conference on Information Technology: Coding and Computing (ITCC 2000), Nevada (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Mansour Jamzad
    • 1
  • Farzin Yaghmaee
    • 2
    • 3
  1. 1.Dept. of Computer EngineeringSharif University of TechnologyTehranIran
  2. 2.Dept. of Electrical EngineeringSemnan UniversitySemnanIran
  3. 3.The Center for Theretical Physics and MathematicsComputer Science Research CenterNiyavaran, TehranIran

Personalised recommendations