Blind Digital Watermarking Research Articles

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.

Blind Watermarking Algorithm for Color Images Based on Nearest Neighbor Interpolation

In this paper, we present a blind digital watermarking method for color image based on nearest neighbor interpolation. The algorithm has the following characteristics: (1) it generate adaptive watermark based on the size of carrier image,so as to improve the robustness of binary watermark; (2) the watermark is embedded in the DCT coefficient of intermediate frequency, which can effectively resist common attacks, such as Gaussian noise-adding, salt and pepper noise-adding, cropping, Wiener filtering, JPEG compression;(3) the watermarking detection is simple and fast, and does not require carrier image. The experiments show that the algorithm has good invisibility and strong robustness.

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 Watermarking Scheme Based on Compressive Sensing and Bregman Iteration

A digital watermark is a marker embedded in a signal for the ownership identification of the copyright. In this paper, we propose a half blind digital watermark method based on compressive sensing and singular value decomposition. The proposed method replaces the singular values of the HH band of the cover image in discrete wavelet transform domain with the singular values of the compressive watermark. To guarantee secure recovery from compressed watermarking measurements, specific chaotic matrix can act as an authentication mechanism, which satisfies the restricted isometry property, to implement action of the sensing procedure. With this special authorized matrix, the watermarking signal can be correctly reconstructed. The proposed method also uses Bregman iteration to improve the perceptual quality for their successful use of denoising of images before. Simulation results verify the effectiveness of the proposed approach and the performance is considerable.

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.

A blind digital audio watermarking scheme based on EMD and UISA techniques

