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.

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.

Design and Implementation of Geometric Invariant Zero-Watermarking in Digital Copyright Protection

2015 ◽  
Vol 731 ◽  
pp. 187-192 ◽  
Author(s):  
Xiao Yan Xu ◽  
Qiang Wang
Keyword(s):  
Copyright Protection ◽  
High Reliability ◽  
Low Frequency ◽  
Image Data ◽  
Media Industry ◽  
Geometric Invariant ◽  
Geometric Attacks ◽  
Digital Copyright ◽  
Copyright Information ◽  
Digital Copyright Protection

Digital copyright protection is a bottleneck in the cross-media industry currently. In this paper, image normalization technique is used to map image into a geometric invariant space. Then, important area is extracted from the normalized image. At last, important area’s low-frequency DCT coefficients and watermark image are used to construct copyright information. Simulation results show that, without changing original image data, the proposed scheme is robust to geometric attacks and some conventional signal processing attacks. Hence it provides an effective solution for high reliability copyright protection.

Digital Watermarking Based on Two-Way Arnold Transform and QR Code

2012 ◽  
Vol 591-593 ◽  
pp. 2564-2567
Author(s):  
Yang Su ◽  
Peng Han ◽  
Zhu Jun Jia ◽  
Shi Hua Liang
Keyword(s):  
Digital Watermarking ◽  
Low Frequency ◽  
Qr Code ◽  
Image Simulation ◽  
Watermark Embedding ◽  
Specific Order ◽  
Value Decomposition ◽  
Carrier Image ◽  
Arnold Transformation

This paper proposes a digital watermarking algorithm based on two-way Arnold transformation and QR code. This algorithm uses the QR barcode as the watermark, and in its pretreatment process it uses the two-way Arnold transformation to broke up the QR code image into blocks which then coded and re-arranged in a specific order. Considering the role of Singular Value Decomposition in watermark embedding, here the watermark information is embedded into the low frequency coefficients of wavelet transform of the carrier image. Simulation results show that the algorithm is robust against attacks such as shearing, the JPEG compression and noise attacking.

A Framework for Image Encryption on Frequency Domain

2019 ◽  
pp. 247-259
Author(s):  
Zhe Liu ◽  
Mee Loong Yang ◽  
Wei Qi Yan
Keyword(s):  
Image Encryption ◽  
Digital Watermarking ◽  
Logistic Map ◽  
Low Frequency ◽  
Singular Value ◽  
Encryption Algorithm ◽  
Discrete Wavelet ◽  
Secret Key ◽  
Value Decomposition ◽  
Image Encryption Algorithm

In this chapter, the authors propose an improved image encryption algorithm based on digital watermarking. The algorithm combines discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) together in a DWT-DCT-SVD framework to improve the robust watermarking technique. The secret image is embedded into both high-frequency and low-frequency sub-bands of the host image; this makes it difficult to be attacked in all the sub-bands. To reduce the size of a secret key, the authors use a logistic map to generate random images so as to replace the host images. They tested the algorithm by using five types of attacks and the results indicate that the proposed algorithm has higher robustness than traditional chaotic scrambling method and the DRPE method. It shows strong resilience against the five types of attacks as well as statistical attacks.

Research of Digital Watermarking Algorithm Based on SVD and DWT

2011 ◽  
Vol 65 ◽  
pp. 385-388
Author(s):  
Ping Yang ◽  
Liang Yu Yang ◽  
Yu Jie Zhang
Keyword(s):  
Digital Watermarking ◽  
Low Frequency ◽  
Singular Values ◽  
Singular Value ◽  
Secret Message ◽  
Discrete Wavelet ◽  
Information Redundancy ◽  
Digital Multimedia ◽  
Multi Media ◽  
Value Decomposition

In order to protect the integrity and copyright, digital watermarking embeded secret message into the digital multi- media, which is not easy to detect the embedded watermarking, but determine the distinction using of information redundancy and randomness of digital multimedia. According to the characteristics of digital watermarking, the singular value decomposition (SVD) and discrete wavelet transform (DWT) algorithm are combined using the characteristics of SVD of image matrix and the features of multi-resolution of DWT. Therefore, a new digital watermarking algorithm of SVD is proposed in this paper. The singular values of each band of watermarking image are embedded into the coefficients of corresponding to the singular value of original image low-frequency band. The experimental results showed that the algorithm of the watermarking embedding and extraction had good robustness and effectiveness. The watermarking was robust and transparent.

scholarly journals DIGITAL WATERMARKING IN THE SINGULAR VECTOR DOMAIN

