Acta Optica Sinica, Volume. 28, Issue 9, 1691(2008)

Color Image Blind Watermark Algorithm Based on Double Chaotic Scrambling and Spread Spectrum Modulation

Hu Yufeng* and Zhu Shan'an
Author Affiliations
  • [in Chinese]
  • show less

    A new blind watermark algorithm for color image was proposed. First, the green component of the original image was blocked by size 8×8 pixels and transformed with discrete cosine transformation (DCT). Second, two chaotic sequences were generated by logistic mapping, and the binary watermark image was scrambled by the chaotic sequences and spread spectrum modulated by two uncorrelated random sequences. Third, the modulated watermark was embedded in mid-frequency region coefficients of DCT domain. At last, the watermarked image was obtained by inverse discrete cosine transform. The watermark was extracted by comparing the correlation between two random sequences with watermarked image, the process did not need the original image, namely a blind watermark algorithm. Experimental results demonstrated that this method is invisible and robust against some usual attacks such as JPEG compression, cropping, adding noise, and embedding watermark in green component is more robust against lossy compression than embedding watermark in red or blue component.

    Tools

    Get Citation

    Copy Citation Text

    Hu Yufeng, Zhu Shan'an. Color Image Blind Watermark Algorithm Based on Double Chaotic Scrambling and Spread Spectrum Modulation[J]. Acta Optica Sinica, 2008, 28(9): 1691

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: Image Processing

    Received: Dec. 19, 2007

    Accepted: --

    Published Online: Sep. 9, 2008

    The Author Email: Yufeng Hu (huyufeng0726@163.com)

    DOI:

    Topics