A Reversible Watermarking Algorithm Resistant to Image Geometric Transformation

2019 ◽  
Vol 11 (1) ◽  
pp. 100-113
Author(s):  
Jian Li ◽  
Jinwei Wang ◽  
Shuang Yu ◽  
Xiangyang Luo
Keyword(s):  
High Performance ◽  
Side Information ◽  
Jpeg Compression ◽  
Reversible Watermarking ◽  
Experimental Results ◽  
Geometric Transformation ◽  
Original Image ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Watermarking Scheme

This article proposes a novel robust reversible watermarking algorithm. The proposed watermarking scheme is reversible because the original image can be recovered after extracting watermarks from the watermarked image, as long as it is not processed by an attacker. The scheme is robust because watermarks can still be extracted from watermarked images, even if it is undergone some malicious or normal operations like rotation and JPEG compression. It first selects two circles, which are centred at the centroid and the centre of image. Then, statistic quantities of these two circles are employed for robust watermark embedding by altering the pixels' value. The side information generated by above embedding process will be embedded as fragile watermarks at another stage to ensure the recovery of original image. Experimental results verify the high performance of the proposed algorithm in resisting various attacks, including JPEG compression and geometric transformation.

scholarly journals Screen-Shooting Resilient Watermarking Scheme via Learned Invariant Keypoints and QT

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6554
Author(s):  
Li Li ◽  
Rui Bai ◽  
Shanqing Zhang ◽  
Chin-Chen Chang ◽  
Mengtao Shi
Keyword(s):  
Neural Networks ◽  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Tensor Decomposition ◽  
Experimental Results ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Extraction Stage ◽  
Watermarking Scheme ◽  
Watermark Algorithm

This paper proposes a screen-shooting resilient watermarking scheme via learned invariant keypoints and QT; that is, if the watermarked image is displayed on the screen and captured by a camera, the watermark can be still extracted from the photo. A screen-shooting resilient watermarking algorithm should meet the following two basic requirements: robust keypoints and a robust watermark algorithm. In our case, we embedded watermarks by combining the feature region filtering model to SuperPoint (FRFS) neural networks, quaternion discrete Fourier transform (QDFT), and tensor decomposition (TD). First we applied FRFS to locate the embedding feature regions which are decided by the keypoints that survive screen-shooting. Second, we structured watermark embedding regions centered at keypoints. Third, the watermarks were embedded by the QDFT and TD (QT) algorithm, which is robust for capturing process attacks. In a partial shooting scenario, the watermark is repeatedly embedded into different regions in an image to enhance robustness. Finally, we extracted the watermarks from at least one region at the extraction stage. The experimental results showed that the proposed scheme is very robust for camera shooting (including partial shooting) different shooting scenarios, and special attacks. Moreover, the efficient mechanism of screen-shooting resilient watermarking could have propietary protection and leak tracing applications.

A Blind Image Watermarking Scheme Utilizing BTC Bitplanes

2011 ◽  
Vol 3 (4) ◽  
pp. 42-53 ◽  
Author(s):  
Chun-Ning Yang ◽  
Zhe-Ming Lu
Keyword(s):  
Image Watermarking ◽  
Image Authentication ◽  
Extraction Process ◽  
Experimental Results ◽  
Original Image ◽  
Image Block ◽  
Watermark Embedding ◽  
Extraction Processes ◽  
Watermarking Scheme ◽  
Blind Image

This paper presents a novel image watermarking scheme utilizing Block Truncation Coding (BTC). This scheme uses BTC to guide the watermark embedding and extraction processes. During the embedding process, the original cover image is first partitioned into non-overlapping 4×4 blocks. Then, BTC is performed on each block to obtain its BTC bitplane, and the number of ‘1’s in the bitplane is counted. If the watermark bit to be embedded is ‘1’ and the number of ‘1’s is odd, or the watermark bit to be embedded is ‘0’ and the number of ‘1’s is even, then no change is made. Otherwise, by changing at most three pixels in the original image block, the number of ‘1’s (or ‘0’s) in the renewed bitplane are forced to be odd for the watermark bit ‘1’ or to be even for the watermark bit ‘0’. During the extraction process, BTC is first performed on each block to obtain its bitplane. If the number of ‘1’s in the bitplane is odd, then the embedded watermark bit is ‘1’. Otherwise, the embedded watermark bit is ‘0’. The experimental results show that the proposed watermarking method is semi-fragile except for the changes in brightness and contrast; therefore, the proposed method can be used for image authentication.

