Contourlet-domain watermarking algorithm against geometric attacks based on feature template

被引:6
作者
Lou, Ou-Jun [1 ]
Wang, Zheng-Xuan [1 ]
机构
[1] College of Computer Science and Technology, Jilin University
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2009年 / 32卷 / 02期
关键词
Contourlet; Feature point; Geometry attack; Template; Watermarking;
D O I
10.3724/SP.J.1016.2009.00308
中图分类号
学科分类号
摘要
Image watermarking resistant to geometric attacks is the hotspot and challenging point in the state-of-the-art research on watermarking. Even an invisible affine transformation can invalidate most existing watermarking algorithms. This paper analyses and discusses the characteristics of Contourlet transform, and on the basis above, proposes a novel Contourlet-domain watermarking algorithm against geometric attacks based on the feature template matching. The proposed algorithm includes four important techniques: (1) Puting coefficients into one group with the same coordinate in each finest directional subband. Then select the coefficient with the richest texture from each group as the coefficient to be embedded watermarking. Therefore, watermarking can be embedded into significant region as well as highly textured region of the host image; (2) For each coefficient of the selected subband, embeding watermarking with different strength adaptively adjusted in terms of the energy of its parent coefficient in the lowest subband, and the texture of its neighborhood coefficients in finer scale. The choice of embedding position and the embedding strategy above effectively guarantee good transparency and maximum robustness of the proposed algorithm; (3) Improving the Harris-Laplace operator, extract the feature points robust to geometric deformation as template from the embedded image using improved Harris-Laplace operator; (4) When detection, using the transformation between corresponding points in feature template to realize resynchronization, and determining existence of watermarking by statistical correlation between host image and watermarking. Experimental results show the proposed algorithm has good transparency and is very robust to common image processing and geometric attacks.
引用
收藏
页码:308 / 317
页数:9
相关论文
共 22 条
  • [1] Bo X.-C., Shen L.-C., Chang W.-S., Niu Y.-F., Adaptive detection for blind image watermarking in DCT domain, Journal of Computer Research and Development, 39, 4, pp. 502-510, (2002)
  • [2] Emir G., Dexter S.D., Eskicioglu A.M., Embedding multiple watermarks in the DFT domain using low and high frequency bands, Proceedings of the SPIE: Security, Steganography, and Watermarking of Multimedia Contents VII, 5681, pp. 175-184, (2005)
  • [3] Yang H.-F., Chen X.-W., A robust image-adaptive public watermarking technique in wavelet domain, Journal of Software, 14, 9, pp. 1652-1660, (2003)
  • [4] Jiao L.-C., Tan S., Liu F., Ridgelet theory: From ridgelet transform to curvelet, Chinese Journal of Engineering Mathematics, 22, 5, pp. 761-773, (2005)
  • [5] Do M.N., Martin V., Contourlets: A new directional multiresolution image representation, Signals, Systems and Computers, 1, pp. 497-501, (2002)
  • [6] Jiao L.-C., Sun Q., Advances and perspective on image perception and recognition in multiscale transform domains, Chinese Journal of Computers, 29, 2, pp. 177-193, (2006)
  • [7] Li H.-F., Song W.-W., Wang S.-X., Robust image watermarking algorithm based on contourlet transform, Journal on Communications, 27, 4, pp. 87-94, (2006)
  • [8] Jayalakshmi M., Merchant S.N., Desai U.B., Digital watermarking in contourlet domain, Proceedings of the 18th International Conference on Pattern Recognition, 3, pp. 861-864, (2006)
  • [9] Ali B., Nadia B., Contourlet domain feature extraction for image content authentication, Proceedings of the 2006 International Conference on Intelligentlnformation Hiding and Multimedia Signal Processing, pp. 202-206, (2006)
  • [10] Lin C.-Y., Wu M., Bloom J.A., Cox I.J., Miller M.L., Man L.Y., Rotation, scale, and translation resilient watermarking for images, IEEE Transactions on Image Processing, 10, 5, pp. 765-782, (2001)