08-08-2012, 11:26 AM
Generic Lossless Visible Watermarking—A New Approach
[attachment=30503]
Abstract
A novel method for generic visible watermarking with a capability of lossless image recovery is proposed. The method is based on the use of deterministic one-to-one compound mappings of image pixel values for overlaying a variety of visible watermarks of arbitrary sizes on cover images. The compound mappings are proved to be reversible, which allows for lossless recovery of original images from watermarked images. The mappings may be adjusted to yield pixel values close to those of desired visible watermarks. Different types of visible watermarks, including opaque monochrome and translucent full color ones, are embedded as applications of the proposed generic approach. A two-fold monotonically increasing compound mapping is created and proved to yield more distinctive visible watermarks in the watermarked image. Security protection measures by parameter and mapping randomizations have also been proposed to deter attackers from illicit image recoveries. Experimental results demonstrating the effectiveness of the proposed approach are also included
Introduction
THE advance of computer technologies and the proliferation of the Internet have made reproduction and distribution of digital information easier than ever before. Copyright protection of intellectual properties has, therefore, become an important topic. One way for copyright protection is digital watermarking, which means embedding of certain specific information about the copyright holder (company logos, ownership descriptions, etc.) into the media to be protected. Digital watermarking methods for images are usually categorized into two types: invisible and visible. The first type aims
to embed copyright information imperceptibly into host media such that in cases of copyright infringements, the hidden information can be retrieved to identify the ownership of the protected host. It is important for the watermarked image to be resistant to common image operations to ensure that the hidden information is still retrievable after such alterations. Methods
of the second type, on the other hand, yield visible watermarks which are generally clearly visible after common image operations are applied. In addition, visible watermarks convey ownership information directly on the media and can deter attempts of copyright violations. Embedding of watermarks, either visible or invisible, degrade the quality of the host media in general. A group of techniques, named reversible watermarking, allow legitimate users to remove the embedded watermark and restore the original content as needed. However, not all reversible watermarking techniques guarantee lossless image recovery, which means that the recovered image is identical to the original, pixel by pixel. Lossless recovery is important in many applications where serious concerns about image quality arise. Some examples include forensics, medical image analysis, historical art imaging, or military applications. Compared with their invisible counterparts, there are relatively few mentions of lossless visible watermarking in the literature.
Existing System
• The most common approach is to compress a portion of the original host and then embed the compressed data together with the intended payload into the host.
• Another approach is to superimpose the spread-spectrum signal of the payload on the host so that the signal is detectable and removable.
• A main approach is to manipulate a group of pixels as a unit to embed a bit of information. Although one may use lossless invisible techniques to embed removable visible watermarks the low embedding capacities of these techniques hinder the possibility of implanting large-sized visible watermarks into host media.
• As to lossless visible watermarking, the most common approach is to embed a monochrome watermark using deterministic and reversible mappings of pixel values or DCT coefficients in the watermark region.
• Another approach is to rotate consecutive watermark pixels to embed a visible watermark. One advantage of these approaches is that watermarks of arbitrary sizes can be embedded into any host image.
• However, only binary visible watermarks can be embedded using these approaches, which is too restrictive since most company logos are colorful.
Proposed System
• A new method for lossless visible watermarking is proposed by using appropriate compound mappings that allow mapped values to be controllable.
• The mappings are proved to be reversible for lossless recovery of the original image. The approach is generic, leading to the possibility of embedding different types of visible watermarks into cover images.
• Two applications of the proposed method are demonstrated, where opaque monochrome watermarks and non uniformly translucent full-color ones are respectively embedded into color images.
• More specific compound mappings are also created and proved to be able to yield visually more distinctive visible watermarks in the watermarked image.
• This is the first method ever proposed for embedding removable translucent full-color watermarks which provide better advertising effects than traditional monochrome ones.
Login and register module:
This module is to register the new users and previously registered users can enter into our project. The Register user only can enter into Proposed Process in our Project. The Other user can view Existing Of our Project
Watermarking:
Watermark is a process of adding extra authority information to the original image. In this module watermark performed in the use transformation. Watermarking used to achieve the high security. Embedding secondary data to original image called a watermark in this module data embedded in the use of key value
Key verification:
The process of removing watermark the key verification performed. If the key verification succeeds the water mark process go to next process otherwise the watermark data visible property changed in that use change easily identify the attackers.
Reverse watermarking:
After the process of key verification the reverse watermark performed .it is the process of removing watermark data the water mark removed if the key verification result is passive.
CONCLUSIONS AND SUGGESTIONS FOR FUTURE WORK
In this paper, a new method for reversible visible watermarking with lossless image recovery capability has been proposed. The method uses one-to-one compound mappings that can map image pixel values to those of the desired visible watermarks. Relevant lemmas and theorems are described
and proved to demonstrate the reversibility of the compound mappings for lossless reversible visible watermarking. The compound mappings allow different types of visible watermarks to be embedded, and two applications have been described for embedding opaque monochrome watermarks as well as translucent full-color ones. A translucent watermark is clearly visible and visually appealing, thus more appropriate than traditional transparent binary watermarks in terms of advertising effect and copyright declaration. The two-fold monotonically increasing property of compound mappings was defined and an implementation proposed that can provably allow mapped values to always be close to the desired watermark if color estimates are accurate.
[attachment=30503]
Abstract
A novel method for generic visible watermarking with a capability of lossless image recovery is proposed. The method is based on the use of deterministic one-to-one compound mappings of image pixel values for overlaying a variety of visible watermarks of arbitrary sizes on cover images. The compound mappings are proved to be reversible, which allows for lossless recovery of original images from watermarked images. The mappings may be adjusted to yield pixel values close to those of desired visible watermarks. Different types of visible watermarks, including opaque monochrome and translucent full color ones, are embedded as applications of the proposed generic approach. A two-fold monotonically increasing compound mapping is created and proved to yield more distinctive visible watermarks in the watermarked image. Security protection measures by parameter and mapping randomizations have also been proposed to deter attackers from illicit image recoveries. Experimental results demonstrating the effectiveness of the proposed approach are also included
Introduction
THE advance of computer technologies and the proliferation of the Internet have made reproduction and distribution of digital information easier than ever before. Copyright protection of intellectual properties has, therefore, become an important topic. One way for copyright protection is digital watermarking, which means embedding of certain specific information about the copyright holder (company logos, ownership descriptions, etc.) into the media to be protected. Digital watermarking methods for images are usually categorized into two types: invisible and visible. The first type aims
to embed copyright information imperceptibly into host media such that in cases of copyright infringements, the hidden information can be retrieved to identify the ownership of the protected host. It is important for the watermarked image to be resistant to common image operations to ensure that the hidden information is still retrievable after such alterations. Methods
of the second type, on the other hand, yield visible watermarks which are generally clearly visible after common image operations are applied. In addition, visible watermarks convey ownership information directly on the media and can deter attempts of copyright violations. Embedding of watermarks, either visible or invisible, degrade the quality of the host media in general. A group of techniques, named reversible watermarking, allow legitimate users to remove the embedded watermark and restore the original content as needed. However, not all reversible watermarking techniques guarantee lossless image recovery, which means that the recovered image is identical to the original, pixel by pixel. Lossless recovery is important in many applications where serious concerns about image quality arise. Some examples include forensics, medical image analysis, historical art imaging, or military applications. Compared with their invisible counterparts, there are relatively few mentions of lossless visible watermarking in the literature.
Existing System
• The most common approach is to compress a portion of the original host and then embed the compressed data together with the intended payload into the host.
• Another approach is to superimpose the spread-spectrum signal of the payload on the host so that the signal is detectable and removable.
• A main approach is to manipulate a group of pixels as a unit to embed a bit of information. Although one may use lossless invisible techniques to embed removable visible watermarks the low embedding capacities of these techniques hinder the possibility of implanting large-sized visible watermarks into host media.
• As to lossless visible watermarking, the most common approach is to embed a monochrome watermark using deterministic and reversible mappings of pixel values or DCT coefficients in the watermark region.
• Another approach is to rotate consecutive watermark pixels to embed a visible watermark. One advantage of these approaches is that watermarks of arbitrary sizes can be embedded into any host image.
• However, only binary visible watermarks can be embedded using these approaches, which is too restrictive since most company logos are colorful.
Proposed System
• A new method for lossless visible watermarking is proposed by using appropriate compound mappings that allow mapped values to be controllable.
• The mappings are proved to be reversible for lossless recovery of the original image. The approach is generic, leading to the possibility of embedding different types of visible watermarks into cover images.
• Two applications of the proposed method are demonstrated, where opaque monochrome watermarks and non uniformly translucent full-color ones are respectively embedded into color images.
• More specific compound mappings are also created and proved to be able to yield visually more distinctive visible watermarks in the watermarked image.
• This is the first method ever proposed for embedding removable translucent full-color watermarks which provide better advertising effects than traditional monochrome ones.
Login and register module:
This module is to register the new users and previously registered users can enter into our project. The Register user only can enter into Proposed Process in our Project. The Other user can view Existing Of our Project
Watermarking:
Watermark is a process of adding extra authority information to the original image. In this module watermark performed in the use transformation. Watermarking used to achieve the high security. Embedding secondary data to original image called a watermark in this module data embedded in the use of key value
Key verification:
The process of removing watermark the key verification performed. If the key verification succeeds the water mark process go to next process otherwise the watermark data visible property changed in that use change easily identify the attackers.
Reverse watermarking:
After the process of key verification the reverse watermark performed .it is the process of removing watermark data the water mark removed if the key verification result is passive.
CONCLUSIONS AND SUGGESTIONS FOR FUTURE WORK
In this paper, a new method for reversible visible watermarking with lossless image recovery capability has been proposed. The method uses one-to-one compound mappings that can map image pixel values to those of the desired visible watermarks. Relevant lemmas and theorems are described
and proved to demonstrate the reversibility of the compound mappings for lossless reversible visible watermarking. The compound mappings allow different types of visible watermarks to be embedded, and two applications have been described for embedding opaque monochrome watermarks as well as translucent full-color ones. A translucent watermark is clearly visible and visually appealing, thus more appropriate than traditional transparent binary watermarks in terms of advertising effect and copyright declaration. The two-fold monotonically increasing property of compound mappings was defined and an implementation proposed that can provably allow mapped values to always be close to the desired watermark if color estimates are accurate.