2008 ◽  
Vol 08 (03) ◽  
pp. 351-368 ◽  
Author(s):  
RASHMI AGARWAL ◽  
M. S. SANTHANAM
Keyword(s):  
Digital Watermarking ◽  
Wavelet Transforms ◽  
Singular Vector ◽  
Singular Value ◽  
Discrete Wavelet ◽  
Discrete Wavelet Transforms ◽  
Host Image ◽  
Grey Scale ◽  
Value Decomposition ◽  
Transform Domains

Many current watermarking algorithms insert data in the spatial or transform domains like the discrete cosine, the discrete Fourier, and the discrete wavelet transforms. In this paper, we present a data-hiding algorithm that exploits the singular value decomposition (SVD) representation of the data. We compute the SVD of the host image and the watermark and embed the watermark in the singular vectors of the host image. The proposed method leads to an imperceptible scheme for digital images, both in grey scale and color and is quite robust against attacks like noise and JPEG compression.

scholarly journals An entropy-based image watermarking scheme by improving robustness in shearlet and wavelet domain

2020 ◽  
Author(s):  
Yujian Zhuang ◽  
Xiaoyi Zhou ◽  
Sheng Liu
Keyword(s):  
Image Watermarking ◽  
Singular Value ◽  
Just Noticeable Difference ◽  
Wavelet Domain ◽  
Geometric Attacks ◽  
Watermark Embedding ◽  
Adaptive Adjustment ◽  
Fixed Embedding ◽  
Value Decomposition ◽  
Watermarking Scheme

Abstract The existing robust digital watermarking schemes mainly embed information in the fixed positions or with fixed embedding strength, while seldom considering adaptive adjustment based on the characteristics of the cover image, thus it reduces the imperceptibility and the robustness of watermarking. Aiming at these issues, we propose a scheme which can be able to dynamically adjust the watermark embedding position and strength. Therefore, it guarantees the trade-off between robustness and imperceptibility. The appropriate embedding positions are dynamically selected for the watermark by comparing the image entropy, and the embedding strength of the image blocks are adaptively adjusted according to the entropy and the Just Noticeable Difference (JND) model in the Human Visual System (HVS)-based wavelet domain. Singular Value Decomposition (SVD) is performed on the image blocks to ensure the resistant ability of geometric attacks. The experimental results show that the scheme has good imperceptibility as well as strong robustness against various attacks. The robustness in common attacks is improved by at least 1% compared with similar watermarking schemes.

A Framework for Image Encryption on Frequency Domain

2021 ◽  
pp. 328-338
Author(s):  
Zhe Liu ◽  
Mee Loong Yang ◽  
Wei Qi Yan
Keyword(s):  
Image Encryption ◽  
Digital Watermarking ◽  
Logistic Map ◽  
Low Frequency ◽  
Singular Value ◽  
Encryption Algorithm ◽  
Discrete Wavelet ◽  
Secret Key ◽  
Value Decomposition ◽  
Image Encryption Algorithm

In this chapter, the authors propose an improved image encryption algorithm based on digital watermarking. The algorithm combines discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) together in a DWT-DCT-SVD framework to improve the robust watermarking technique. The secret image is embedded into both high-frequency and low-frequency sub-bands of the host image; this makes it difficult to be attacked in all the sub-bands. To reduce the size of a secret key, the authors use a logistic map to generate random images so as to replace the host images. They tested the algorithm by using five types of attacks and the results indicate that the proposed algorithm has higher robustness than traditional chaotic scrambling method and the DRPE method. It shows strong resilience against the five types of attacks as well as statistical attacks.

Research and Simulation of Performance of W-SVD Watermarking Algorithm Based on Color Images

2014 ◽  
Vol 513-517 ◽  
pp. 1980-1983
Author(s):  
Hou Xiao Fang ◽  
Zhang Chun E
Keyword(s):  
Singular Value Decomposition ◽  
Digital Watermarking ◽  
Wavelet Decomposition ◽  
Low Frequency ◽  
Singular Value ◽  
Perceptual Quality ◽  
Discrete Wavelet ◽  
Discrete Wavelet Decomposition ◽  
Value Decomposition ◽  
Research And Design

The paper presents an algorithm for digital watermarking in colored image, which combined with singular value decomposition and discrete wavelet transform, it selects R-vector of colored image to do discrete wavelet decomposition, and extracts the low-frequency coefficients to finish singular value decomposition and generate watermark template, then reconstructs image after embed watermarking, completes the process of embedding watermarking. The algorithm makes full use of the excellent properties of the wavelet and singular value decomposition, which makes good performance for watermarking system. To this algorithm, the paper studied from two aspects of the image perceptual quality and robustness, and analyze the influence of the parameters in the performance of watermarking algorithm, a number of experiments and data show that these values may bring essential influence to the performance of digital watermarking system, also explains the importance of value selection in the algorithm. The conclusion of the paper is typical and universal, has certain reference significance to research and design the watermarking algorithm.

Sign in / Sign up

Export Citation Format

Share Document