A new robust blind image watermarking method based on lifting wavelet transform (LWT), and Schur decomposition in combination with discrete cosine transform (DCT), and entropy analysis for copyright protection of multimedia information is introduced in this paper. At first, the 2-level LWT is applied to the original image to improve the invisibility of the watermarking method and then the high-frequency sub-band of 2-level LWT is decomposed by DCT. Then, the DCT coefficients are divided into 4×4 non-overlapping blocks. After that, Schur decomposition applies to each selected block, while the first row, the first column element of the upper triangular matrix is used to embed the watermark. For evaluation, the invisibility and robustness of the proposed watermarking method, the peak signal to noise ratio (PSNR), and normalized cross-correlation (NC) are used to measure the quality and the ability of the proposed watermarking method to be robust against signal processing operations and geometric attacks. Experimental results have demonstrated that the proposed method is achieved a very good tradeoff between invisibility and robustness. The comparisons with other scheme have shown that the proposed digital watermarking scheme has a superior performance in terms of invisibility than other. 

In this paper, a novel robust blind grayscale image digital watermarking scheme is introduced based on lifting wavelet transform (LWT) in combination with discrete cosine transform (DCT), Hessenberg decomposition, and entropy analysis for copyright protection of multimedia information. At first, the two levels of LWT are applied to the host grayscale image to improve the imperceptibility of the watermarking scheme and then the high-frequency sub-band of the 2-level of LWT is decomposed by DCT. Next, the DCT coefficients are divided into 4× 4 non-overlapping blocks. After that, Hessenberg decomposition performs on each selected block, whereas the first row, first column element of the upper Hessenberg matrix is utilized to hide the watermark. To evaluate the imperceptibility and robustness of the proposed digital watermarking scheme, the peak signal-to-noise ratio (PSNR), and normalized cross-correlation (NC) are utilized to measure the quality and the ability of the proposed watermarking scheme to robust against signal processing operations and geometric attacks. Experimental and analysis results have demonstrated that the proposed scheme is achieved a very good tradeoff between imperceptibility and robustness. The comparison with other scheme have shown that the proposed digital watermarking schemes have a superior performance in terms of imperceptibility and robustness than other

This paper presents a new high-capacity algorithm for audio watermarking for the purpose of embedding a watermark audio signal into an original audio signal. This algorithm uses DCT (discrete cosine transform) in combination with SVD (singular value decomposition), DWT (discrete wavelet transform), and CZT (chirp ztransform). For the purpose of ensuring high levels of imperceptibility and robustness, a low-frequency sub band of 1-level DWT is selected to embed the watermark, followed by DCT, CZT, and SVD. As a result, the proposed algorithm achieves a high capacity of 352800 bits per second while a good quality audio signal is maintained (having an objective difference grade of more than-0.04). It also provides high imperceptibility (a signal to noise ratio of more than 58 dB) and it is extremely resistant to common audio attacks, including requantizing, resampling, additive white Gaussian noise or AWGN, MP3 compression, and low-pass filtering. The proposed algorithm presents much better compared to the audio watermarking algorithms already existent.

A novel non-blind audio watermarking algorithm, using chirp z-transform in combination with discrete wavelet transform and singular value decomposition, is presented in this paper. In the proposed method, a watermark audio signal (about 13 seconds in length) is hidden into an original audio signal (about 51 seconds in length) by applying discrete wavelet transform, chirp z-transform, and singular value decomposition. The effectiveness of the proposed algorithm has been tested using signal-to-noise ratio, objective difference grade (ODG), and normalised cross- correlation of watermarked audio signal under various common audio attacks. Experimental results demonstrate that the algorithm has a high capacity (352.8 kbps), without significant perceptual distortion (ODG > -0.29) and provides good robustness against common audio attacks, including: re-sampling, echo addition, MP3 compression, additive white Gaussian noise, re- quantisation, cutting, and low-pass filtering. This algorithm has a high capacity and excellent audio quality compared with other audio watermarking algorithms.

Watermarking techniques have been considered as one of the best efficacious methods 

to solve the issues of protecting copyright due to the proliferation of digital multimedia 

