Geometrically Robust Image Watermarking on a Circular Domain

نویسندگان

  • Yongqing Xin
  • Simon Liao
چکیده

In image watermarking, the watermark’s vulnerability to geometric transformations has long been a difficult problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem. In this paper, a multibit geometrically robust image watermarking algorithm using Zernike moments (ZMs) and pseudo-Zernike moments (PZMs) is proposed. Unlike its counterparts in literature, this algorithm is based on our finding that not all the ZMs/PZMs are suitable for invariant watermarking. We distinguish the ’good’ ZMs/PZMs from the ’bad’ ones. By avoiding embedding watermarks onto the ’bad’ ZMs/PZMs, we have achieved impressively good watermarking results. For some selected ’good’ ZMs/PZMs of an image, dither modulation is employed to quantize their magnitudes in order to embed an array of bits. The watermarked image is obtained via reconstruction from the modified moments and those left intact. In watermark extraction, the embedded bits are estimated from the invariant magnitudes of the ZMs/PZMs using a minimum distance decoder. Simulation results show that the embedded information can be decoded at low error rates, robust against image rotation, scaling, flipping, and as well, a variety of other processes such as additive noise and lossy compression.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization

This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...

متن کامل

A Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization

This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...

متن کامل

Combining Interest Point and Invariant Moment for Geometrically Robust Image Watermarking

This paper presents a new robust image watermarking scheme for resisting both traditional and geometric attacks. A watermark synchronization scheme is first presented using image features. Harris interest points are first extracted from the scale normalized image and the locally most stable points are employed to generate some non-overlapped circular regions. Watermark synchronization is achiev...

متن کامل

An improved hybrid image watermarking scheme in shearlet and wavelet domain

Watermarking is one of the best solutions for copyright protection and authentication of multimedia contents. In this paper a hybrid scheme is proposed using wavelet and shearlet transforms with singular value decomposition. For better security, Arnold map is used for encryption. Examining the results and comparing with other methods show that this hybrid proposed scheme with simultaneous utili...

متن کامل

A Robust Digital Image Watermarking Scheme Based on DWT

In this paper a wavelet-based logo watermarking scheme is presented. The logo watermark is embedded into all sub-blocks of the LLn sub-band of the transformed host image, using quantization technique. Extracted logos from all sub-blocks are merged to make the extracted watermark from distorted watermarked image. Knowing the quantization step-size, dimensions of logo and the level of wavelet tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004