A Robust Image Watermarking Based on Image Restoration Using SIFT

This paper introduces a novel robust watermarking scheme for digital images, which is robust against common signal processing and geometric distortion attacks. In order to be resistant to geometric distortion attacks, the matched feature points determined by the scale-invariance feature transform (SIFT) are used for image restoration to reduce the synchronization errors caused by geometric distortion attacks. An adaptive embedding scheme is applied in discrete Fourier transform (DFT) domain of each subimage. The watermark detection decision is based on the number of matched bits between the retrieved and original watermark in the embedding image blocks. Experimental results show that the proposed watermarking is robust to common signal processing attacks and geometric distortion attacks, including rotation, scaling, cropping, shearing and some combined attacks

A New Digital Watermarking Algorithm Based On DWT-DCT-RLC

Abstract: The paper presents an imperceptible and robust digital watermarking algorithm using a combination of the DWT-DCT , which improves the robustness via using new embedding strategy. Apply 4-level DWT to the host image. Then, DCT transform of each directional middle frequencies DWT subband is computed; A binary watermarked logo is coded by Run-Length Code(RLC);The watermark bits are embedded in the coefficients of the DCT block based on the energy of each corresponding to coefficient in the highest level selected using the value of RLC. Performance evaluation show that the proposed scheme is invisible and robust against common image manipulations like JPEG compression, noise adding, sharpening, filtering. I Introduction Image watermarking is the process of embedding the ownership information into host data so that intellectual copyrights can be identified. Along with the rapid growth of novel watermarking schemes, various attacking attempts have also been developed to destroy watermarking II Theory A.Run Length Code Run-length code (RLC) is a very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. This is most useful on data that contains many such runs: for example, simple graphic images such as icons, line drawings, and animations

Robustness of a DFT based image watermarking method against am halftoning

U ovom radu je evaluirana otpornost na rastriranje metode označavanja slika bazirane na diskretnoj Fourierovoj transformaciji (DFT). Rastriranje se koristi za reprodukciju višetonskih slika. U istraživanju je korišten set od 1000 slika. Za rastriranje su korištena tri različita oblika rasterskog elementa (točka, elipsa i linija) i 5 različitih linijatura (10, 13, 15, 40 i 60 lin/cm). Evaluirana je vjerojatnost detekcije i distribucija postignutih vrijednosti detekcije. Rezultati su pokazali da je ispitivana metoda označavanja slika otporna na rastriranje linijaturama većim od 15 lin/cm. Također, zaključeno je da oblik rasterskog elementa ima slab utjecaj na stupanj detekcije.In this paper the robustness of a Discrete Fourier Transform (DFT) based image watermarking scheme to amplitude modulation (AM) halftoning is evaluated. Halftoning is used for reproduction of continuous images. Thus, it is important that a watermarking method is robust to halftoning. Three different shapes of clustered dots of AM (Amplitude Modulation) halftones are used (round, ellipse and line) with five different halftone frequencies (10, 13, 15, 40, and 60 line/cm). The tests where done on a dataset of 1000 images. As the metric of robustness, watermark detection rate, distribution of detection values, and ROC (Receiver Operation Characteristic) curves were used. The results showed that the watermarking scheme is robust to halftoning for halftone frequencies greater than 15 line/cm. Also, the type of AM halftone used has almost no effect on a detection rate

Watermarking security: theory and practice

This article proposes a theory of watermarking security based on a cryptanalysis point of view. The main idea is that information about the secret key leaks from the observations, for instance watermarked pieces of content, available to the opponent. Tools from information theory (Shannon's mutual information and Fisher's information matrix) can measure this leakage of information. The security level is then defined as the number of observations the attacker needs to successfully estimate the secret key. This theory is applied to two common watermarking methods: the substitutive scheme and the spread spectrum based techniques. Their security levels are calculated against three kinds of attack. The experimental work illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels derived in the theoretical part of the article

Local Geometric Distortions Resilient Watermarking Scheme Based on Symmetry

As an efficient watermark attack method, geometric distortions destroy the synchronization between watermark encoder and decoder. And the local geometric distortion is a famous challenge in the watermark field. Although a lot of geometric distortions resilient watermarking schemes have been proposed, few of them perform well against local geometric distortion like random bending attack (RBA). To address this problem, this paper proposes a novel watermark synchronization process and the corresponding watermarking scheme. In our scheme, the watermark bits are represented by random patterns. The message is encoded to get a watermark unit, and the watermark unit is flipped to generate a symmetrical watermark. Then the symmetrical watermark is embedded into the spatial domain of the host image in an additive way. In watermark extraction, we first get the theoretically mean-square error minimized estimation of the watermark. Then the auto-convolution function is applied to this estimation to detect the symmetry and get a watermark units map. According to this map, the watermark can be accurately synchronized, and then the extraction can be done. Experimental results demonstrate the excellent robustness of the proposed watermarking scheme to local geometric distortions, global geometric distortions, common image processing operations, and some kinds of combined attacks