A Novel Adaptive Pixel Retaining Approach for Robust Watermarking Using Histogram Intersection Technique

2019 ◽  
Vol 16 (2) ◽  
pp. 702-708
Author(s):  
D. Devi ◽  
N. Kalaivani ◽  
J. Anandhi

Imperceptibility criterion as, the host image is intellectual property that the owners want to protect. It should be visually the increased usage of digitized data for communication leads to the high demand in the copyright protection of the data. This proposed watermarking technique helps to highly improve the capacity of embedding watermark without affecting the imperceptibility and robustness. The approach couples the idea of building analysis rule in generating the watermark, thereby increasing the capacity of embedding watermark. The approach is additionally guided with Histogram Intersection technique to improve the confidentiality of watermark. The APRA (Adaptive Pixel Retaining Approach) Algorithm helps to improve the imperceptibility of the extracted watermark. Watermark is embedded in host image by Singular Value Decomposition (SVD). The APRA Algorithm helps to rebuild the extracted watermark in such a way that it remains close to the original watermark. With the available dataset, the experiments are performed and obtained results shows that the proposed watermarking technique yields watermarked images with high imperceptibility and robustness to common attacks.

2009 ◽  
Vol 09 (03) ◽  
pp. 449-477 ◽  
Author(s):  
GAURAV BHATNAGAR ◽  
BALASUBRAMANIAN RAMAN

This paper presents a new robust reference watermarking scheme based on wavelet packet transform (WPT) and bidiagonal singular value decomposition (bSVD) for copyright protection and authenticity. A small gray scale logo is used as watermark instead of randomly generated Gaussian noise type watermark. A reference watermark is generated by original watermark and the process of embedding is done in wavelet packet domain by modifying the bidiagonal singular values. For the robustness and imperceptibly, watermark is embedded in the selected sub-bands, which are selected by taking into account the variance of the sub-bands, which serves as a measure of the watermark magnitude that could be imperceptibly embedded in each block. For this purpose, the variance is calculated in a small moving square window of size Sp× Sp(typically 3 × 3 or 5 × 5 window) centered at the pixel. A reliable watermark extraction is developed, in which the watermark bidiagonal singular values are extracted by considering the distortion caused by the attacks in neighboring bidiagonal singular values. Experimental evaluation demonstrates that the proposed scheme is able to withstand a variety of attacks and the superiority of the proposed method is carried out by the comparison which is made by us with the existing methods.


2014 ◽  
Vol 8 ◽  
pp. 2997-3008 ◽  
Author(s):  
Azz El Arab El Hossaini ◽  
Mohamed El Aroussi ◽  
Khadija Jamali ◽  
Samir Mbarki ◽  
Mohammed Wahbi

2011 ◽  
Vol 271-273 ◽  
pp. 536-540
Author(s):  
Ying Tian ◽  
Xue Song Peng ◽  
Yun Fei Wei

This paper presents a blind watermarking algorithm based on quantization index modulation (QIM) and singular value decomposition (SVD) in the wavelet domain. Obtain approximation sub band of the wavelet domain coefficient matrix by performing a wavelet transform on host image. The QIM technique determines the quantization step for each embedding block. The SVD technique is modified the SVs of each embedding block. The watermark encrypted by a chaos sequence generated by Lorenz chaotic system is embedded the host image. The experiments show that this paper presented algorithm in various attacks against the image has good robustness especially for against geometric attacks and image compression.


2006 ◽  
Vol 2 (3) ◽  
pp. 149-154 ◽  
Author(s):  
Milind Engedy ◽  
Munaga. V. N. K. Prasad ◽  
Ashutosh Saxena

Digital Watermarking is an excellent tool at the disposal of the owners of the digital content to protect their Intellectual Property Rights (IPR). In this paper we present an attack on several watermarking schemes that forgo their claims of proving ownership of digital content. The attack takes the advantage of one-to-many relationship between the Singular value matrix and the decomposing matrix. In this paper we prove that the two ways one-to-one relationship between the watermark and the watermark dependent pattern to be hidden in the image as a necessary condition to invalidate the multiple claims of ownership of digital content. We also recommend the standardization of watermarking schemes and registration of watermarks with legal authorities so as to make the system transparent.


Sign in / Sign up

Export Citation Format

Share Document