Introducing a New Method for Estimation Image Complexity According To Calculate Watermark Capacity (original) (raw)

Estimating Watermarking Capacity in Gray Scale Images Based on Image Complexity

EURASIP Journal on Advances in Signal Processing, 2010

Capacity is one of the most important parameters in image watermarking. Different works have been done on this subject with different assumptions on image and communication channel. However, there is not a global agreement to estimate watermarking capacity. In this paper, we suggest a method to find the capacity of images based on their complexities. We propose a new method to estimate image complexity based on the concept of Region Of Interest (ROI). Our experiments on 2000 images showed that the proposed measure has the best adoption with watermarking capacity in comparison with other complexity measures. In addition, we propose a new method to calculate capacity using proposed image complexity measure. Our proposed capacity estimation method shows better robustness and image quality in comparison with recent works in this field.

Achieving Higher Stability in Watermarking According to Image Complexity

One of the main objectives of all watermarking algorithms is to provide a secure method for detecting all o r part of the watermark pattern in case of the usual attacks on a watermarked image. In this paper, a method is introduced that is suitable for any spatial domain watermarking algorithm, so that it can provide a measure for the level of robustness when a given watermark is supposed to be embedded in a known host image. In order to increase the robustness of the watermarked image, for a watermark of M bits, it was embedded N = s M times, where s is a small integer. Doing this, the entire image is divided into 16 equal size blocks. For each block, the complexity of the sub-image in that block is measured. The amount of repetition of the watermark bits saved in each block is determined, according to the complexity level of that block. The complexity of a sub-image is measured using its quad tree representation. This approach not only secures the watermarked image with respect to ...

Hierarchical watermarking framework based on analysis of local complexity variations

Multimedia Tools and Applications

Increasing production and exchange of multimedia content has increased the need for better protection of copyright by means of watermarking. Different methods have been proposed to satisfy the tradeoff between imperceptibility and robustness as two important characteristics in watermarking while maintaining proper data-embedding capacity. Many watermarking methods use image independent set of parameters. Different images possess different potentials for robust and transparent hosting of watermark data. To overcome this deficiency, in this paper we have proposed a new hierarchical adaptive watermarking framework. At the higher level of hierarchy, complexity of an image is ranked in comparison with complexities of images of a dataset. For a typical dataset of images, the statistical distribution of block complexities is found. At the lower level of the hierarchy, for a single cover image that is to be watermarked, complexities of blocks can be found. Local complexity variation (LCV) among a block and its neighbors is used to adaptively control the watermark strength factor of each block. Such local complexity analysis creates an adaptive embedding scheme, which results in higher transparency by reducing blockiness effects. This two level hierarchy has enabled our method to take advantage of all image blocks to elevate the embedding capacity while preserving imperceptibility. For testing the effectiveness of the proposed framework, contourlet transform (CT) in conjunction with discrete cosine transform (DCT) is used to embed pseudorandom binary sequences as watermark. Experimental results show that the proposed framework elevates the performance the watermarking routine in terms of both robustness and transparency.

IMAGE AND VIDEO QUALITY ESTIMATION BASED ON TREE STRUCTURE WATERMARKING USING KD-TREE COMPLEXITY ANALYSIS

Quality estimation of image and video is very important. There are various quality estimation techniques including full reference, reduced reference and no reference quality metrics. In these quality metrics reduce reference and no reference quality metrics are more practical than full reference quality metrics. In this paper quality estimation based on tree structure watermarking using k-d tree complexity analysis is used. The proposed method uses embedded watermark to estimate the quality of cover video and image under distortions. The watermarking is done on the dwt domain of the cover image and video. The dwt coefficients are categorized in to hierarchical tree and the watermarking is done on the selected bit planes. Complexity analysis used to find out how much details an image and video contains for that kd-tree based complexity analysis is used. The quality is estimated under different distortion strength in terms of PSNR and QOI.

Introducing Capacity Surface to Estimate Watermarking Capacity

2015

One of the most important parameters in evaluating a watermarking algorithm is its capacity. Generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. But this measure does not show what the side effects would be on image quality, watermark robustness and capacity. In this paper we propose a three dimensional measure named Capacity surface which shows the effects of capacity on visual quality and robustness. By this measure we can objectively find the amount of degradation and robustness for different capacities. Our experimental results are compatible with the previous related works in this field (about 20% tolerance) while provide more flexibility for capacity estimation in different conditions.

The effect of quality scalable image compression on robust watermarking

