Geometric Distortions Correction Using Image Moment in Image Watermarking

Author(s):  
Zhang Li ◽  
Sam Kwong

This chapter presents a method for detecting and recovering geometrical attacks in digital watermarking by making use of geometric moments of the original images. Digital image watermarking has become a popular technique for authentication and copyright protection. However, many proposed image watermarking techniques are sensitive to geometric distortions, such as rotation, scaling, and translation. In this chapter, we propose a new way of making this estimation by using the geometric moments of original image. The moment information can be used as a private key of extraction process. This method can be used as a preprocess of the extraction watermarking process. We have embedded different watermarks into original images in different domains including discrete wavelet transform (DWT), discrete cosine transfrom (DCT), fast Fourier transform, and spatial domain. The experimental results show that our method has a good robustness to wide geometric distortion parameters ranges and it is robust to Stirmark attacks.

Author(s):  
Layth Alasafi ◽  
Tuna Göksu ◽  
Ammar Albayati

The transition from analog technologies to digital technologies has increased the ever-growing concern for protection and authentication of digital content and data. Owners of digital content of any type are seeking and exploring new technologies for the protection of copyrighted multimedia content. Multimedia protection has become an issue in recent years, and to deal with this issue, researchers are continuously searching for and exploring new effective and efficient technologies. This thesis study has been prepared in order to increase the invisibility and durability of invisible watermarking by using the multilayer Discrete Wavelet Transform (DWT) in the frequency plane and embedding two marks into an image for the purpose of authentication and copyright when digital content travels through an unsecured channel. A novel watermarking algorithm has been proposed based on five active positions and on using two marks. In addition to the extraction process, watermarking images will be subjected to a set of attack tests. The evaluation criteria have been the bases of assessing the value of SNR, PNSR, MAE and RMSE for both the watermarking images and the watermarking images after attacks, followed by the invisibility of the watermarking being measured before and after the attacks. Our lab results show high robustness and high quality images obtaining value for both SNR and PNSR.


2019 ◽  
Vol 17 (1) ◽  
pp. 1-7
Author(s):  
Razika Souadek ◽  
Naceur-Eddine Boukezzoula

In this paper, we propose a new algorithm of image watermarking based on Discrete Wavelet Transform (DWT) including a function for pixels movement. The proposed algorithm uses DWT of two levels in order to compact a higher energy in component LL1, and Contrast Sensitivity Function (CSF) to improve the invisibility and robustness, the new Function of Pixel Movement (PMF) is applied to increase the security properties. Pixel Movement Function (PMF) is a function of N iteration inside each block, this function required a changeable key K calculated in each iteration N for the position of each block. Numerical experiments are performed to demonstrate that the proposed method can improve watermarking quality in terms of imperceptibility of watermark, capacity of insertion and robustness against different attacks such as Joint Photographic Experts Group (JPEG) compression, noise addition and geometrical attacks.


Author(s):  
G. KOTESWARA RAO ◽  
V. ANURAGH ◽  
T.P. SRINIVASKAUSALYANANDAN ◽  
R.L. PRASHANTH

In this paper we present a new watermarking scheme for still image data. Most of the recent work in watermarking can be grouped into two categories: spatial domain methods and frequency domain methods. We introduce a novel approach of watermarking which involves embedding the watermark in the discrete wavelet domain. We make use of a multi resolution data fusion approach in which the image and watermark are both transformed into the discrete wavelet domain. The resulting image pyramids are then fused according to a series of combination. After watermark insertion, inverse DWT is applied to the sub-bands with modified coefficients to obtain the watermarked image. For watermark extraction, a threshold-based decoder is designed. Embedding and extraction process are characterized with parameters and genetic algorithm is used for parameter optimization. Optimization is to maximize the values of peak signal-to-noise ratio of the watermarked image and normalized cross correlation of the extracted watermark. The performance of the proposed scheme is compared with the existing schemes and significant improvement is observed.


2021 ◽  
Vol 7 (10) ◽  
pp. 218
Author(s):  
Mohamed Hamidi ◽  
Mohamed El Haziti ◽  
Hocine Cherifi ◽  
Mohammed El Hassouni

In this paper, a robust hybrid watermarking method based on discrete wavelet transform (DWT), discrete cosine transform (DCT), and scale-invariant feature transformation (SIFT) is proposed. Indeed, it is of prime interest to develop robust feature-based image watermarking schemes to withstand both image processing attacks and geometric distortions while preserving good imperceptibility. To this end, a robust watermark is embedded in the DWT-DCT domain to withstand image processing manipulations, while SIFT is used to protect the watermark from geometric attacks. First, the watermark is embedded in the middle band of the discrete cosine transform (DCT) coefficients of the HL1 band of the discrete wavelet transform (DWT). Then, the SIFT feature points are registered to be used in the extraction process to correct the geometric transformations. Extensive experiments have been conducted to assess the effectiveness of the proposed scheme. The results demonstrate its high robustness against standard image processing attacks and geometric manipulations while preserving a high imperceptibility. Furthermore, it compares favorably with alternative methods.


Author(s):  
R. MUKUNDAN

Geometric moments have been used in several applications in the field of Computer Vision. Many techniques for fast computation of geometric moments have therefore been proposed in the recent past, but these algorithms mainly rely on properties of the moment integral such as piecewise differentiability and separability. This paper explores an alternative approach to approximating the moment kernel itself in order to get a notable improvement in computational speed. Using Schlick's approximation for the normalized kernel of geometric moments, the computational overhead could be significantly reduced and numerical stability increased. The paper also analyses the properties of the modified moment functions, and shows that the proposed method could be effectively used in all applications where normalized Cartesian moment kernels are used. Several experimental results showing the invariant characteristics of the modified moments are also presented.


Author(s):  
Wenbing Wang ◽  
Shengli Liu ◽  
Liu Feng

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.


2018 ◽  
Vol 16 (07) ◽  
pp. 1850060 ◽  
Author(s):  
Ri-Gui Zhou ◽  
Peng Liu Yang ◽  
Xing Ao Liu ◽  
Hou Ian

Most of the studied quantum encryption algorithms are based on square images. In this paper, based on the improved novel quantum representation of color digital images model (INCQI), a quantum color image watermarking scheme is proposed. First, INCQI improved from NCQI is used to represent the carrier and watermark images with the size [Formula: see text] and [Formula: see text], respectively. Secondly, before embedding, the watermarking needs to be preprocessed. That is, the watermark image with the size of [Formula: see text] with 24-qubits color information is disordered by the fast bit-plane scramble algorithm, and then further expanded to an image with the size [Formula: see text] with 6-qubits pixel information by the nearest-neighbor interpolation method. Finally, the dual embedded algorithm is executed and a key image with 3-qubits information is generated for retrieving the original watermark image. The extraction process of the watermark image is the inverse process of its embedding, including inverse embedding, inverse expand and inverse scrambling operations. To show that our method has a better performance in visual quality and histogram graph, a simulation of different carrier and watermark images are conducted on the classical computer’s MATLAB.


Sign in / Sign up

Export Citation Format

Share Document