A novel multi-purpose watermarking scheme using multiple watermarks

2021 ◽  
Vol 15 (1) ◽  
pp. 88
Author(s):  
Ayesha Shaik ◽  
V. Masilamani
Keyword(s):  
Multiple Watermarks ◽  
Watermarking Scheme

A Multiple-Bits Watermark for Relational Data

2009 ◽  
pp. 2223-2244
Author(s):  
Yingjiu Li ◽  
Huiping Guo ◽  
Shuhong Wang
Keyword(s):  
Upper Bound ◽  
Secret Key ◽  
Robust Watermarking ◽  
Information Economy ◽  
Numerical Attributes ◽  
Primary Key ◽  
Multiple Watermarks ◽  
Joint Ownership ◽  
Database Protection ◽  
Watermarking Scheme

At the heart of the information economy, commercially and publicly useful databases must be sufficiently protected from pirated copying. Complementary to the Database Protection Act, database watermarking techniques are designed to thwart pirated copying by embedding ownerspecific information into databases so that the ownership of pirated copies of protected databases can be claimed if the embedded information is detected. This article presents a robust watermarking scheme for embedding a multiple-bits watermark to numerical attributes in database relations. The scheme is robust in the sense that it provides an upper bound for the probability that a valid watermark is detected from unmarked data, or a fictitious secret key is discovered from pirated data. This upper bound is independent of the size of the data. The scheme is extended to database relations without primary-key attributes to thwart attribute-related attacks. The scheme is also extended to multiple watermarks for defending additive attacks and for proving joint ownership.

scholarly journals Multiple watermarking technique using optimal threshold

2020 ◽  
Vol 18 (1) ◽  
pp. 368
Author(s):  
Noruhida Alias ◽  
Ferda Ernawan
Keyword(s):  
Cross Correlation ◽  
Orthogonal Matrix ◽  
Arnold Transform ◽  
High Demand ◽  
Trade Off ◽  
Multiple Watermarking ◽  
Jpeg2000 Compression ◽  
Optimal Thresholds ◽  
Multiple Watermarks ◽  
Watermarking Scheme

<span>The multiple watermarking technique has drawn more attention due to high demand for embedding more than one copyright. This paper proposes a multiple watermarking scheme using DWT-SVD by utilizing HVS characteristics. Our scheme embeds multiple watermarks in red and blue colors. The proposed scheme examines the coefficients of U orthogonal matrix for embedding and extracting watermarks. Watermarks are scrambled by Arnold transform before embedded in the host image in order provide additional security. The optimal thresholds for red and blue colors are revealed by finding a trade-off between normalized-cross correlation and imperceptibility from quantization steps. The experimental results demonstrate that our scheme achieves high resistant under JPEG and JPEG2000 compression for both inserted watermarks. </span>

A Multiple-Bits Watermark for Relational Data

2011 ◽  
pp. 1-22
Author(s):  
Yingjiu Li ◽  
Huiping Guo ◽  
Shuhong Wang
Keyword(s):  
Upper Bound ◽  
Specific Information ◽  
Secret Key ◽  
Information Economy ◽  
Numerical Attributes ◽  
Primary Key ◽  
Multiple Watermarks ◽  
Joint Ownership ◽  
Database Protection ◽  
Watermarking Scheme

At the heart of the information economy, commercially and publicly useful databases must be sufficiently protected from pirated copying. Complementary to the Database Protection Act, database watermarking techniques are designed to thwart pirated copying by embedding owner-specific information into databases so that the ownership of pirated copies of protected databases can be claimed if the embedded information is detected. This article presents a robust watermarking scheme for embedding a multiplebits watermark to numerical attributes in database relations. The scheme is robust in the sense that it provides an upper bound for the probability that a valid watermark is detected from unmarked data, or a fictitious secret key is discovered from pirated data. This upper bound is independent of the size of the data. The scheme is extended to database relations without primary-key attributes to thwart attributerelated attacks. The scheme is also extended to multiple watermarks for defending additive attacks and for proving joint ownership.

scholarly journals A Blind Multiple Watermarks based on Human Visual Characteristics

2018 ◽  
Vol 8 (4) ◽  
pp. 2578 ◽  
Author(s):  
Ferda Ernawan ◽  
Siau-Chuin Liew ◽  
Zuriani Mustaffa ◽  
Kohbalan Moorthy
Keyword(s):  
Cross Correlation ◽  
Threshold Value ◽  
Different Types ◽  
Multiple Watermarks ◽  
Visual Characteristics ◽  
Block Based ◽  
Value Decomposition ◽  
Watermarking Scheme ◽  
Normalize Cross Correlation ◽  
Human Visual Characteristics

<span lang="EN-MY">Digital watermarking is an alternative solution to prevent unauthorized duplication, distribution and breach of ownership right. </span><span>This paper proposes a watermarking scheme for multiple watermarks embedding. The embedding of multiple watermarks use a block-based scheme based on human visual characteristics. A threshold is used to determine the watermark values by modifying first column of the orthogonal <em>U</em> matrix obtained from Singular Value Decomposition (SVD). The tradeoff between normalize cross-correlation and imperceptibility of watermarked image from quantization steps was used to achieve an optimal threshold value. The results show that our proposed multiple watermarks scheme exhibit robustness against signal processing attacks. The proposed scheme demonstrates that the watermark recovery from chrominance blue was resistant against different types of attacks.</span>

Evaluvation of Multiresolution Watermarking Algorithm

2017 ◽  
Vol 7 (8) ◽  
pp. 85
Author(s):  
S. Thabasu Kannan ◽  
S. Azhagu Senthil
Keyword(s):  
Digital Watermarking ◽  
Wavelet Transformation ◽  
Signal To Noise Ratio ◽  
Rapid Development ◽  
Threshold Value ◽  
Discrete Wavelet ◽  
Digital Production ◽  
Common Framework ◽  
Sampling Operation ◽  
Watermarking Scheme

Now-a-days watermarking plays a pivotal role in most of the industries for providing security to their own as well as hired or leased data. This paper its main aim is to study the multiresolution watermarking algorithms and also choosing the effective and efficient one for improving the resistance in data compression. Computational savings from such a multiresolution watermarking framework is obvious. The multiresolutional property makes our watermarking scheme robust to image/video down sampling operation by a power of two in either space or time. There is no common framework for multiresolutional digital watermarking of both images and video. A multiresolution watermarking based on the wavelet transformation is selected in each frequency band of the Discrete Wavelet Transform (DWT) domain and therefore it can resist the destruction of image processing.   The rapid development of Internet introduces a new set of challenging problems regarding security. One of the most significant problems is to prevent unauthorized copying of digital production from distribution. Digital watermarking has provided a powerful way to claim intellectual protection. We proposed an idea for enhancing the robustness of extracted watermarks. Watermark can be treated as a transmitted signal, while the destruction from attackers is regarded as a noisy distortion in channel.  For the implementation, we have used minimum nine coordinate positions. The watermarking algorithms to be taken for this study are Corvi algorithm and Wang algorithm. In all graph, we have plotted X axis as peak signal to noise ratio (PSNR) and y axis as Correlation with original watermark. The threshold value ά is set to 5. The result is smaller than the threshold value then it is feasible, otherwise it is not.

Sign in / Sign up

Export Citation Format

Share Document