Watermarking Algorithm Based on Quantization Index Modulation and Singular Value Decomposition

2011 ◽  
Vol 271-273 ◽  
pp. 536-540
Author(s):  
Ying Tian ◽  
Xue Song Peng ◽  
Yun Fei Wei
Keyword(s):  
Singular Value Decomposition ◽  
Coefficient Matrix ◽  
Singular Value ◽  
Quantization Index Modulation ◽  
Wavelet Domain ◽  
Quantization Step ◽  
Geometric Attacks ◽  
Host Image ◽  
Value Decomposition ◽  
Index Modulation

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.

Research of Digital Watermarking Algorithm in Wavelet Domain Based on Arnold Transformation and SVD

2012 ◽  
Vol 262 ◽  
pp. 143-146
Author(s):  
Tan Sheng ◽  
Xiu Ping Zhao
Keyword(s):  
Digital Watermarking ◽  
Low Frequency ◽  
Singular Value ◽  
Wavelet Domain ◽  
Geometric Attacks ◽  
Digital Copyright ◽  
Host Image ◽  
Digital Copyright Protection ◽  
Value Decomposition ◽  
Arnold Transformation

In this paper, Arnold transform and Singular Value Decomposition(SVD) are combined to be introduced into the research of wavelet domain digital watermarking algorithm.During experiment,we embed the watermark through modifying the singular value of low-frequency domain of host image with the scrambled watermark information.The simulation experiments show that the algorithm realizes the embedding and extraction of watermark smoothly.There is no visual difference between watermarked image and original host image can be found by naked eye,that means the invisibility of the algorithm is well;the watermark still can be extracted after several kinds of algorithm and geometric attacks,that means the robustness of the algorithm is acceptable.The research has a certain value in the digital copyright protection and security printing.

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
Keyword(s):  
Intellectual Property ◽  
Singular Value Decomposition ◽  
Copyright Protection ◽  
Singular Value ◽  
Robust Watermarking ◽  
High Demand ◽  
Host Image ◽  
Histogram Intersection ◽  
Value Decomposition

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.

Sign in / Sign up

Export Citation Format

Share Document