A Print-Scan Resilient Image Watermarking Scheme Based on Radon Transform

2014 ◽  
Vol 687-691 ◽  
pp. 3812-3817
Author(s):  
Yong Gang Fu

In this paper, a print-scan resilient image watermarking scheme based on Radon transform and DCT(discrete cosine transform) is proposed. The watermark is preprocessed with a chaotic sequence, then the host image is transformed to frequency domain by block DCT. The preprocessed watermark is adaptively embedded into the transform domain coefficients by modulating the relationship between neighbor coefficients. The watermark detection process is accomplished without referring to the original image. Simulation results show good robustness against several attacks, such Jpeg compression, cropping, filtering and so on.

Author(s):  
T Mita Kumari

This paper proposes a novel blind image adaptive watermarking scheme in Discrete Wavelet Transform (DWT) domain for copyright protection or robust tagging applications. Watermarking scheme effectively utilizes the contrast sensitivity model of Human Visual System (HVS) to embed the watermark adaptively without degradation of the original image. Watermark can be extracted without referring to the original image. Simulation results show the robustness of the proposed algorithm against various attacks.


2010 ◽  
Vol 19 (02) ◽  
pp. 491-502 ◽  
Author(s):  
YONG-GANG FU ◽  
RUIMIN SHEN

In this paper, a novel image watermarking scheme based on a self-reference technique is proposed. The meaningful watermark is embedded into a gray-level image according to the relation between the constructed reference image and the original host. In order to be robust against Jpeg compression, the reference image should be robust under Jpeg compression. Firstly, the original image is transformed into DCT domain; and then most of the high frequency coefficients are omitted; after the quantization step and inverse DCT transform, we can obtain a robust reference. By considering the relation between the original image and its reference, we can embed the watermark into the host. The watermark extraction process is oblivious. Experimental results under several attacks show good robustness of the proposed scheme. Especially under cropping and Jpeg compression attacks, the watermark can be extracted with only few errors.


Author(s):  
Sudipta Kr Ghosal ◽  
Jyotsna Kumar Mandal

In this chapter, a fragile watermarking scheme based on One-Dimensional Discrete Hartley Transform (1D-DHT) has been proposed to verify the authenticity of color images. One-Dimensional Discrete Hartley Transform (1D-DHT) converts each 1 x 2 sub-matrix of pixel components into transform domain. Watermark (along with a message digest MD) bits are embedded into the transformed components in varying proportion. To minimize the quality distortion, genetic algorithm (GA) based optimization is applied which yields the optimized component corresponding to each embedded component. Applying One-Dimensional Inverse Discrete Hartley Transform (1D-IDHT) on 1 x 2 sub-matrices of embedded components re-generates the pixel components in spatial domain. The reverse approach is followed by the recipient to retrieve back the watermark (along with the message digest MD) which in turn is compared against the re-computed Message Digest (MD') for authentication. Simulation results demonstrate that the proposed technique offers variable payload and less distortion as compared to existing schemes.


2014 ◽  
Vol 543-547 ◽  
pp. 2304-2307
Author(s):  
Rui Song Ye ◽  
Hui Qing Huang ◽  
Rui Feng Chen

A color image watermarking scheme using the chaotic properties of 2D tent map and Chebyshev map is proposed. Given control parameters and initial values, one can iterate the 2D tent map to get one chaotic sequence and obtain one permutation by sorting the chaotic sequence in ascending order. The permutation is then utilized to shuffle the blue channel components of color image as a preprocessing stage to enhance the security, imperceptibility and robustness of watermarking. Meanwhile, one can iterate the Chebyshev map to generate another chaotic sequence to determine the embedding bit positions and strengthen the security as well. Experiment results show that the watermarking scheme is secure with large key space, imperceptible and robust against cropping, noise attacks.


2016 ◽  
Vol 9 (2) ◽  
pp. 99
Author(s):  
Khadija Jamali ◽  
Mohamed El Aroussi ◽  
Azz El Arab El Hossaini ◽  
Samir Mbarki ◽  
Mohammed Wahbi

<span style="font-size: 10.5pt; font-family: 'Times New Roman','serif'; mso-bidi-font-size: 12.0pt; mso-fareast-font-family: 宋体; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">In the digital world in which we are living, the intellectual property protection becomes a concern especially with the proliferation of files transfer over networks. The ability to access data such as text, images, video, and audio has become quicker and easier for people with little to no knowledge of technology. In this paper, a robust watermarking scheme based on the original image content is proposed and simulated. Steerable pyramid transform is used as an embedding domain to its good spatial-frequency characteristics, and its wide applications in the image/video coding standards. The embedding process aims to insert some information in a digital document to identify its owner later. This process requires the original image to be protected and the watermark image related to the image’s owner. It needs also a threshold value used by Sobel-Feldman operator to extract the original image features. The embedding of the watermark image is performed in high frequency components of the original image. Experimental evaluation demonstrates that the proposed watermarking scheme is able to withstand a variety of attacks and at the same time provide good visual quality of the watermarked image.</span>


Sign in / Sign up

Export Citation Format

Share Document