Sharif Digital Repository

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... 

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... 

Some of the most important classes of watermark detection methods in image watermarking are correlation-based algorithms. In these methods usually a pseudorandom noise pattern is embedded in the host image. The receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, it means that the watermark exists and vice versa. Here, we show the advantage of using the Julian set patterns as a watermark, instead of the commonly used pseudorandom noise pattern. Julian set patterns can be regenerated in receiver with few... 

Determining the capacity of watermark for images is a complex task. This capacity may be influenced by many factors such as the content of image and also the strength of watermark. In some recent works the image content has been considered for calculation of watermark capacity. One such approach is to use the Noise Visibility Function (NVF) introduced in [3]. In this paper we introduced a new method for finding NVF according to the quad tree representation of image instead of using pixel neighborhood data. Our experimental results showed that the depth of a pixel in image quad tree represents much information about the pixel and its maximum allowable distortion compared to pixel neighborhood... 

Some of the most important classes of watermark detection methods in image watermarking are correlation based algorithms. In these methods usually a pseudorandom pattern is embedded in host image. Receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, this means that the watermark exists and vise versa. In this paper we showed the advantage of using the Julian set patterns as a watermark, instead of commonly used pseudorandom noisy pattern. Julian set patterns can be regenerate in receiver with few... 

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  

In this paper, a novel service that uses audio watermarking for covert communication through telephone system is presented. This system is suitable for ISDN and PSIN networks and it can be modified for using in mobile systems. We use a Direct sequence spread spectrum algorithem with perceptual modeling of HAS for embedding watermark into the audio or speed signals. The watermark is robust against telephone channel attacks such as AWGN , Low pass filtering, D/A-A/D conversion, Downsampling down to 64 slips and A-Law or μ-Law conversion. This system is also robust against audio format conversion such as wave (windows PCM) format to mp3 (down o 64 kbps compression. © 2006 IEEE  

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... 

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... 

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... 

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, a discrete cosine transform (DCT) based blind watermarking scheme based on spread spectrum communications is proposed. We perform block-based DCT (BDCT) on the host image; then using the DC coefficients of each block, we construct a low-resolution approximation image. We apply BDCT on this approximation image, then watermark is embedded by adding a pseudo random noise sequence into its high frequencies. In detection stage, we extract the approximation image from the watermarked image, then the same pseudo random noise sequence is generated, and its correlation is computed with high frequencies of the watermarked approximation image. In our method, higher robustness is obtained... 

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... 

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... 

In this paper we present a blind low frequency watermarking scheme on gray level images, which is based on DCT transform and spread spectrum communications technique. We compute the DCT of non overlapping 8x8 blocks of the host image, then using the DC coefficients of each block we construct a low-resolution approximation image. We apply block based DCT on this approximation image, then a pseudo random noise sequence is added into its high frequencies. For detection, we extract the approximation image from the watermarked image, then the same pseudo random noise sequence is generated, and its correlation is computed with high frequencies of the watermarked approximation image. In our method,... 

In this paper, a DCT-based blind watermarking scheme based on spread spectrum communications is proposed. We perform block-based DCT on the host image; then using the DC coefficients of each block, we construct a low-resolution approximation image. We apply block-based DCT on this approximation image, then watermark is embedded by adding a pseudo random noise sequence into its high frequencies. In detection stage, we extract the approximation image from the watermarked image, then the same pseudo random noise sequence is generated, and its correlation is computed with high frequencies of the watermarked approximation image. In our method, higher robustness is obtained because of embedding... 

One of the main properties of fragile watermarking schemes is to indicate the location of changes made to the image, i.e. tamper localization, In addition to detection of watermarked image modifications. In this paper, the localization property Is added to the SVD(Singular Value Decomposition) based fragile watermarking scheme proposed by Byun et al. To do this, a hierarchical watermarking structure is used, where the Image is partitioned into blocks In a multilevel hierarchy, and then the SVD-based algorithm Is employed at each level to Insert authenticating data In sub-blocks. In the verification process, blocks at the lowest hierarchical level can detect modifications made to the... 

Watermarking is the process of hiding information in a media and usually used to for copyright protection. In software watermarking, the information is added to the source code of program and can be extracted from compiled executable code. In this paper, a new software watermarking algorithm is proposed by equation reordering. In this method, the order of operands in an equation is changed according to the information we want to hide in a way that the result of the equation is unchanged. One of the main advantages of this method is that no code added to the program, so the size and speed of the program not changed  

The hidden, real-time sending and display of information, esp. in public places, has since long received attention and faced many challenges. Therefore, different methods have been proposed so far for hiding information in different cover media. In this paper I propose a new method for the real-time hiding of information without need to any storage cover media. This method is based on the real-time hiding of information in output screens of the instrument (such as screens shown by the monitor). This method of steganography is very similar to the two discussions of image steganography and video steganography. The idea suggested in this paper was simulated on a PC computer by using the Pascal...