Geometrically Invariant NSCT–GPCET-Based Image Watermarking with Accurate Moment Calculation

2021 ◽  
pp. 2150284
Author(s):  
Wenbing Wang ◽  
Shengli Liu ◽  
Liu Feng
Keyword(s):  
Calculation Method ◽  
Image Watermarking ◽  
Robust Watermarking ◽  
Exponential Transform ◽  
Computational Simplicity ◽  
Polar Complex Exponential Transform ◽  
Watermarking Scheme ◽  
Complex Exponential ◽  
Grid Division ◽  
Geometrical Attacks

Generic polar complex exponential transform (GPCET), as continuous orthogonal moment, has the advantages of computational simplicity, numerical stability, and resistance to geometric transforms, which make it suitable for watermarking. However, errors in kernel function discretization can degrade these advantages. To maximize the GPCET utilization in robust watermarking, this paper proposes a secondary grid-division (SGD)-based moment calculation method that divides each grid corresponding to one pixel into nonoverlapping subgrids and increases the number of sampling points. Using the accurate moment calculation method, a nonsubsampled contourlet transform (NSCT)–GPCET-based watermarking scheme with resistance to image processing and geometrical attacks is proposed. In this scheme, the accurate moment calculation can reduce the numerical error and geometrical error of the traditional methods, which is verified by an image reconstruction comparison. Additionally, NSCT and accurate GPCET are utilized to achieve watermark stability. Subsequent experiments test the proposed watermarking scheme for its invisibility and robustness, and verify that the robustness of the proposed scheme outperforms that of other schemes when its level of invisibility is significantly higher.

Copy Move Forgery Image Detection via Discrete Radon and Polar Complex Exponential Transform-Based Moment Invariant Features

2017 ◽  
Vol 31 (02) ◽  
pp. 1754005 ◽  
Author(s):  
Junliu Zhong ◽  
Yanfen Gan ◽  
Janson Young ◽  
Peiyu Lin
Keyword(s):  
Background Information ◽  
Moment Invariant ◽  
Geometric Distortions ◽  
Invariant Features ◽  
Geometrical Features ◽  
Exponential Transform ◽  
Polar Complex Exponential Transform ◽  
Circular Template ◽  
Scaling Invariant ◽  
Complex Exponential

Copy move forgery with geometric distortions such as the rotational operation, the scaling operation, the mirror operation and the additive noise operation became more common. Existing methods are not competent for the detection of the copy move forgery with these distortions. In fact, the most critical issue for the detection of the forgery is the determination of the geometric features. This paper proposes an efficient Discrete Radon Polar Complex Exponential Transform (DRPCET)-based method for the extraction of the rotational and the scaling invariant features for the copy move forgery detection. First, the features obtained by the Radon transform (RT) and the Polar Complex Exponential Transform (PCET) are fused together. Then, these features are normalized. In order to achieve the scaling invariant property, an auxiliary circular template is introduced. With the auxiliary circular template, the translational moment invariant features, the rotational moment invariant features and the scaling moment invariant features are constructed for the extraction of the planar geometrical features. By further extracting some useful features for the representation of the image background, the interference of the background information can be reduced. After extracting the geometrical features, the lexicographic sorting is applied. Then, a correlation between the same part or similar parts of the image which are copied and moved to another image is computed. Based on the obtained correlations, these forgery parts can be identified and their composed positions can be located. Finally, these images are denoted as the forgery image. Extensive computer numerical simulations have been performed. The obtained results show that the proposed method can detect the copy move region in the forgery image precisely even though the forgery regions are suffered from the mixed geometric distortions.

scholarly journals A Polar Complex Exponential Transform-Based Zero-Watermarking for Multiple Medical Images with High Discrimination

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Wenbing Wang ◽  
Yan Li ◽  
Shengli Liu
Keyword(s):  
Medical Images ◽  
Computation Time ◽  
Image Features ◽  
Computational Time ◽  
Geometric Attacks ◽  
Exponential Transform ◽  
Zero Watermarking ◽  
Polar Complex Exponential Transform ◽  
The Stability ◽  
Complex Exponential

