scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Novel blind multiple watermarking technique for images

TL;DR: Experimental results show that embedded watermarks using the proposed techniques can give good image quality and are robust in varying degree to JPEG compression, low-pass filtering, noise contamination, and print-and-scan.
Abstract: Three novel blind watermarking techniques are proposed to embed watermarks into digital images for different purposes. The watermarks are designed to be decoded or detected without the original images. The first one, called single watermark embedding (SWE), is used to embed a watermark bit sequence into digital images using two secret keys. The second technique, called multiple watermark embedding (MWE), extends SWE to embed multiple watermarks simultaneously in the same watermark space while minimizing the watermark (distortion) energy. The third technique, called iterative watermark embedding (IWE), embeds watermarks into JPEG-compressed images. The iterative approach of IWE can prevent the potential removal of a watermark in the JPEG recompression process. Experimental results show that embedded watermarks using the proposed techniques can give good image quality and are robust in varying degree to JPEG compression, low-pass filtering, noise contamination, and print-and-scan.
Figures (36)

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: This paper is geared toward signal processing practitioners by emphasizing the practical digital realizations and applications of the FRFT, which is closely related to other mathematical transforms, such as time-frequency and linear canonical transforms.

335 citations


Cites background from "Novel blind multiple watermarking t..."

  • ...Watermarking [82–84,86–97]...

    [...]

  • ...Both of these techniques are closely monitored and followed by numerous researchers [88–97]....

    [...]

Journal ArticleDOI
TL;DR: Two oblivious watermarking methods for 3-D polygonal mesh models, which modify the distribution of vertex norms according to the watermark bit to be embedded, are proposed, which are remarkably robust against distortionless attacks.
Abstract: Although it has been known that oblivious (or blind) watermarking schemes are less robust than nonoblivious ones, they are more useful for various applications where a host signal is not available in the watermark detection procedure. From a viewpoint of oblivious watermarking for a three-dimensional (3-D) polygonal mesh model, distortionless attacks, such as similarity transforms and vertex reordering, might be more serious than distortion attacks including adding noise, smoothing, simplification, remeshing, clipping, and so on. Clearly, it is required to develop an oblivious watermarking that is robust against distortionless as well as distortion attacks. In this paper, we propose two oblivious watermarking methods for 3-D polygonal mesh models, which modify the distribution of vertex norms according to the watermark bit to be embedded. One method is to shift the mean value of the distribution and another is to change its variance. Histogram mapping functions are introduced to modify the distribution. These mapping functions are devised to reduce the visibility of watermark as much as possible. Since the statistical features of vertex norms are invariant to the distortionless attacks, the proposed methods are robust against such attacks. In addition, our methods employ an oblivious watermark detection scheme, which can extract the watermark without referring to the cover mesh model. Through simulations, we demonstrate that the proposed approaches are remarkably robust against distortionless attacks. In addition, they are fairly robust against various distortion attacks

209 citations


Cites background from "Novel blind multiple watermarking t..."

  • ...For examples, owner identification and copy control systems cannot refer to original data [20–22]....

    [...]

Proceedings ArticleDOI
25 Oct 2004
TL;DR: The experiments indicate that first level decomposition appear advantageous for two reasons: the area for watermark embedding is maximized, and the extracted watermarks are more textured with better visual quality.
Abstract: Because of the transition from analog to digital technologies, content owners are seeking technologies for the protection of copyrighted multimedia content. Encryption and watermarking are two major tools that can be used to prevent unauthorized consumption and duplication. In this paper, we generalize an idea in a recent paper that embeds a binary pattern in the form of a binary image in the LL and HH bands at the second level of Discrete Wavelet Transform (DWT) decomposition. Our generalization includes all four bands (LL, HL, LH, and HH), and a comparison of embedding a watermark at first and second level decompositions. We tested the proposed algorithm against fifteen attacks. Embedding the watermark in lower frequencies is robust to a group of attacks, and embedding the watermark in higher frequencies is robust to another set of attacks. Only for rewatermarking and collusion attacks, the watermarks extracted from all four bands are identical. Our experiments indicate that first level decomposition appear advantageous for two reasons: The area for watermark embedding is maximized, and the extracted watermarks are more textured with better visual quality.

