Blind Digital Watermarking Algorithm Research Articles

A blind color image watermarking algorithm using the energy concentration principle of Hadamard matrix

The convenience of the network has brought the copyright crisis of some multimedia works. Therefore, a secure digital watermarking algorithm is urgently needed to realize the copyright maintenance of digital works. A blind digital watermarking algorithm using approximate Hadamard transform is presented in this paper. Since Hadamard transform has a certain energy aggregation effect, in this paper, the principle of energy concentration of Hadamard transform is explored, and the Hadamard transform is slightly treated, so that the multiple increase of large energy coefficient is realized. This modified approximate Hadamard transform is applied to the process of changing from spatial domain to transform domain in the embedding and extraction stage of our proposed watermarking algorithm. In this algorithm, the color image digital watermark is hided in the maximum energy coefficient of color host image in transform domain by using the idea of quantization. In the extraction stage, the watermark image can be extracted completely without the participation of any original information. In order to check on the feasibility of the algorithm, a large number of simulation experiments have been done. The results of simulation experiments show that the proposed algorithm has excellent effect in various performance index.

Blind Extraction of Digital Watermarking Algorithm for Color Images

Digital watermark technology hides copyright information in digital images, effectively protecting the copyright of digital images. At present, the color image digital watermarking algorithm still has defects such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the above problems, this paper studies the digital watermarking method based on discrete wavelet transform and discrete cosine transform. Then this paper proposes a color image blind digital watermarking algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and perform the discrete cosine transform. finally, use the embedding method to convert the watermark information after the Arnold transform embedded in the block. The experimental results show that the PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm has good robustness and can achieve watermarking blind extraction.

Blind Digital Watermarking Algorithm against Projection Transformation for Vector Geographic Data

Projection transformation is an important part of geographic analysis in geographic information systems, which are particularly common for vector geographic data. However, achieving resistance to projection transformation attacks on watermarking for vector geographic data is still a challenging task. We proposed a digital watermarking against projection transformation based on feature invariants for vector geographic data in this paper. Firstly, the features of projection transformation are analyzed, and the number of vertices, the storage order, and the storage direction of two adjacent objects are designed and used as the feature invariant to projection transformation. Then, the watermark index is calculated by the number of vertices of two adjacent objects, and the embedding rule is determined by the storage direction of two adjacent objects. Finally, the proposed scheme performs blind detection through the storage direction of adjacent features. Experimental results demonstrate that the method can effectively resist arbitrary projection transformation, which indicates the superior performance of the proposed method in comparison to the previous methods.

A new hybrid watermarking algorithm for MRI medical images using DWT and hash functions.

This paper deals with a blind hybrid digital watermarking algorithm for the copyright protection and authentication of magnetic resonance tomography images. Medical image watermarking requires extreme care when embedding watermark information in the medical images, to protect the image quality from being violated and to avoid the wrong diagnosis that might occur. The proposed algorithm contains robust watermark for the ownership protection and fragile watermarks for checking the authenticity. In the proposed algorithm, the medical image is divided into two regions, called the Region of Interest and Region of Non-Interest using histogram technique and the watermarks are embedded in both wavelet domain and spatial domain in the Region of Non-Interest Area. The proposed hybrid watermarking technique was successfully tested on a variety of MRI medical images and offerd high peak signal to noise ratio and similarity structure index measure values.

A Blind digital Watermarking Algorithm based on DWT-DCT Transformation

A Blind digital Watermarking Algorithm based on DWT-DCT Transformation

A Novel Watermark Embedding Scheme using Compressive Sensing in Wavelet Domain

Most existing research achievements of digital watermarking techniques are in transform domain. In compari- son with spatial domain, its advantages are larger data volume, higher security and stronger robustness. But its limitations are also obvious: complex computing requirement, weak in resisting attack and anti-extraction. In this paper, a novel blind digital watermarking algorithm is proposed, which performs digital watermark embedding process in Compressive Sens- ing (CS) domain based on the characteristics of CS and Human Visual System (HVS). The sub-blocks with larger capac- ity are selected to embed the scrambled digital watermark, considering the non-uniformity of blocks. Besides that, suitable quantization steps are chose adaptively by using quantization method. Experimental results show that the algorithm ob- tains robust and invisible embedded watermark with larger capacity of data. At the same time, the ability of defending against attack or extraction of embedded watermark is greatly improved. Most important feature in our algorithm is that the watermark can be extracted without any reference to the original image. As a result, the cost of storing carrier data can be saved remarkably.

Imperceptible and Robust Blind Video Watermarking Using Chrominance Embedding: A Set of Approaches in the DT CWT Domain

