Sharif Digital Repository

In this paper, we used image inpainting as a means for reconstruction of small damaged portions of a watermarked image so that the hidden watermark is not detectable afterwards. Our new watermarking attack algorithm extends the exemplar-based inpainting method, and then we apply it to intended noisy watermarked images to alter the watermark detection process. Our approach is completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. The average PSNR/SSIM of the watermarked image after applying the proposed attack is more than 35/0.98 and the average NC for extracted watermark is lowers than 0.5, so... 

With the widespread internet usage, digital contents are easily distributed throughout the world. To eliminate concerns of producers and owners of digital contents, watermarking techniques are extensively being used. Robustness against intentional and unintentional attacks is a major quality of watermarking systems. Since different attacks tend to target different parts of the frequency spectrum, in this paper we propose a framework for blind watermarking which determines the type of attack that the image has gone through before extracting the watermark. Within this framework, we propose an attack classification method to identify the region of the frequency spectrum that is less damaged.... 

With the widespread internet usage, digital contents are easily distributed throughout the world. To eliminate concerns of producers and owners of digital contents, watermarking techniques are extensively being used. Robustness against intentional and unintentional attacks is a major quality of watermarking systems. Since different attacks tend to target different parts of the frequency spectrum, in this paper we propose a framework for blind watermarking which determines the type of attack that the image has gone through before extracting the watermark. Within this framework, we propose an attack classification method to identify the region of the frequency spectrum that is less damaged.... 

Recently, protecting the copyright of digital media has become an imperative issue due to the growing illegal reproduction and modification of digital media. A large number of digital watermarking algorithms have been proposed to protect the integrity and copyright of images. Traditional watermarking schemes protect image copyright by embedding a watermark in the spatial or frequency domain of an image. However, these methods degrade the quality of the original image in some extend. In recent years, a new approach called zero-watermarking algorithms is introduced. In these methods, the watermark does not require to be embedded into the protected image but is used to generate a verification... 

The growth of data communication networks has made digital watermarking an important issue for copyright and content protection. Achieving high level of robustness and good transparency are the main objectives of developing every digital watermarking algorithm. From among transform domains as the basis of watermark hiding place, Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) are the most commonly used transforms in literature. In this paper we propose a new hybrid DWT-SVD domain watermarking scheme taking into account the energy content of every chosen block of the selected DWT sub-band coefficients. Before embedding, we append a... 

Everyday, people share their digital media on the virtual networks; therefore, protecting them against piracy is worthy of consideration. Digital watermarking is a method to achieve this goal. In this paper, we propose a watermarking method in Discrete Cosine Transform (DCT) domain. For this purpose, DCT coefficients of the whole image are calculated. It helps to present a system without blockiness effects. Then, singular values of the watermark image are added to the low frequency DCT coefficients of cover image that are located on the main diagonal. We use scaling factors for watermark embedding to improve imperceptibility of the watermark. A vector of fixed elements, which is calculated... 

In this paper, we propose a new method for damaging and destroying robust invisible watermarks using an image resizing technique which is named seam carving. By using this method we are able to resize watermarked images in a content-aware manner so that the synchronization of the embedder and extractor of watermarking system is broken and the watermark detection becomes impossible. In contrast to the available benchmarks like Stirmark, proposed attack does not severely reduce the quality of the watermarked image. Therefore it maintains the commercial value of the watermarked image. We have tested the proposed method to attack 3 recent and robust watermarking methods and the results sound... 

One of the most important parameters in evaluating a watermarking algorithm is its capacity. Of course capacity has a paradoxical relation with two other important parameters: image quality and robustness. Generally, watermarking capacity is expressed by bit per pixel (bpp) unit measure. This measure does not show what the side effects would be on image quality and capacity. Therefore, we proposed a two dimensional measure named capacity curve which shows the effects of capacity on visual quality. In this measure we can find the amount of degradation by a numerical value for each modification in pixels. Our experimental results are compatible with previous works in this field. © 2008... 