Zero-watermarking is one of the solutions for image copyright protection without tampering with images, and thus it is suitable for medical images, which commonly do not allow any distortion. Moment-based zero-watermarking is robust against both image processing and geometric attacks, but the discrimination of watermarks is often ignored by researchers, resulting in the high possibility that host images and fake host images cannot be distinguished by verifier. To this end, this paper proposes a PCET- (polar complex exponential transform-) based zero-watermarking scheme based on the stability of the relationships between moment magnitudes of the same order and stability of the relationships between moment magnitudes of the same repetition, which can handle multiple medical images simultaneously. The scheme first calculates the PCET moment magnitudes for each image in an image group. Then, the magnitudes of the same order and the magnitudes of the same repetition are compared to obtain the content-related features. All the image features are added together to obtain the features for the image group. Finally, the scheme extracts a robust feature vector with the chaos system and takes the bitwise XOR of the robust feature and a scrambled watermark to generate a zero-watermark. The scheme produces robust features with both resistance to various attacks and low similarity among different images. In addition, the one-to-many mapping between magnitudes and robust feature bits reduces the number of moments involved, which not only reduces the computation time but also further improves the robustness. The experimental results show that the proposed scheme meets the performance requirements of zero-watermarking on the robustness, discrimination, and capacity, and it outperforms the state-of-the-art methods in terms of robustness, discrimination, and computational time under the same payloads.

scholarly journals A new DWT-SVD based robust watermarking scheme for real property rights

2014 ◽  
Vol 3 (2) ◽  
pp. 69-78
Author(s):  
Sedigeh Razavi babakalak ◽  
Mohammad Ali Balafar ◽  
Ali Farzan
Keyword(s):  
Property Rights ◽  
Image Watermarking ◽  
Singular Values ◽  
Discrete Wavelet ◽  
Digital Image Watermarking ◽  
Robust Watermarking ◽  
Real Property ◽  
Noise Type ◽  
Value Decomposition ◽  
Watermarking Scheme

In this paper, a new robust digital image watermarking algorithm which was based on singular value decomposition (SVD) and discrete wavelet transform (DWT) was proposed and simulated for protecting real property rights. A gray scale logo image, rather than a randomly generated Gaussian noise type watermark, was used as a watermark. Its embedding algorithm hid a watermark LL sub-band blocks in the low–low (LL) and high-high (HH) sub-bands of a target non-overlapping block of the host image by modifying singular values on SVD version of these blocks. A semi-blind watermark extraction was designed to estimate the original coefficients. Experimental results showed that the proposed scheme made significant improvements in terms of both transparency and robustness and was superior to the existing methods which were considered in this paper.

scholarly journals An Enhanced Informed Watermarking Scheme Using the Posterior Hidden Markov Model

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Chuntao Wang
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
State Of The Art ◽  
Hidden Markov ◽  
Image Watermarking ◽  
Computation Time ◽  
Practical Application ◽  
Robust Watermarking ◽  
Research Topics ◽  
Watermarking Scheme

Designing a practical watermarking scheme with high robustness, feasible imperceptibility, and large capacity remains one of the most important research topics in robust watermarking. This paper presents a posterior hidden Markov model (HMM-) based informed image watermarking scheme, which well enhances the practicability of the prior-HMM-based informed watermarking with favorable robustness, imperceptibility, and capacity. To make the encoder and decoder use the (nearly) identical posterior HMM, each cover image at the encoder and each received image at the decoder are attacked with JPEG compression at an equivalently small quality factor (QF). The attacked images are then employed to estimate HMM parameter sets for both the encoder and decoder, respectively. Numerical simulations show that a small QF of 5 is an optimum setting for practical use. Based on this posterior HMM, we develop an enhanced posterior-HMM-based informed watermarking scheme. Extensive experimental simulations show that the proposed scheme is comparable to its prior counterpart in which the HMM is estimated with the original image, but it avoids the transmission of the prior HMM from the encoder to the decoder. This thus well enhances the practical application of HMM-based informed watermarking systems. Also, it is demonstrated that the proposed scheme has the robustness comparable to the state-of-the-art with significantly reduced computation time.

Sign in / Sign up

Export Citation Format

Share Document