information on the internet. The digital multimedia information is such as image, 

audio, and video which can today be easily copied, distributed, and modified without 

loss in fidelity. As a result, it is necessary to utilize some kind of copyright protection 

techniques to avoid illegal copying, distribution, and digital copyright modification. 

The digital watermarking techniques have engaged the researchers’ attention as a 

technique for protecting copyright in the digital multimedia information. This 

technique includes a subcategory of information-hiding technologies in which the 

ownership information is hidden into the original multimedia information without 

impacting the original multimedia information quality. Despite the advances in digital 

watermarking techniques, the main objective of many types of research in digital 

watermarking topic is to improve transparency and resistance to attacks and the present 

digital watermarking schemes are not sufficiently stable or strong against various 

attacks. This study aims to develop state-of-the-art digital watermarking techniques 

for different multimedia information through improving the imperceptibility and 

robustness to geometrical attacks and signal processing operations. Four novel robust 

blind digital watermarking schemes are introduced in this thesis for copyright 

protection of multimedia information that have not been previously introduced. The 

first robust blind digital watermarking scheme is applied for colour images utilizing 

discrete wavelet transform in combination with Walsh Hadamard transform and 

Hessenberg decomposition. The second robust blind digital watermarking scheme is 

applied for grayscale images utilizing discrete wavelet transform in combination with 

Walsh Hadamard transform and Hessenberg decomposition. The third robust blind 

digital watermarking scheme is applied for colour videos utilizing discrete wavelet 

transform in combination with Walsh Hadamard transform and Hessenberg 

decomposition. Forth robust blind digital watermarking scheme is applied for audio 

signals utilizing discrete wavelet transform in combination with Walsh Hadamard 

transform and Hessenberg decomposition. Several experiments are performed in order 

to present the effectiveness of the proposed digital watermarking schemes in terms of 

imperceptibility and robustness against attacks related to each scheme. The proposed 

digital watermarking schemes achieve good imperceptibility and robustness against 

geometrical attacks and signal processing operations. The proposed digital 

watermarking schemes have a superior performance in terms of imperceptibility and 

robustness than other reported schemes in the literature.

Keywords: Watermarking, Copyright Protection, Discrete Wavelet Transform, Walsh 

Hadamard Transform, Hessenberg Decomposition.

Colour image watermarking has become one of the most important algorithms for copyright protection. The following paper will present an innovative scheme for watermarking blind colour images using the discrete wavelet transform (DWT), fast Walsh Hadamard transform (FWHT) and the Hessenberg decomposition as its basis. First, two-level DWT followed by FWHT are used to decompose the host image’s red channel. Next, the FWHT coefficients are split into 4× 4 non-overlapping blocks. Then, each selected block is decomposed using Hessenberg decomposition, where the first row, first column element of the upper Hessenberg matrix H is quantified to embed the watermark information. Peak signalto-noise ratio, normalized cross-correlation and structural similarity index measure are used to evaluate the feasibility and the robustness. The experimental results have demonstrated that the proposed watermarking scheme is highly invisible with PSNR> 40 dB, for several watermarked colour images, with a capacity of 4096 bits and execution time of 0.7415 s. The proposed watermarking scheme is also highly resistant to both common image processing and geometrical attacks such as filtering, JPEG2000, noise adding, cropping, scaling, blurring and sharpening, and others

The current paper proposes a novel scheme for non-blind watermarking of images, making use of discrete wavelet transform (DWT), discrete time Fourier transform (DTFT), as well as singular value decomposition, or SVD. During the process of embedding, 1-level DWT is used to decompose the host image into its various frequency sub-bands. After this, the high-frequency sub band receives an application of DTFT. This is followed then by SVD, after which the watermark becomes embedded into the now-transformed host image's singular matrix. Then, the inverses of 1-level DWT, DTFT and SVD are applied in order to obtain a watermarked final image. This paper evaluates the performance of the proposed method of watermarking against a number of attacks, including sharpening, salt and pepper noise, AWGN, gamma correction, histogram equalisation, flipping and cropping. Results obtained during experiments have found that the scheme as proposed does provide high levels of robustness and imperceptibility against various signal processing attacks.