This paper presents a novel patchwork audio watermarking scheme with a psychoacoustic model of HAS in DFT domain that has significantly higher detection robustness compared to standard and modified patchwork watermarking algorithms. In addition, watermark is perceptually tuned, so that its embedding is transparent. The proposed algorithm can be used for transmitting hidden data through telephone channel. Experimental results show that the proposed watermarking algorithm is sustainable against compression algorithms such as MP3, LPF, resampling, requantization and AWGN attacks. © 2008 IEEE  

This article proposes a blind discrete wavelet transform-discrete cosine transform (DWT-DCT) composite watermarking scheme that is robust against print and scan distortions. First, two-dimensional DWT is applied to the original image to obtain the mid-frequency subbands. Then, a one-dimensional DCT is applied to the selected mid-frequency subbands to extract the final coefficients for embedding the watermark. To specify watermarking parameters, we utilize a Genetic Algorithm to achieve a predefined image quality after watermark insertion. Suitable locations for watermarking are determined by analyzing the effect of a modeling algorithm. This model simulates noise and nonlinear attacks in... 

This paper presents an efficient scheme for blind watermark attacking using the concept of matching of the long-range data. The main idea of the proposed attack is to add plenty of noise to the watermarked image and then try to restore an unwatermarked copy of the noisy image. The aim is to destroy the watermark information without accessing the parameters used during the watermark embedding process. So, it allows our approach to be completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. Experimental results show the proposed algorithm's superiority over several other traditional watermarking... 

Watermarking (imperceptible insertion of data into the host image or soundtracks) has attracted many research interests in the recent decade. The aim of this correspondence is to introduce a none-blind, content-based method for image watermarking. It employs properties of Human Visual System (HVS) and is capable of embedding a high-energy watermark (consequently robust against lossy compressions and other kinds of attacks) while prevents perceptible degradation in the host image. To modulate the binary coded watermark on a spread-spectrum noise, the introduced algorithm is followed by spread-spectrum watermarking. The algorithm was simulated and experimental results represent magnificent... 

Along with the improvement of image watermarking techniques, the necessity for effectively and comprehensively evaluating various algorithms becomes imperative. In this paper, we first propose a new categorization that fits for most of the existing watermarking algorithms that work in the wavelet domain. Then an adaptive watermarking attack for evaluating the robustness of watermarking schemes that are based on the proposed categorization is presented. This attack determines the flat regions, edges, and textures of the watermarked image and based on known features of each region the proposed attack tries to destroy the watermark information. This is done by separately manipulating the... 

In this paper, we proposed a categorization for most of the existing watermarking algorithms that work in wavelet domain. Then an adaptive watermarking attack for digital images that is based on the proposed categorization is presented. This attack determines the flat regions, edges and textures of the watermarked image and based on known features of each region the proposed attack tries to destroy the watermark information by manipulating the wavelet coefficients of each region separately such that the least visual distortion will be imposed on the attacked image. We have tested the proposed method to attack two recent and robust watermarking methods and the results sound impressive. The... 

One of the most important parameters in evaluating a watermarking algorithm is its capacity. In fact, capacity has a paradoxical relation with other two important parameters: image quality and robustness. Some works have been done on watermarking capacity and a few on image complexities. Most works on watermarking capacity is based on information theory and the capacity values which are calculated based on these methods are very tolerate. In this paper we propose a new method for calculating image complexity based on Region Of Interest (ROI) concept. After that we analyze three complexity measures named: Image compositional complexity (ICC), Quad tree and ROI method, with three different... 

A major class of image and video watermarking algorithms, i.e. content-based watermarking, is based on the concept of Human Visual System (HVS) in order to adapt more efficiently to the local characteristics of the host signal. In this paper, a content-based video watermarking scheme is developed and the concept of entropy masking effect is employed to significantly improve the use of the HVS model. Entropy masking effect states that the human eye's sensitivity decreases in high entropy regions, i.e. regions with spatial or temporal complexity. The spatial entropy masking effect has been exploited in a number of previous works in order to enhance the robustness of image-adaptive watermarks....