scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Digital Watermark Algorithm Based on Embedding Gray Image into Color Image

TL;DR: An algorithm that gray image as watermark is embedded in original color-image is introduced that thinks over both unobtrusiveness and robustness, and the size of image is unlimited.
Abstract: Recently, as the fast development of the computer network communication technology, it’s more and more convenient for the digital information storage and transmission. Therefore, more and more attention is focused on the copyright protection of digital information. An algorithm that gray image as watermark is embedded in original color-image is introduced. This algorithm thinks over both unobtrusiveness and robustness, and the size of image is unlimited. So it has strongly practical significance.
Citations
More filters
Proceedings ArticleDOI
01 Dec 2014
TL;DR: Overall, the experimental analysis shows that the equal distribution of gray watermark over RGB components with PSO optimized scaling factors provides significant improvement in the quality of watermarked image and thequality of retrieved watermark even from the distorted water marked image.
Abstract: The present study is conducted in two phases. In the first phase we analyze the different aspects of gray image watermarking in a colored host. Robustness and imperceptibility are used as analysis parameters. The approaches explored and compared in this study are — watermark embedding with any one of the three RGB (Red-Green-Blue) components (single channel embedding), multichannel watermark embedding (same watermark with all channels) and multichannel embedding with equally segmented watermark. SVD (Singular Value Decomposition) is used to calculate the singular values of host image and then appropriate scaling factor isused to embed the watermark and the watermarked image is subjected to different attacks. To secure the watermark from an unauthorized access Arnold transform is implemented. From the simulation results it is observed that segmented watermark approach is better than the other two approaches in terms of both robustness and imperceptibility. In the second phase, change of robustness and imperceptibility is studied with the change of scaling factor for which PSO (Particle swarm optimization) is employed to determine the optimal values of scaling factor. The results here indicate that the use of different scaling factors (optimal) for each RGB component provides better result in comparison to a single (optimal) scaling factor in segmented multichannel approach. Overall, the experimental analysis shows that the equal distribution of gray watermark over RGB components with PSO optimized scaling factors provides significant improvement in the quality of watermarked image and the quality of retrieved watermark even from the distorted watermarked image.

14 citations


Cites methods from "Digital Watermark Algorithm Based o..."

  • ...There are various breakup techniques available in the literature for color images like HSI [10], YIQ [11] RGB [12-13],Lab decomposition [14], and YCbCr [15]out of which RGB is apparently the most popular space and is used in development of several algorithms[16-21]....

    [...]

Journal Article
TL;DR: An entropy- based method is developed for selection of DWT coefficients that provides an adaptive way for determining the number of watermarked coefficients and watermarking factor at each level ofDWT decomposition.
Abstract: A new approach for non- blind watermarking of still gray level images in the wavelet domain. The method uses the Human Visual System (HVS) characteristic, and an innovative entropy based approach to create an efficient watermarking scheme is presented in this paper. It decomposes original image in DWT domain in to three hierarchical levels and watermarks it with a logo image, which is scrambled through a well- known PN- sequence. An entropy- based method is developed for selection of DWT coefficients that provides an adaptive way for determining the number of watermarked coefficients and watermarking factor at each level of DWT decomposition. This approach shows an excellent resistance against almost all the attacks known in the watermarking literature. The detection results of the method reveal better resistance in comparison to the existance methods.With simple modifications, the method can be used for color images and in real time systems.

14 citations

Proceedings ArticleDOI
22 Dec 2011
TL;DR: The proposed method demonstrates that color image watermarking is possible without affecting its visual quality and also allows for reasonable compromise between robustness and invisibility of watermarks.
Abstract: In this paper we propose a new invisible, non-blind digital watermarking scheme for color images based on singular vector domain (SVD). In this new approach, same or different watermarks can be embedded into the three color channels (R, G, B) of the host image in order to increase the robustness of the watermark. The proposed method demonstrates that color image watermarking is possible without affecting its visual quality and also allows for reasonable compromise between robustness and invisibility of watermarks. This research, based on our earlier work, consists of embedding a gray watermark into a gray host and a color watermark into a color host based on the singular vector domain. The main feature of our scheme is to use all channels of RGB color space to embed watermarks. Hence we are embedding maximum amount of watermark and also make it more secure. The other feature of our scheme is that it can be used for a variety of applications since we can perform single channel embedding to multichannel embedding. We then show our simulation results for one channel, two channel and three channel and also results for how it behaves under various attacks.

10 citations


Cites methods from "Digital Watermark Algorithm Based o..."

  • ...The other feature of our scheme is that it can be used for a variety of applications since we can perform single channel embedding to multichannel embedding....

    [...]

Proceedings ArticleDOI
14 Dec 2011
TL;DR: The proposed method implemented using a graphical user interface (GUI) to open, select, attack, evaluate and display the results of both the host image and colour watermark image is much easier for the end users to learn more than the traditional algorithms that need commands to be know and memorized.
Abstract: This paper presents a new copyright protection technique using colour watermarks. The watermark is a RGB colour image where each pixel is represented by 24 bits. The RGB colour watermark is first preprocessed by converting it into binary sequence. The preprocessed colour watermark (binary image) is embedded multi-times into the green channel of the RGB host image by modifying the very low frequency coefficients of the DCT transformation. The new technique can resist classical attacks such as JPEG compression, low pass filtering, median filtering, cropping, and scaling attacks. Moreover, the recovery method is blind since it does not need the original host image for extraction. The proposed method implemented using a graphical user interface (GUI) to open, select, attack, evaluate and display the results of both the host image and colour watermark image. The implemented GUI is much easier for the end users to learn more than the traditional algorithms that need commands to be know and memorized.