155 citations

Journal ArticleDOI
TL;DR: The experimental results show that the proposed scheme provides not only good image quality, but is also robust against various attacks, such as JPEG lossy compression, filtering and noise addition.

109 citations


Additional excerpts

  • ...Keywords: Digital watermarking; Copyright protection; Wavelet transform...

    [...]

Journal ArticleDOI
TL;DR: An effective video watermarking method based on a pseudo-3-D discrete cosine transform (DCT) and quantization index modulation (QIM) against several attacks is proposed that can survive filtering, compressions, luminance change, and noise attacks with a good invisibility and robustness.
Abstract: The increasing popularity of the internet means that digital multimedia are transmitted more rapidly and easily. And people are very aware for media ownership. However, digital watermarking is an efficient and promising means to protect intellectual properties. Based on the intellectual property attention in the information era, how to protect the personal ownership is extremely important and a necessary scheme. In this paper, we propose an effective video watermarking method based on a pseudo-3-D discrete cosine transform (DCT) and quantization index modulation (QIM) against several attacks. The watermark is mainly inserted into the uncompressed domain by adjusting the correlation between DCT coefficients of the selected blocks, and the watermark extraction is blind. This approach consists of a pseudo-3-D DCT, watermark embedding, and extraction. A pseudo-3-D DCT, which is taken DCT transformation twice, will be first utilized to calculate the embedding factor and to obtain the useful messages. Using the QIM, we embed the watermark into the quantization regions from the successive raw frames in the uncompressed domain and record the relative information to create a secret embedding key. This secret embedding key will further apply to extraction. Experimental results demonstrate that the proposed method can survive filtering, compressions, luminance change, and noise attacks with a good invisibility and robustness.

103 citations


Cites methods from "Novel blind multiple watermarking t..."

  • ...To obtain the adaptive watermark embedding information, we used QIM [6], [16], [22]–[24] to obtain the relevant message....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: It is argued that insertion of a watermark under this regime makes the watermark robust to signal processing operations and common geometric transformations provided that the original image is available and that it can be successfully registered against the transformed watermarked image.
Abstract: This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio, video, and multimedia data. We advocate that a watermark should be constructed as an independent and identically distributed (i.i.d.) Gaussian random vector that is imperceptibly inserted in a spread-spectrum-like fashion into the perceptually most significant spectral components of the data. We argue that insertion of a watermark under this regime makes the watermark robust to signal processing operations (such as lossy compression, filtering, digital-analog and analog-digital conversion, requantization, etc.), and common geometric transformations (such as cropping, scaling, translation, and rotation) provided that the original image is available and that it can be successfully registered against the transformed watermarked image. In these cases, the watermark detector unambiguously identifies the owner. Further, the use of Gaussian noise, ensures strong resilience to multiple-document, or collusional, attacks. Experimental results are provided to support these claims, along with an exposition of pending open problems.

6,194 citations


"Novel blind multiple watermarking t..." refers background or methods in this paper

  • ...While most schemes embed only a single watermark, some allow for multiple watermark embedding [1], [6], [19], [23]....

    [...]

  • ...[1] assumes the multiple watermarks are close to orthogonal and simply extend the single watermark algorithms to embed them together....

    [...]

  • ...[1] uses spread spectrum to embed watermark in the discrete cosine transform (DCT) domain....

    [...]

Book
24 Oct 2001
TL;DR: Digital Watermarking covers the crucial research findings in the field and explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied.
Abstract: Digital watermarking is a key ingredient to copyright protection. It provides a solution to illegal copying of digital material and has many other useful applications such as broadcast monitoring and the recording of electronic transactions. Now, for the first time, there is a book that focuses exclusively on this exciting technology. Digital Watermarking covers the crucial research findings in the field: it explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied. As a result, additional groundwork is laid for future developments in this field, helping the reader understand and anticipate new approaches and applications.

2,849 citations