Illegal distribution of a digital movie is a significant threat to the film industries. With the advent of high-speed broadband Internet access, a pirated copy of a digital video can be easily distributed to a global audience. Digital video watermarking is a possible means of limiting this type of digital distribution. In existing watermarking methods, the watermark is usually embedded into the luminance channel of a video frame, which affects imperceptibility. In addition, none of the existing techniques are robust to the combination of commonly used attacks, such as compression, upscaling, rotation, cropping, downscaling in resolution, frame rate conversion, and camcording. In this paper, we initially propose a basic blind digital video watermarking algorithm, where the watermark is embedded into one level of the dual-tree complex wavelet transform of the chrominance channel to provide high quality watermarked video and extracted using the same key that was used for embedding. This algorithm is robust to compression, upscaling, rotation, and cropping. An extension of this method extracts the watermark from any level(s) of the dual-tree complex wavelet transform depending on the resolution of the downscaled version of the watermarked frame rather than only from the embedding level to survive downscaling to an arbitrary resolution. Finally, the watermark of a frame is extracted from the information of that frame without using the key that was used during watermark embedding to provide robustness to temporal synchronization attacks, such as frame rate conversion. This scheme is also robust to compression, camcording, watermark estimation remodulation, temporal frame averaging, multiple watermark embedding, downscaling in resolution, and other geometric attacks, such as upscaling, rotation, and cropping.

Comparative Analysis of Blind Digital Image Watermarking Utilising Dual Encryption Technique in Frequency Domains

Piracy in the presence of internet and computers proves to be a biggest jolt to the concerned industry. To reduce the piracy and duplicity of the images, digital watermarking technique is having an edge over the other available techniques. In this paper, a blind digital watermarking algorithm is presented which is robust enough to resist the watermark against the attacks. The algorithm exploits the random sequence generated by Arnold and Chaos transformations. Discrete wavelet transformation of third level decomposition is used to convert the image into its frequency domain. In another transformation, the image is converted into frequency domain by using DCT and DWT combined. The binary watermark is embedded into its HL3 domain. The evaluation of the algorithm is calculated in terms of peak signal to noise ratio and non correlation. The results prove that the algorithm is robust enough to handle the attacks like JPEG, filtering, and different types of noise attacks.

An Adaptive Blind Watermarking Algorithm for Color Image

This paper proposed a novel blind color digital watermarking algorithm based on Integer Discrete Wavelet Transform (IDWT) and Human Visual System (HVS). Firstly, color watermark image was processed into one dimension digital information, and color host image was converted into YIQ color space. Then, according to the features of HVS, encrypted watermark was embedded adaptively into the Y luminance component of the YIQ color space in IDWT domain. The proposed algorithm allowed extracting watermark without the help of original watermark and host image. Experiment results show that the embedded watermark is invisible and robust against common image attacks. DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1900

A novel blind digital watermarking algorithm for embedding color image into color image

A robust and blind watermarking technique for dual color images is proposed in this paper. According to the energy concentrating feature of DCT, the two-level DCT is introduced and used to embed color watermark image into color host image, which is completely different with the traditional DCT. For reducing the redundancy of watermark information, the original color watermark image is compressed by the proposed compression method. After two-level DCT, nine AC coefficients in different positions of each sub-block are selected and quantified to embed watermark information. Moreover, only the extraction rules are used to extract watermark from the watermarked image without resorting to the original host image or watermark image. Experimental results show that the proposed watermarking algorithm can effectively improve the quality of the watermarked image and the robustness of the embedded watermark against various attacks.

Robust Blind Digital Watermarking in Contourlet Domain

paper presents an invisible robust blind digital watermarking algorithm using adaptive and distributed quantization in contourlet domain for colour images. In the proposed watermarking scheme, the blue plane of the colour image is decomposed into series of multiscale, local and directional sub images using contourlet transform. The low frequency component of the transform is divided into non overlapping blocks, into which Arnold scrambled binary watermark is embedded, with help of adaptive quantization step value of each block. A blind detection algorithm is employed for the watermark recovery process, which does not require the original image. Experimental results show that the proposed algorithm is highly resistant to attacks such as JPEG compression, noising, cropping etc. The proposed method is compared with an odd-even quantization based technique and the results prove that the adaptive quantization based technique gives better robustness, under similar conditions.

Blind Digital Image Watermarking Robust Against Histogram Equalization