4 citations

01 Jan 2013
TL;DR: This paper presents a new watermarking scheme based on Two Dimensional Cellular Automata Game-of-Life for color images in spatial domain, in which the two most significant bits of gray watermark pixels are embedded into the color host image pixels in the blue component.
Abstract: This paper presents a new watermarking scheme based on Two Dimensional Cellular Automata Game-of-Life for color images in spatial domain. This scheme utilizes the live cells of Game-of-Life generations, in which the two most significant bits of gray watermark pixels are embedded into the color host image pixels in the blue component. The proposed scheme depends on the positions of cells that have the value of one in Game-of-Life generations. The watermark extraction can be performed without the original image, and watermark image is hidden inside the original image. Simulation results demonstrate that the watermark is not visible in watermarked image. The proposed method is secure to resist any passive attacks even though the algorithm is open and robust against various image processing operations.

2 citations

References
More filters
Journal ArticleDOI
01 Jul 1999
TL;DR: The basic concepts of watermarking systems are outlined and illustrated with proposed water marking methods for images, video, audio, text documents, and other media.
Abstract: Multimedia watermarking technology has evolved very quickly during the last few years. A digital watermark is information that is imperceptibly and robustly embedded in the host data such that it cannot be removed. A watermark typically contains information about the origin, status, or recipient of the host data. In this tutorial paper, the requirements and applications for watermarking are reviewed. Applications include copyright protection, data monitoring, and data tracking. The basic concepts of watermarking systems are outlined and illustrated with proposed watermarking methods for images, video, audio, text documents, and other media. Robustness and security aspects are discussed in detail. Finally, a few remarks are made about the state of the art and possible future developments in watermarking technology.

1,447 citations


"Digital Watermark Algorithm Based o..." refers background or methods in this paper

  • ...Its steps are as follows: (1) Convert original color image and color image containing watermark from RGB color space into YIQ color space....

    [...]

  • ...The steps of watermark embedding algorithm are as follows: (1) Convert color space--- convert the original color image into YIQ color space....

    [...]

Proceedings ArticleDOI
26 Oct 1997
TL;DR: A new multiresolution watermarking method based on the discrete wavelet transform (DWT), where Pseudo-random codes are added to the large coefficients at the high and middle frequency bands of the DWT of an image.
Abstract: We introduce a new multiresolution watermarking method for digital images. The method is based on the discrete wavelet transform (DWT). Pseudo-random codes are added to the large coefficients at the high and middle frequency bands of the DWT of an image. It is shown that this method is more robust to often proposed methods to some common image distortions, such as the wavelet transform based image compression, and image halftoning. Moreover, the method is hierarchical. The computation load needed to detect the watermark depends on the noise level in an image.

441 citations

Proceedings ArticleDOI
TL;DR: An overview of wavelet-based watermarking techniques available today can be found in this paper, where the authors provide an overview of the wavelet wavelet transform domain and its application in image compression.
Abstract: In this paper, we will provide an overview of the wavelet-based watermarking techniques available today. We will see how previously proposed methods such as spread-spectrum watermarking have been applied to the wavelet transform domain in a variety of ways and how new concepts such as the multi-resolution property of the wavelet image decomposition can be exploited. One of the main advantages of watermarking in the wavelet domain is its compatibility with the upcoming image coding standard, JPEG2000. Although many wavelet-domain watermarking techniques have been proposed, only few fit the independent block coding approach of JPEG2000. We will illustrate how different watermarking techniques relate to image compression and examine the robustness of selected watermarking algorithms against image compression.

302 citations

Journal ArticleDOI
TL;DR: A wavelet-based watermark casting scheme and a blind watermark retrieval technique that can detect the embedded watermark without the help from the original image are investigated.
Abstract: A wavelet-based watermark casting scheme and a blind watermark retrieval technique are investigated in this research An adaptive watermark casting method is developed to first determine significant wavelet subbands and then select a couple of significant wavelet coefficients in these subbands to embed watermarks A blind watermark retrieval technique that can detect the embedded watermark without the help from the original image is proposed Experimental results show that the embedded watermark is robust against various signal processing and compression attacks

155 citations


"Digital Watermark Algorithm Based o..." refers background in this paper

  • ...(4) The watermark wavelet first-level coefficients ( , ) w u v are wavelet reconstructed to get the gray image as watermark....

    [...]

  • ...( , ) ( , )(1 ( , )) F u v F u v aW u v = + (4) Other high-frequency parts are calculated by the following formula: ....

    [...]

  • ...(4) Finally, carry out wavelet reconstruction for the coefficients embedded into watermark to form the image embedded watermark....

    [...]

01 Jan 2007
TL;DR: This paper discusses fragile marking systems and their desirable features, common methods of attack, and survey some recent marking systems.
Abstract: 1. ABSTRACT Many image watermarks have been proposed to protect intellectual property in an age where digital images may be easily modified and perfectly reproduced. In a fragile marking system, a signal (watermark) is embedded within an image such that subsequent alterations to the watermarked image can be detected with high probability. The insertion of the watermark is perceptually invisible under normal human observation. These types of marks have found applicability in image authentication systems. In this paper we discuss fragile marking systems and their desirable features, common methods of attack, and survey some recent marking systems.

143 citations


Additional excerpts

  • ...[ ( , ) ( , )] ( , ) f u v f u v w u v a ι − = (7)...

    [...]