Robust image watermarking using local Zernike moments

https://doi.org/10.1016/j.jvcir.2009.04.002Get rights and content

Abstract

In this work, we propose a robust image watermarking algorithm using local Zernike moments, which are computed over circular patches around feature points. The proposed algorithm locally computes Zernike moments and modifies them to embed watermarks, achieving robustness against cropping and local geometric attacks. Moreover, to deal with scaling attacks, the proposed algorithm extracts salient region parameters, which consist of an invariant centroid and a salient scale, and transmits them to the decoder. The parameters are used at the decoder to normalize a suspect image and detect watermarks. Extensive simulation results show that the proposed algorithm detects watermarks with low error rates, even if watermarked images are distorted by various geometric attacks as well as signal processing attacks.

Introduction

Digital images can be easily duplicated without any loss. This feature facilitates the illegal use of copyrighted materials, e.g., unrestricted duplication and dissemination via the Internet. As a result, the piracy makes service providers hesitate to offer services in digital form, in spite of digital imaging equipments replacing analog ones. To overcome this reluctancy and possible copyright issues, the intellectual property rights of digital images should be protected.

To protect copyrighted images, many approaches, including authentication, encryption, and digital watermarking, have been proposed. Encryption methods may guarantee secure transmission of data to authenticated users through unsecured channels. However, once decrypted, the data are identical to the original and their piracy cannot be restricted. Digital watermarking is an alternative approach to deal with these unlawful acts. It hides invisible marks or copyright information in digital contents and claims the copyrights. The marks should be robust enough to survive various attacks. It is also desirable that illegal attempts should cause the degradation of image quality without erasing the watermarks.

With the development of watermarking technologies, attacks against watermarking systems also have become more sophisticated. Those attacks can be classified into signal processing attacks and geometric attacks. Signal processing operations, such as lossy compression, denoising, noise addition, and filtering, reduce the energy of watermarks, while geometric attacks induce synchronization errors between the original and the watermarked images and therefore can mislead the watermark decoder. Most previous watermarking methods provide robustness against signal processing attacks, but only a few specialized methods address geometric attacks. Watermarking schemes to combat geometric attacks can be classified into non-blind schemes, semi-blind schemes, invariant domain embedding, template-based synchronization, and content-based synchronization. Section 2 will review these watermarking schemes.

In this paper, we propose a novel robust image watermarking algorithm. Although there are techniques that deal with geometric attacks, random bending, cropping, and non-isotropic scaling still remain to be difficult attacks. The proposed algorithm embeds watermarks by modifying local Zernike moments (LZMs), which are defined over circular patches around feature points. Unlike the conventional algorithms using moments [1], [2], we compute Zernike moments locally to achieve resilience against cropping. Moreover, to make the proposed algorithm robust against scaling attacks, we extract salient region parameters and transmit them to the decoder. The decoder uses the parameters to normalize a suspect image and detect watermarks. Simulation results demonstrate that the proposed algorithm provides robust performance in various attack scenarios. We presented some of our preliminary results in [3]. In this work, we extend the work in [3] by evaluating the performance of the proposed algorithm more extensively in multiple application scenarios. Moreover, we analyze the false alarm rate of the proposed watermarking algorithm.

The paper is organized as follows. Section 2 reviews conventional synchronization techniques. Section 3 introduces local Zernike moments and a feature point detection scheme. Section 4 describes the proposed watermarking system. Section 5 proposes an image normalization scheme using salient region parameters. Section 6 evaluates the performance of the proposed algorithm. Section 7 concludes the paper.

Section snippets

Conventional synchronization techniques

In this section, we review synchronization techniques in conventional watermarking methods to deal with geometric attacks or distortions.

Local Zernike moments

Zernike [22] introduced a set of complex orthogonal functions with a simple rotational property, which form an orthogonal basis for the class of square integrable functions. Since Teague [23] pioneered the use of Zernike moments in image analysis, Zernike moments have been frequently utilized for various image processing and computer vision tasks [24], [25].

The Zernike basis function is defined asvnm(x,y)=rnm(α)ejmθ,where α=x2+y2,θ=arctan(y/x),n is a non-negative integer, and mDn=0,±2,,±2n2.

Proposed algorithm