Problem statement: Piracy in the presence of internet and computers proves to be a biggest damage to the industry. Easy editing and copying of images yields a great damage to the owner as original images can be distributed through internet very easily. To reduce the piracy and duplicity of the digital multimedia files, digital watermarking technique is dominating over the other available techniques. There are certain methods or attacks which are used to damage the watermark. One of the major attacks is histogram equalization and reducing the number of histogram equalized levels. Thus, there is a need to develop a method so that the watermark can be protected after histogram equalization. Approach: A blind digital watermarking algorithm is presented which embed the watermark in frequency domain. Firstly, DWT is applied on the original image and then DCT on the 4×4 blocks to target the particular frequencies of the image for embedding the watermark which does not have more effect after histogram equalization. Also, to enhance the security of the watermark dual encryption technique is deployed. Results: Algorithm applied to four images which are Lena, Cameraman, Baboon and Peppers. The evaluation of the algorithm is calculated in terms of peak signal to noise ratio and non correlation. The results prove that the algorithm is robust to histogram equalization attack up to 2 grey levels. Conclusion/Recommendations: The developed algorithm proved its performance against histogram equalization but the algorithm can also be checked for the other attacks which can be addition of white noise, Gaussian noise, filtering.

Blind Digital Image Watermarking Algorithm Based on the Chain Code

A new blind digital watermarking algorithm based on the chain code is proposed. The chain code is obtained by the characteristics of the original image -the edge contour. The feather can reflect the overall correlation of the vector image, and chain code expression can significantly reduce the boundary representation of the amount of data required. For the watermarking embedding, the original vector image is divided into sub-block images, and two bits of the watermarking information are embedded into sub-block images repeatedly by quantization. For watermarking extracting, the majority decision method is employed to determine the size of the extracted watermark. Experimental results show that the image quality is not significantly lowered after watermarking. The algorithm can resist the basic conventional attacks and has good robustness on the shear attacks.

Blind Digital Watermarking of Integer Wavelet Transform

In the light of JPEG compression attack, a blind digital watermarking algorithm of integer wavelet transform is proposed in this paper. Before the watermarking image is embedded, the cover image is decomposed by integer wavelet transform, and the binary watermarking image is scrambled to enhance its security. The scrambled digital watermarking is embedded into the cover image by means of modulo operation and modification of the integer wavelet transform coefficients of the cover image. The digital watermarking is extracted only by means of the modulo operation of the integer wavelet transform coefficients of the watermarked image and threshold ruling, and not depending on the original cover image. The experiments have shown that the blind digital watermarking algorithm can strongly resist JPEG compression attack.

Blind Digital Watermarking Algorithm Based on SVD Decomposition

In order to balance the algorithm’s robustness and the watermark’s transparency better, a blind digital watermarking algorithm based on SVD decomposition was proposed. First, divided the original image into a number of 8*8 size blocks; then execute DCT transform on each block; next, execute SVD decomposition on each 2*2 size block of DC coefficients set with the purpose of get-ting the corresponding singular value matrix; finally, complete the watermark embedding by quali-fying the largest singular value using a step value Q based on the principle of parity quantification. The algorithm extracts DC coefficients as carriers of watermark image from the DCT coefficients domain, ensuring the robustness of this algorithm. Meanwhile, the transparency of the watermark image is increased by using the result of SVD transforms performs intrinsic properties of images ra-ther than the visual characteristics of images. Further more, this paper theoretically analyzes the in-fluence of the quantization step Q on the image quality, and selects the optimal Q value according to the result of the experiments. Experiments show that the algorithm can effectively resist JPEG compression, median filtering, noise and other conventional tampering operations, watermark can be extracted without the participation of the original image, achieving the blind detection of water-mark.

A New Adaptive Digital Audio Watermarking Based on Support Vector Regression

On the basis of support vector regression (SVR), a new adaptive blind digital audio watermarking algorithm is proposed. This algorithm embeds the template information and watermark signal into the original audio by adaptive quantization according to the local audio correlation and human auditory masking. The procedure of watermark extraction is as follows. First, the corresponding features of template and watermark are extracted from the watermarked audio. Then, the corresponding feature of template is selected as training sample to train SVR and an SVR model is returned. Finally, the actual outputs are predicted according to the corresponding feature of watermark, and the digital watermark is recovered from the watermarked audio by using the well-trained SVR. Experimental results show that our audio watermarking scheme is not only inaudible, but also robust against various common signal processing (such as noise adding, resampling, requantization, and MP3 compression), and also has high practicability. In addition, the algorithm can extract the watermark without the help of the original digital audio signal, and the performance of it is better than other SVM audio watermarking schemes.

Digital watermarking algorithm based on wavelet transform and neural network

An effective blind digital watermarking algorithm based on neural networks in the wavelet domain is presented. Firstly, the host image is decomposed through wavelet transform. The significant coefficients of wavelet are selected according to the human visual system (HVS) characteristics. Watermark bits are added to them. And then effectively cooperates neural networks to learn the characteristics of the embedded watermark related to them. Because of the learning and adaptive capabilities of neural networks, the trained neural networks almost exactly recover the watermark from the watermarked image. Experimental results and comparisons with other techniques prove the effectiveness of the new algorithm.