In this paper, a new perceptual spread spectrum audio watermarking scheme is discussed. The watermark embedding process is performed in the Empirical Mode Decomposition (EMD) domain, and the hybrid watermark extraction process is based on the combination of EMD and ISA (Independent Subspace Analysis) techniques, followed by the generic detection system, i.e. inverse perceptual filter, predictor filter and correlation based detector. Since the EMD decomposes the audio signal into several oscillating components---the intrinsic mode functions (IMF)---the watermark information can be inserted in more than one IMF, using spread spectrum modulation, allowing hence the increase of the insertion capacity. The imperceptibility of the inserted data is ensured by the use of a psychoacoustical model. The blind extraction of the watermark signal, from the received watermarked audio, consists in the separation of the watermark from the IMFs of the received audio signal. The separation is achieved by a new proposed under-determined ISA method, here referred to as UISA. The proposed hybrid watermarking system was applied to the SQAM (Sound Quality Assessment Material) audio database (Available at http://sound.media.mit.edu/mpeg4/audio/sqam/ ) and proved to have efficient detection performances in terms of Bit Error Rate (BER) compared to a generic perceptual spread spectrum watermarking system. The perceptual quality of the watermarked audio was objectively assessed using the PEMO-Q (Tool for objective perceptual assessment of audio quality) algorithm. Also, using our technique, we can extract the different watermarks without using any information of original signal or the inserted watermark. Experimental results exhibit that the transparency and high robustness of the watermarked audio can be achieved simultaneously with a substantial increase of the amount of information transmitted. A reliability of 1.8 10Â?Â?Â?4 (against 1.5 10Â?Â?Â?2 for the generic system), for a bit rate of 400 bits/s, can be achieved when the channel is not disturbed.

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.

Non Blind Digital Watermarking Technique Using DWT and Cross Chaos

Watermarking techniques have been developed to protect digital images against illegal reproductions and illegal modifications. In this paper, a non-blind digital image watermarking algorithm based on Discrete wavelet transform, Cross chaotic map and Arnold transform, has been described. Initially, Discrete wavelet transformation is done and the medium frequency coefficients are extracted as the embedding field. Then, Arnold's transformation and Cross chaotic sequence are used to encrypt the watermark and the medium frequency coefficients of the watermark image are extracted to be embedded into the original image. It is a kind of non-blind scheme as the extraction needs the original image. Peak signal to noise ratio (PSNR) is used to evaluate the algorithm. The quality of the extracted watermark is evaluated using term Normalized cross-correlation (NC). From the results, it may be concluded that the modified algorithm is resistant enough against the common attacks.

A Blind Digital Watermark Method Based on SVD and Chaos

A blind digital watermark method based on singular value decomposition (SVD) and Chaos was proposed in this paper. Firstly the watermark was encrypted by Tent chaotic sequence, and then the cover image is decomposed by SVD, the encrypted watermark is embedded into the singular values of the cover image, and the watermark can be extracted without the original image. The experimental results indicate that the proposed method is robust against attacking such as JPEG compression, addition of noise, cropping, rotation and contrast adjustment.

DWT와 셀룰라 오토마타 변환을 이용한 블라인드 워터마킹 비교

본 논문에서는 새로운 변환 기법인 셀룰라 오토마타 변환을 이용한 워터마킹 방법과 기존의 DWT를 이용한 방법을 비교한다. 이 두 방법 모두 서로 상반되는 임의의 패턴 정보를 사용하여 워터마크 정보를 영상에 삽입한다. 셀룰라 오토마타 변환은 DWT와 달리 더 많은 정보 즉, 룰 번호, 초기 값, 격자 크기 등 다양한 초기값을 이용하여 기저함수를 생성하여 변환한다. DWT와 셀룰라 오토마타 변환을 이용하여 변환된 영상의 계수를 분석 및 비교한 후 워터마킹 성능을 비교한다. 모의실험에서는 워터마크 정보가 삽입된 영상에 대한 PSNR 및 정규화 상관계수를 이용하여 원영상과의 가시적인 동일성과 다양한 외부 공격에 대한 강인성을 비교한다. 셀룰라 오토마타 변환을 이용한 워터마킹 방법이 DWT를 이용한 방법보다 JPEG 압축, 미디언 필터, 크기 변환, 잘라내기 및 히스토그램 평활화 등 대부분의 공격에 대하여 강인함을 보여준다. In this paper, we propose a novel blind digital watermarking method based on a cellular automata transform (CAT). CAT is based on dynamic systems known as cellular automata(CA) and uses transform bases which are differently defined by a rule number, the number of neighbors, the number of cells, and an initial state, etc. The proposed CAT based method is compared with a blind watermarking method based on DWT which is commonly used for a domain transform in signal processing. We analyse properties on changes of DWT coefficients and CAT coefficients under various attacks and determine optimal parameters for a watermarking method robust to attacks. The simulations show that the watermarked images with high PSNR and MSSIM look visually identical to originals and are robust against most of typical image processing attacks. Moreover, the proposed CAT based watermarking method is superior to the DWT based one in robustness to most of typical image processing attacks including JPEG compression, median and average filtering, scaling, cropping, and histogram equalization.

Blind digital watermarking of rational Bézier and B-spline curves and surfaces with robustness against affine transformations and Möbius reparameterization

We present a blind watermarking scheme for rational Bézier and B-spline curves and surfaces which is shape-preserving and robust against the affine transformations and Möbius reparameterization that are commonly used in geometric modeling operations in CAD systems. We construct a watermark polynomial with real coefficients of degree four which has the watermark as the cross-ratio of its complex roots. We then multiply the numerator and denominator of the original curve or surface by this polynomial, increasing its degree by four but preserving its shape. Subsequent affine transformations and Möbius reparameterization leave the cross-ratio of these roots unchanged. The watermark can be extracted by finding all the roots of the numerator and denominator of the curve or surface: the cross-ratio of the four common roots will be the watermark. Experimental results confirm both the shape-preserving property and its robustness against attacks by affine transformations and Möbius reparameterization.

A Watermarking Algorithm Based on Block Energy Analysis of Wavelet Transform's Coefficients and Lorenz Chaotic Attractor

Abstract Perceptual transparency and robustness are conflicting requirements. To ensure the security of the watermark,how to choose the embedding position and intensity is a difficult problem. Chaotic system has characteristics of sensitivity to initial value and unpredictability. High-dimensional chaotic systems have advantage of higher secrecy, so this paper chooses Lorenz chaotic attractor to encrypt binary watermark image. Through the statistic analysis of block energy of the host image, which is applied DWT repeatedly up to the third level, so watermark adaptively embedded into the greatest coefficients which belong to the selected blocks by using the properties of human visual system. Additionally, to realize the blind digital watermarking extraction, chaotic sequence is also applied in selected wavelet coefficients to change the original value of the inherent relationship between wavelet coefficients. Theoretical analysis and experiment results show that the proposed algorithm has high robustness and better performance of perceptual transparency.

A Technology of Printing Forgery Prevention for Certificates Based on Fingerprint Information

A new method of printing forgery prevention for certificates is proposed after researching on various algorithms of digital watermarking technology, fingerprint recognition technology, watermarking technology, encryption, and digital printing technology. The fingerprint image of the certificate owner is regarded as a watermarking and inserted in the certificate carrier. The encrypted fingerprint holographic watermarking techique is applied to increase the safty of the certificate information and realize the forgery prevention. The certificate presswork which has the encrypted fingerprint holographic watermarking information is printed by the printer. In the identification process, an ordinary scanner is employed to input certificate image information. We can use the obtained decryption keys to extract the watermark information by blind digital watermarking extracting method. The fingerprint collected on site is authorized by the extracting fingerprint information. By combining digital watermarking with fingerprint recognition technology, we realized safe authentication of user’s identity with imperceptibility of digital watermarking and the uniqueness of fingerprint recognition. This technology has some advantages. It is simple in information collecting and generating method, low in facturing cost and high in safe authentication. It has some practical application value.

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.

DWT Based Blind Digital Video Watermarking Scheme for Video Authentication

Digital video is one of the popular multimedia data exchanged in the internet. Due to their perfectly replicable nature many illegal copies of the original video can be made. Methods are needed to protect copyrights of the owner and prevent illegal copying. A video can also undergo several intentional attacks like frame dropping, averaging, cropping and median filtering and unintentional attacks like addition of noise and compression which can compromise the owner information thereby denying authentication. In this paper, a robust Discrete Wavelet Transform (DWT)-based blind digital video watermarking scheme with scrambled watermarks based on scene changes has been proposed for authentication of digital video, which embeds different parts of a single watermark into different scenes of a video. The video watermarking algorithm is robust against the attacks of frame dropping, averaging and compression, which are considered as some of the common types of attacks applied particularly on the video and due to the use of DWT it can also withstand geometrical attacks making the watermark perceptually invisible. Furthermore, it allows blind retrieval of embedded watermark which does not need the original video. The proposed algorithm has been compared with an existing DWT based watermarking scheme and is found to exhibit better robustness.

Blind Watermarking of Color Images Using Karhunen-Loeve Transform Keying

This paper presents a method for blind digital watermarking of color images. The proposed scheme performs a decorrelation of the RGB color bands of the image to be watermarked using a Karhunen–Loeve transform (KLT), then marks the coefficients of the KLT of the first band obtained. The novelty of the method resides in the fact that the KLT basis images used for the transforms are not related to the image being marked, but are from an image taken as the secret key used throughout the scheme. The watermarking of the chosen KLT coefficients is performed using an i.i.d. Gaussian sequence. The method shows good robustness to attacks and signal processing operations, in particular to JPEG compression, filtering, resampling and noise addition, maintaining at the same time a high image quality. In addition, the scheme is secure against protocol attacks such as copy attack and ambiguity attack.

A blind digital watermark technique for color image based on integer wavelet transform and SIFT

Abstract This paper presents an anti-geometric attacks algorithm of color image watermarking based on the scale-invariant feature transformation (SIFT). Firstly, the method detects SIFT feature points in the red component of a true color image and filters out the feature points information. Then three-level Discrete Integer Wavelet Transform (DIWT) is performed on the blue and green component of the color image to extract the low-frequency component coefficient. Finally, a binary watermark which has been scrambled is embedded in the low-frequency wavelet coefficients of the blue component. The simulation results show that the algorithm is robust against signal processing and geometric attacks.