As shown in Fig. 2, we consider two application scenarios. In scenario I, we focus on the robust watermarking scheme against non-scaling attacks. In scenario II, we extract salient region parameters and transmit them to the decoder as side information. The decoder uses the parameters to normalize a suspect image and detect watermarks, when a watermarked image passes through scaling attacks as well as non-scaling attacks.

This section describes the proposed watermark embedding and extraction

Image normalization using salient region parameters

As shown in Fig. 2, in scenario II, we employ salient region parameters, which are composed of an invariant centroid and a salient scale, to deal with scaling attacks. At the extractor, we first classify geometric distortions of a suspect image, using the salient region parameters, and normalize the suspect image to invert possible scaling attacks. Then, the watermarks are extracted using the method in Section 4.2.

Experimental results

We first analyze the false alarm rate of the proposed watermarking algorithm. We then compare the performance of the proposed algorithm with that of the conventional algorithms against non-scaling attacks in scenario I. It is unfair to compare them against scaling attacks, since the conventional algorithms do not employ the scheme for normalizing spatial sampling rates. Finally, we evaluate the robustness of the proposed algorithm against scaling as well as non-scaling attacks in scenario II,

Conclusions

An image watermarking algorithm, which is robust against geometric and signal processing attacks, was proposed in this work. The proposed algorithm embeds watermarks locally into LZMs to achieve the robustness against cropping and local geometric attacks. The proposed algorithm extracts salient region parameters and transmits them to the decoder. The parameters are used to normalize a suspect image and detect watermarks at the decoder. Simulation results demonstrated that the proposed algorithm

Acknowledgments

This work was supported partly by the Ministry of Knowledge Economy, Korea, under the Information Technology Research Center support program supervised by the Institute of Information Technology Advancement (Grant No. IITA-2009-C1090-0902-0017) and partly by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MEST) (No. R01-2008-000-20292-0).

References (32)

  • J. Shieh et al.

    A semi-blind digital watermarking scheme based on singular value decomposition

    Computer Standards & Interfaces

    (2006)
  • M. Zhenjiang

    Zernike moment-based image analysis and its application

    Pattern Recogn. Lett.

    (2000)
  • G.A. Papakostas et al.

    A new class of Zernike moments for computer vision applications

    Inf. Sci.

    (2007)
  • Y. Xin, S. Liao, M. Pawlak, A multibit geometrically robust image watermark based on Zernike moments, in: IEEE Int....
  • H.S. Kim et al.

    Invariant image watermark using Zernike moments

    IEEE Trans. Circuits Syst. Video Technol.

    (2003)
  • N. Singhal, Y.-Y. Lee, C.-S. Kim, S.-U. Lee, Robust image watermarking based on local Zernike moments, in: IEEE Int....
  • P. Dong, J. Brankov, N. Galatsanos, Y. Yang, Geometric robust watermarking based on a new mesh model correction...
  • C. Lu et al.

    Cocktail watermarking for digital image protection

    IEEE Trans. Multimedia

    (2000)
  • V.Q. Pham, T. Miyaki, T. Yamasaki, K. Aizawa, Geometrically invariant object-based watermarking using SIFT feature, in:...
  • J. O’Ruanaidh et al.

    Rotation, scale and translation invariant spread spectrum digital image watermarking

    Signal Process.

    (1998)
  • C.-Y. Lin et al.

    Rotation, scale, and translation resilient public watermarking for images

    IEEE Trans. Image Process.

    (2001)
  • S. Pereira et al.

    Robust template matching for affine resistant image watermarks

    IEEE Trans. Image Process.

    (2000)
  • M. Kutter, S.K. Bhattacharjee, T. Ebrahimi, Towards second generation watermarking schemes, in: Proc. IEEE Int. Conf....
  • M. Alghoniemy et al.

    Geometric invariance in image watermarking

    IEEE Trans. Image Process.

    (2004)
  • D. Simitopoulos et al.

    Robust image watermarking based on generalized Radon transformations

    IEEE Trans. Circuits Syst. Video Technol.

    (2003)
  • M. Alghoniemy, A.H. Tewfik, Geometric distortion correction through image normalization, in: Proc. IEEE Int. Conf....
  • Cited by (0)

    View full text