scholarly journals Reversible Watermarking in Medical Image Using RDWT and Sub-Sample

Cryptography ◽  
2020 ◽  
pp. 480-497
Author(s):  
Lin Gao ◽  
Tiegang Gao ◽  
Jie Zhao
Keyword(s):  
Medical Image ◽  
Image Watermarking ◽  
Reversible Watermarking ◽  
Encryption Algorithm ◽  
Discrete Wavelet ◽  
Embedding Capacity ◽  
Watermark Embedding ◽  
Watermarking Scheme ◽  
Redundant Discrete Wavelet Transform ◽  
Image Encryption Algorithm

This paper proposed a reversible medical image watermarking scheme using Redundant Discrete Wavelet Transform (RDWT) and sub-sample. To meet the highly demand of the perceptional quality, the proposed scheme embedding the watermark by modifying the RDWT coefficients. The sub-sample scheme is introduced to the proposed scheme for the enhancement of the embedding capacity. Moreover, to meet the need of security, a PWLCM based image encryption algorithm is introduced for encrypting the image after the watermark embedding. The experimental results suggests that the proposed scheme not only meet the highly demand of the perceptional quality, but also have better embedding capacity than former DWT based scheme. Also the encryption scheme could protect the image contents efficiently.

NOVEL SELF-REFERENCE BASED IMAGE WATERMARKING SCHEME

2010 ◽  
Vol 19 (02) ◽  
pp. 491-502 ◽  
Author(s):  
YONG-GANG FU ◽  
RUIMIN SHEN
Keyword(s):  
Image Watermarking ◽  
Extraction Process ◽  
Jpeg Compression ◽  
Reference Image ◽  
Original Image ◽  
Quantization Step ◽  
Dct Transform ◽  
Gray Level Image ◽  
Watermarking Scheme ◽  
Self Reference

In this paper, a novel image watermarking scheme based on a self-reference technique is proposed. The meaningful watermark is embedded into a gray-level image according to the relation between the constructed reference image and the original host. In order to be robust against Jpeg compression, the reference image should be robust under Jpeg compression. Firstly, the original image is transformed into DCT domain; and then most of the high frequency coefficients are omitted; after the quantization step and inverse DCT transform, we can obtain a robust reference. By considering the relation between the original image and its reference, we can embed the watermark into the host. The watermark extraction process is oblivious. Experimental results under several attacks show good robustness of the proposed scheme. Especially under cropping and Jpeg compression attacks, the watermark can be extracted with only few errors.

Digital Watermarking for Multimedia Transaction Tracking

2011 ◽  
pp. 52-86
Author(s):  
Dan Yu ◽  
Farook Sattar
Keyword(s):  
Signal Processing ◽  
Independent Component Analysis ◽  
Digital Watermarking ◽  
Side Information ◽  
Original Data ◽  
The Other ◽  
Watermark Embedding ◽  
Common Signal ◽  
Future Work ◽  
Watermarking Scheme

This chapter focuses on the issue of transaction tracking in multimedia distribution applications through digital watermarking terminology. The existing watermarking schemes are summarized and their assumptions as well as the limitations for tracking are analyzed. In particular, an Independent Component Analysis (ICA)-based watermarking scheme is proposed, which can overcome the problems of the existing watermarking schemes. Multiple watermarking technique is exploited—one watermark to identify the rightful owner of the work and the other one to identify the legal user of a copy of the work. In the absence of original data, watermark, embedding locations and strengths, the ICA-based watermarking scheme is introduced for efficient watermark extraction with some side information. The robustness of the proposed scheme against some common signal-processing attacks as well as the related future work are also presented. Finally, some challenging issues in multimedia transaction tracking through digital watermarking are discussed.

scholarly journals A Blind Print-Recapture Robust Watermark Scheme by Calculating Self-Convolution