"Novel blind multiple watermarking t..." refers background in this paper

  • ...Those requiring the secret keys but not the original data are called public or blind watermark schemes [2]....

    [...]

Journal ArticleDOI
TL;DR: The experimental results show that the proposed image authentication technique by embedding digital "watermarks" into images successfully survives image processing operations, image cropping, and the Joint Photographic Experts Group lossy compression.
Abstract: An image authentication technique by embedding digital "watermarks" into images is proposed. Watermarking is a technique for labeling digital pictures by hiding secret information into the images. Sophisticated watermark embedding is a potential method to discourage unauthorized copying or attest the origin of the images. In our approach, we embed the watermarks with visually recognizable patterns into the images by selectively modifying the middle-frequency parts of the image. Several variations of the proposed method are addressed. The experimental results show that the proposed technique successfully survives image processing operations, image cropping, and the Joint Photographic Experts Group (JPEG) lossy compression.

892 citations


"Novel blind multiple watermarking t..." refers background or methods in this paper

  • ...While most schemes embed only a single watermark, some allow for multiple watermark embedding [1], [6], [19], [23]....

    [...]

  • ...[5], [6] embeds watermark bits by modifying the polarity of DCT...

    [...]

Journal ArticleDOI
TL;DR: Analysis of a spread-spectrum-like discrete cosine transform (DCT) domain watermarking technique for copyright protection of still digital images is analyzed and analytical expressions for performance measures are derived and contrasted with experimental results.
Abstract: A spread-spectrum-like discrete cosine transform (DCT) domain watermarking technique for copyright protection of still digital images is analyzed. The DCT is applied in blocks of 8/spl times/8 pixels, as in the JPEG algorithm. The watermark can encode information to track illegal misuses. For flexibility purposes, the original image is not necessary during the ownership verification process, so it must be modeled by noise. Two tests are involved in the ownership verification stage: watermark decoding, in which the message carried by the watermark is extracted, and watermark detection, which decides whether a given image contains a watermark generated with a certain key. We apply generalized Gaussian distributions to statistically model the DCT coefficients of the original image and show how the resulting detector structures lead to considerable improvements in performance with respect to the correlation receiver, which has been widely considered in the literature and makes use of the Gaussian noise assumption. As a result of our work, analytical expressions for performance measures, such as the probability of errors in watermark decoding and the probabilities of false alarms and of detection in watermark detection, are derived and contrasted with experimental results.

747 citations


"Novel blind multiple watermarking t..." refers methods in this paper

  • ...[11], [12] uses 2-D multipulse amplitude modulation and spread spectrum to embed bit sequences in digital images and develops an optimal detector....

    [...]

Journal ArticleDOI
Ching-Yung Lin1, Min Wu2, Jeffrey Adam Bloom2, Ingemar J. Cox, Matthew L. Miller, Yui Man Lui 
IBM1, NEC2
TL;DR: It is shown that the watermark is robust to rotation, scale, and translation, and tests examining the watermarks resistance to cropping and JPEG compression.
Abstract: Many electronic watermarks for still images and video content are sensitive to geometric distortions. For example, simple rotation, scaling, and/or translation (RST) of an image can prevent blind detection of a public watermark. In this paper, we propose a watermarking algorithm that is robust to RST distortions. The watermark is embedded into a one-dimensional (1-D) signal obtained by taking the Fourier transform of the image, resampling the Fourier magnitudes into log-polar coordinates, and then summing a function of those magnitudes along the log-radius axis. Rotation of the image results in a cyclical shift of the extracted signal. Scaling of the image results in amplification of the extracted signal, and translation of the image has no effect on the extracted signal. We can therefore compensate for rotation with a simple search, and compensate for scaling by using the correlation coefficient as the detection measure. False positive results on a database of 10 000 images are reported. Robustness results on a database of 2000 images are described. It is shown that the watermark is robust to rotation, scale, and translation. In addition, we describe tests examining the watermarks resistance to cropping and JPEG compression.

714 citations


"Novel blind multiple watermarking t..." refers background in this paper

  • ...[16] embeds a watermark in the Fourier-Mellin transform domain....

    [...]