Geometrically invariant color image watermarking scheme using feature points

Wang, Xiangyang; Liu, Meng; Yang, Heng

doi:10.1007/s11432-009-0125-6

Cited by 8 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To resist the geometric transformation attacks, instead of embedding a watermark into the whole image region, some region-level watermarking schemes [19][20][21][22][23][24][25] embedded watermark into a set of invariant local regions detected by region detectors such as scale-invariant feature transform [26] and speed-up robust feature detector [27]. It has been proven that these region-level watermarking schemes have shown high robustness to the common geometric transformations including rotation, scaling and shifting, since the content of detected local regions used for watermark extraction is invariant under these attacks.…”

Section: Introductionmentioning

confidence: 99%

Geometric correction code‐based robust image watermarking

Zhou

Zhu

et al. 2021

IET Image Processing

View full text Add to dashboard Cite

Digital image watermarking is one of the effective schemes to protect the copyrights of still images. However, the existing watermarking schemes are still not robust enough to the common geometric transformation attacks such as arbitrary rotation, scaling and shifting with desirable hiding capacity. To address this issue, we propose a robust watermarking scheme based on geometric correction codes (GCCs). In this scheme, the watermark and pre‐set GCCs are combined and embedded into a cover image to obtain the watermarked image. At the stage of watermark extraction, the watermarked image, under a variety of geometric transformation attacks, can be geometrically corrected by minimising the difference between the extracted and the original GCCs, then the watermark is extracted from the watermarked image. The experiments demonstrate that, compared to the typical watermarking schemes, the proposed scheme achieves much higher robustness to the common geometric transformation attacks and comparable invisibility with the same embedding capacity.

show abstract

Section: Introductionmentioning

confidence: 99%

Geometric correction code‐based robust image watermarking

Zhou

Zhu

et al. 2021

IET Image Processing

View full text Add to dashboard Cite

show abstract

“…Other than the orders to be used, some Zernike moments are more suitable for robust watermarking than others. This is because the invariance properties of some Zernike moments are compromised due to geometric error of a unit disk clipping, approximation error of Zernike polynomial integration or interpolation error of rotated and resized images [123][124][125].…”

Section: Zernike Momentsmentioning

confidence: 99%

Robust image watermarking against geometric attacks

Dong¹

View full text Add to dashboard Cite

The recent progress in digital multimedia technologies has offered many facilities in transmission, reproduction and manipulation of digital contents. However, this advance in technology has also brought the problems such as copyright protection and ownership verification. One of the proposed solutions to such problems is digital watermarking. In the design of a robust watermarking scheme, the most important requirement is robustness. For image watermarking, improving the robustness against geometric attacks is one of the challenges in the field of digital watermarking. Thus, the work presented in this thesis is concerned with the design of robust image watermarking schemes against geometric attacks as well as image processing operations. A normalization-based robust image watermarking is proposed and implemented in the thesis. The proposed scheme utilizes image normalization and singular value decomposition (SVD) to embed robust watermarks. The watermark embedding process is performed in a composite transform domain achieved by SVD and discrete cosine transform (DCT). A watermark bit is embedded in the mid-frequency band by imposing a particular relationship between two pseudo-randomly selected DCT coefficients. High robustness and image fidelity can be achieved. Another robust watermarking scheme is also presented in the thesis. The procedures of feature point extraction are first demonstrated. The invariance properties of image feature points and Zernike moments are then investigated and tested. Several circular patches centered on feature points are generated as stable carriers of watermark information. The watermark bits are embedded by quantizing the magnitudes of local Zernike moments. Experimental results show that vi the number of correctly extracted watermark bits is still large enough to prove the ownership even when the watermarked images are severely distorted. All effects of geometric attacks can be converted to translations in a log-polar mapping (LPM) representation. Based on this, a watermark synchronization technique is described. The discrete Fourier transform and LPM are applied to original host image to achieve an invariant domain. The watermark is embedded by adaptively modifying LPM magnitude coefficients. This technique is robust against geometric attacks and common image processing operations. The recommendations for future research are also given based on the limitations of proposed watermarking schemes.

show abstract

A Novel Pyramidal Dual-Tree Directional Filter Bank Domain Color Image Watermarking Algorithm

Niu

Wang

2011

Information and Communications Security

View full text Add to dashboard Cite

Geometrically invariant color image watermarking scheme using feature points

Cited by 8 publications

References 12 publications

Geometric correction code‐based robust image watermarking

Geometric correction code‐based robust image watermarking

Robust image watermarking against geometric attacks

A Novel Pyramidal Dual-Tree Directional Filter Bank Domain Color Image Watermarking Algorithm

Contact Info

Product

Resources

About