2019 ◽  
Vol 11 (4) ◽  
pp. 28-49 ◽  
Author(s):  
Mengmeng Zhang ◽  
Rongrong Ni ◽  
Yao Zhao
Keyword(s):  
Detection Rate ◽  
Color Image ◽  
Correlation Coefficients ◽  
Color Images ◽  
Geometric Transformation ◽  
Original Image ◽  
Color Spaces ◽  
Watermark Scheme ◽  
Robust Watermark ◽  
Cie Lab

A blind print-recapture robust watermark scheme is proposed. Watermark patterns are embedded into the space domain of a color image and can be detected from a print-recaptured version of the image without knowledge of the original image. The process of embedding invisible watermarks to convert RGB color images to CIE Lab color spaces and embed periodic watermarks in both color channels at the same time. Watermark extraction is achieved by calculating self-convolution and inverting the geometric transformation such as rotation and scale. Normalized correlation coefficients between the extracted and the embedded watermark pattern is calculated to determine whether there is watermark. The decision about the presence/absence of the watermark pattern is then determined by a threshold which is set 0.13, and the detection rate of 241 pictures is about 0.79.

An Effective Image-Adaptive Hybrid Watermarking Scheme with Transform Coefficients

2020 ◽  
Vol 20 (01) ◽  
pp. 2050002
Author(s):  
Navneet Yadav ◽  
Navdeep Goel
Keyword(s):  
Side Information ◽  
Adaptive Method ◽  
Discrete Wavelet ◽  
High Entropy ◽  
Watermark Embedding ◽  
Invisible Watermarking ◽  
Dct Coefficients ◽  
Hybrid Watermarking ◽  
Value Decomposition ◽  
Watermarking Scheme

Robust and invisible watermarking provides a feasible solution to prove the ownership of the genuine content owner. Different watermarking algorithms have been presented by the researchers in the past but no algorithm could be termed as perfect. Proposed work puts forward a novel image-adaptive method of embedding a binary watermark in the image in a transparent manner. Discrete wavelet transform (DWT), singular value decomposition (SVD) and discrete cosine transform (DCT) are used together in the proposed hybrid watermarking scheme. Image-adaptive nature of the scheme is reflected in the usage of only high entropy [Formula: see text] blocks for the watermark embedding. Binary watermark is embedded in the DCT coefficients using a flexible strength derived from the means of the DCT coefficients. This flexible strength factor (SF) has different value for the DCT coefficients originated from different [Formula: see text] blocks. Any desired level of visual quality could be obtained by varying the adjusting parameter of the flexible SF. Side information generated in the watermark embedding is used in the detection of watermark. The presented watermarking technique shows better robustness in comparison to the three contemporary watermarking techniques.

scholarly journals LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2191
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang
Keyword(s):  
Data Hiding ◽  
Relational Database ◽  
Relational Databases ◽  
Experimental Results ◽  
Robust Watermarking ◽  
Watermark Embedding ◽  
Lossless Watermarking ◽  
Watermarking Scheme ◽  
Reversible Watermark

In 2002, Agrawal and Kiernan defined six basic requirements, including preventing illegal watermark embedding and authentication, reversibility, robustness, and others, which must be satisfied when a reversible watermark is designed for relational databases. To meet these requirements, in this paper, a lossless watermarking scheme for a categorical relational database called LRW-CRDB (lossless robust watermarking for categorical relational databases) is proposed. In our LRW-CRDB scheme, the database owner needs to generate two secret embedding keys, K1 and K2, in advance. Then, two reference sets are generated based on two different secret embedding keys and a symmetry-based data hiding strategy, and then these are used for the watermark embedding phases. Experimental results confirmed that our LRW-CRDB scheme successfully detects 100% of hidden watermarks, even when more than 95% of the watermarked relational database has been deleted. In other words, the robustness of our proposed LRW-CRDB scheme outperforms other existing schemes under a variety of possible attacks, such as alteration, sorting, deletion, and mix-match attacks.

Robust Reversible Watermarking Scheme against JPEG Compression

2010 ◽  
Vol 39 (8) ◽  
pp. 1377-1382 ◽  
Author(s):  
武丹 WU Dan ◽  
汪国昭 WANG Guo-zhao
Keyword(s):  
Jpeg Compression ◽  
Reversible Watermarking ◽  
Watermarking Scheme
Sign in / Sign up

Export Citation Format

Share Document