Digital Signal Processing, 2009 …, 2009

The effect of quantization based compression in quality scalable image coding on the robustness of wavelet based watermarking is presented. The non-blind direct modification type watermarking is considered for the analysis presented in this paper. First we present the analysis considering any quantization parameter and then restrict it to the integer powers of two to model the bit-plane discarding based quantization used in quality scalable coding, such as JPEG2000. This work assumes that the watermark embedding and compression uses the same wavelet filters. The derived model shows the relationship between the modified coefficients and the quantization factor, which is then used to obtain the conditions for the correct watermark extraction under compression. Based on this analysis, one can select wavelet coefficients for embedding the watermark in a manner that the correct watermark extraction is possible for a given quantization level. The results show higher robustness when this model is used for embedding the watermark. The paper also evaluates the performance of the model when the watermark embedding and the compression wavelet filters are not the same.

C10. D. Bhowmik and C. Abhayaratne, The Effect of Quality Scalable Image Compression on Robust Watermarking, in Proc. Digital Signal Processing (DSP 2009), 5-7 July 2009, Santorini, Greece, pp. 1-8.

The effect of quantization based compression in quality scalable image coding on the robustness of wavelet based watermarking is presented. The non-blind direct modification type watermarking is considered for the analysis presented in this paper. First we present the analysis considering any quantization parameter and then restrict it to the integer powers of two to model the bit-plane discarding based quantization used in quality scalable coding, such as JPEG2000. This work assumes that the watermark embedding and compression uses the same wavelet filters. The derived model shows the relationship between the modified coefficients and the quantization factor, which is then used to obtain the conditions for the correct watermark extraction under compression. Based on this analysis, one can select wavelet coefficients for embedding the watermark in a manner that the correct watermark extraction is possible for a given quantization level. The results show higher robustness when this model is used for embedding the watermark. The paper also evaluates the performance of the model when the watermark embedding and the compression wavelet filters are not the same.

Effect of Block Sizes on the Attributes of Watermarking Digital Images

2010

This work examines the effect of block sizes on attributes (robustness, capacity, time of water- marking, visibility and distortion ) of watermarked digital images using Discrete Cosine Transform (DCT) function. The DCT function breaks up the image into various frequency bands and allows watermark data to be easily embedded. The advantage of this transformation is the ability to pack input image data into a few coefficients. The block size 8 x 8 is commonly used in watermarking. The work investigates the ef- fect of using block sizes below and above 8 x 8 on the attributes of watermark. The attributes of robustness and capacity increase as the block size increases (62-70db, 31.5-35.9 bit /pixel). The time for watermarking reduces as the block size increases. The watermark is still visible for block sizes below 8 x 8 but invisible for those above it. Distortion decreases sharply from a high value at 2 x 2 block size to minimum at 8 x 8 and gradually increases with block size. The ove...

A Review on Image Watermarking Techniques and Performance Measures

With popularity and ease access of the internet, the multimedia data such as images, audios and videos are easily created, copied and transmitted in every fraction of second by people. This imposes an important matter of protection, authentication and illegal redistribution of digital media. A technique known as digital watermarking is used against all such misuse of data. Digital image watermarking technique is the process of embedding secret information in digital media. A watermark is secret information which is embedded in digital media that can be detected and extracted by the authentic user only thereby providing the copyright protection and ownership to digital media. This paper reviews different aspects and techniques of digital image watermarking.

IJERT-Analysis of Watermarking in Digital Images by using Compression Technique

International Journal of Engineering Research and Technology (IJERT), 2016

https://www.ijert.org/analysis-of-watermarking-in-digital-images-by-using-compression-technique https://www.ijert.org/research/analysis-of-watermarking-in-digital-images-by-using-compression-technique-IJERTV4IS120598.pdf With increasing use of internet the security of the data is the main concern. To secure data from the unauthorized access many techniques are used. Watermarking is one of such technique that is used for providing the security of the data. Digital watermarking is process of insertion of the watermark signal in the host signal. The digital watermarking system should be unappreciable, reliable and stable, etc. Earlier many watermarking techniques like DCT, DWT, and SVD were proposed for designing an efficient watermarking system. it is was observed that the most of the work is done in embedding the watermark in the image but the security of watermark before it is embedded in the image is not considered anywhere. So in this a new method of image watermarking in which the security of the watermark is considered is proposed. The data compression techniques have been used to compress the watermark. Compressing the data will reduce the length and increases the security of the system. In addition to this a key exchange algorithm is also used that will provide additional security to the data.