AN IMPROVED WAVELET DOMAIN DIGITAL WATERMARKING FOR IMAGE PROTECTION

Author(s):  
DEJEY ◽  
R. S. RAJESH

Watermarking is a potential method for the protection of ownership rights on digital images. A robust, invisible, non-blind watermarking scheme in the wavelet domain is proposed in this paper. The watermark is embedded in the mid frequency band after performing a single level wavelet decomposition using Discrete Wavelet Transform (DWT). The coefficients are grouped randomly prior to watermarking. The watermarked image is tested for various attacks including filtering and geometric attacks. The novelty of the proposed approach is that it provides better resistance to collusion attack also when compared with existing spatial domain approach. The appropriate mid frequency band for embedding the watermark is tested and the HL band proves to be the best.

Author(s):  
Hanen Rhayma ◽  
Achraf Makhloufi ◽  
Habib Hamam ◽  
Ahmed Ben Hamida

2020 ◽  
Author(s):  
Yujian Zhuang ◽  
Xiaoyi Zhou ◽  
Sheng Liu

Abstract The existing robust digital watermarking schemes mainly embed information in the fixed positions or with fixed embedding strength, while seldom considering adaptive adjustment based on the characteristics of the cover image, thus it reduces the imperceptibility and the robustness of watermarking. Aiming at these issues, we propose a scheme which can be able to dynamically adjust the watermark embedding position and strength. Therefore, it guarantees the trade-off between robustness and imperceptibility. The appropriate embedding positions are dynamically selected for the watermark by comparing the image entropy, and the embedding strength of the image blocks are adaptively adjusted according to the entropy and the Just Noticeable Difference (JND) model in the Human Visual System (HVS)-based wavelet domain. Singular Value Decomposition (SVD) is performed on the image blocks to ensure the resistant ability of geometric attacks. The experimental results show that the scheme has good imperceptibility as well as strong robustness against various attacks. The robustness in common attacks is improved by at least 1% compared with similar watermarking schemes.


2011 ◽  
Vol 403-408 ◽  
pp. 3510-3518
Author(s):  
Sanaz Shahraeini ◽  
Mahdi Yaghoobi

The recent progress in the digital multimedia technologies has offered many facilities in the transmission, reproduction and manipulation of data. However, this advance has also brought the problem such as copyright protection for content providers. Digital watermarking is one of the proposed solutions for copyright protection of multimedia. This paper proposes a blind watermarking algorithm based on fractal model in discrete wavelet domain for copyright protection. The idea of the presented scheme is to hide a binary image as a watermark with fractal parameters in wavelet domain of host image. Fractal compression technique is used to encode a gray image and fractal codes are embedded into the wavelet coefficients of the gray image according to well-connected watermark algorithm. The experimental results show that the algorithm is robust against geometric and non geometric attacks.


2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Jun Zhang ◽  
Xiaoyi Zhou ◽  
Jilin Yang ◽  
Chunjie Cao ◽  
Jixin Ma

With the intensive study of machine learning in digital watermarking, its ability to balance the robustness and transparency of watermarking technology has attracted researchers’ attention. Therefore, quantum genetic algorithm, which serves as an intelligent optimized scheme combined with biological genetic mechanism and quantum computing, is widely used in various fields. In this study, an adaptive robust blind watermarking algorithm by means of optimized quantum genetics (OQGA) and entropy classification-based SVM (support vector machine) is proposed. The host image was divided into two parts according to the odd and even rows of the host image. One part was transformed by DCT (discrete cosine transform), and then the embedding intensity and position were separately trained by entropy-based SVM and OQGA; the other part was by DWT (discrete wavelet transform), in which the key fusion was achieved by an ergodic matrix to embed the watermark. Simulation results indicate the proposed algorithm ensures the watermark scheme transparency as well as having better resistance to common attacks such as lossy JPEG compression, image darken, Gaussian low-pass filtering, contrast decreasing, salt-pepper noise, and geometric attacks such as rotation and cropping.


Author(s):  
S. Thabasu Kannan ◽  
S. Azhagu Senthil

Now-a-days watermarking plays a pivotal role in most of the industries for providing security to their own as well as hired or leased data. This paper its main aim is to study the multiresolution watermarking algorithms and also choosing the effective and efficient one for improving the resistance in data compression. Computational savings from such a multiresolution watermarking framework is obvious. The multiresolutional property makes our watermarking scheme robust to image/video down sampling operation by a power of two in either space or time. There is no common framework for multiresolutional digital watermarking of both images and video. A multiresolution watermarking based on the wavelet transformation is selected in each frequency band of the Discrete Wavelet Transform (DWT) domain and therefore it can resist the destruction of image processing.   The rapid development of Internet introduces a new set of challenging problems regarding security. One of the most significant problems is to prevent unauthorized copying of digital production from distribution. Digital watermarking has provided a powerful way to claim intellectual protection. We proposed an idea for enhancing the robustness of extracted watermarks. Watermark can be treated as a transmitted signal, while the destruction from attackers is regarded as a noisy distortion in channel.  For the implementation, we have used minimum nine coordinate positions. The watermarking algorithms to be taken for this study are Corvi algorithm and Wang algorithm. In all graph, we have plotted X axis as peak signal to noise ratio (PSNR) and y axis as Correlation with original watermark. The threshold value ά is set to 5. The result is smaller than the threshold value then it is feasible, otherwise it is not.


Sign in / Sign up

Export Citation Format

Share Document