Watermarking Capacity Control for Dynamic Payload Embedding (original) (raw)

CAPACITY ANALYSIS OF PERIODICAL WATERMARKING

Periodical watermark embedding has been especially proposed to cope with geometrical attacks. Using a diversity approach, this method allows to decrease the probability of error in the case of additive attacks. It is usually admitted that the worst additive attack consists in the addition of additive white Gaussian noise (AWGN). However, our theoretical capacity analysis of periodical watermarking demonstrates that periodical AWGN in the optimal attacking strategy leads to more significant drop of the capacity than AWGN test channel from rate distortion.

Improved embedding efficiency and AWGN robustness for SS watermarks via pre-coding

2008

Spread spectrum (SS) modulation is utilized in many watermarking applications because it offers exceptional robustness against several attacks. The embedding rate-distortion performance of SS embedding however, is relatively weak compared to quantization index modulation (QIM). This limits the relative embedding rate of SS watermarks. In this paper, we illustrate that both the embedding efficiency, i.e. bits embedded per unit distortion and robustness against additive white gaussian noise (AWGN) can be improved by pre-coding of message followed by constellation adjustment on the SS detector to minimize the distortion on the cover image introduced by coded data. Our pre-coding method encodes p bits as a 2 p × 1 binary vector with a single nonzero entry whose index indicates the value of the embedded bits. Our analysis show that the method improves embedding rate by approximately p/4 without increasing embedding distortion or sacrificing robustness to AWGN attacks. Experimental evaluation of the method using a set theoretic embedding framework for the watermark insertion validates our analysis.

Embedding capacity estimation of reversible watermarking schemes

Sadhana, 2014

Estimation of the embedding capacity is an important problem specifically in reversible multi-pass watermarking and is required for analysis before any image can be watermarked. In this paper, we propose an efficient method for estimating the embedding capacity of a given cover image under multi-pass embedding, without actually embedding the watermark. We demonstrate this for a class of reversible watermarking schemes which operate on a disjoint group of pixels, specifically for pixel pairs. The proposed algorithm iteratively updates the co-occurrence matrix at every stage to estimate the multi-pass embedding capacity, and is much more efficient visa -vis actual watermarking. We also suggest an extremely efficient, pre-computable tree based implementation which is conceptually similar to the cooccurrence based method, but provides the estimates in a single iteration, requiring a complexity akin to that of single pass capacity estimation. We also provide upper bounds on the embedding capacity. We finally evaluate performance of our algorithms on recent watermarking algorithms.

Improved embedding efficiency and AWGN robustness for SS watermarks via pre-coding [6819-51]

2008

A high capacity reversible watermarking scheme

Proceedings of SPIE, 2009

Many reversible watermarking solutions have been proposed since 1996: spread-spectrum approaches, circular interpretation on histogram approaches, lossless compression approaches, expansion approaches and histogram approaches. In this paper, we propose a solution whose embedding capacity goes beyond all those reversible schemes. For certain images, the reach payload of the proposed method is over 2 bpp. This solution is an improvement of the Coltuc reversible watermarking approach published in ICIP'2007.

Provably robust digital watermarking

SPIE Proceedings, 1999

Copyright notification and enforcement, authentication, covert communication, and hybrid transmission are examples of emerging multimedia applications for digital watermarking methods, methods for embedding one signal (e.g., the digital watermark) within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient trade-offs among the three conflicting goals of maximizing information-embedding rate, minimizing distortion between the host signal and composite signal, and maximizing the robustness of the embedding. Quantization index modulation (QIM) methods are a class of watermarking methods that achieve provably good rate-distortion-robustness performance. Indeed, QIM methods exist that achieve performance within a few dB of capacity in the case of a (possibly colored) Gaussian host signal and an additive (possibly colored) Gaussian noise channel. Also, QIM methods can achieve capacity with a type of postprocessing called distortion compensation. This capacity is independent of host signal statistics, and thus, contrary to popular belief, the information-embedding capacity when the host signal is not available at the decoder is the same as the case when the host signal is available at the decoder. A low-complexity realization of QIM called dither modulation has previously been proven to be better than both linear methods of spread spectrum and nonlinear methods of low-bit(s) modulation against square-error distortionconstrained intentional attacks. We introduce a new form of dither modulation called spread-transform dither modulation that retains these favorable performance characteristics while achieving better performance against other attacks such as JPEG compression.

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.

Fixed size encoding scheme for software watermarking

2011 7th International Conference on Information Assurance and Security (IAS), 2011

Software piracy has become a major threat to software developer. One of the techniques that can be used to watermark into software which can later be extracted to prove ownership. During the last few years, different algorithms were developed to embed watermark inside the software. One of the algorithms is dummy method insertion technique whereby a dummy method that embeds watermark is inserted in software application. However, the disadvantage of this algorithm is that the watermark is embedded in a particular instruction in the dummy method. Due to that the length of the instruction is dependent on the length of the watermark. Thus, this situation put dummy method in suspicions and become noticeable to the pirates. In this paper, we present an encoding scheme that could produce fixed size encoded watermark and thus making the encoded watermark in the dummy method less noticeable. The proposed encoding scheme uses a hash function so that encoded watermark is always fixed even though the size of watermark character varies. As a result, our encoding scheme produced fixed size dummy method and could make the dummy method less noticeable to the pirates.

OVERLAPPED WATERMARKING FOR SECURED DATA TRANSMISSION.

A high efficiency multi-layer halftoning based watermarking which adopts noise-balanced error diffusion to achieve high embedding capacity and improve security aspect. The encoder employs an Efficient Direct Binary Search (EDBS) and Look-Up-Table (LUT) method to embed multiple watermarks. The decoder simply utilizes the Least-Mean-Square (LMS) and naive Bayes classi?er to extract the embedded watermarks in multi-layer framework with self-decoding capability. The proposed watermarking preprocesses the watermark to reduce its bit depth. The 8-bit grayscale image (with 256 levels) is converted into a new image representation (with a lower bit depth) using the uniform scalar quantization with ?xed divisor. The distance metric can be considered in determining the quantization. Experimental results suggest that only minimum milliseconds are required for embedding multiple watermarks.

Rotation Based Acceleration of Informed Embedding in DPTC Watermarking Scheme

2012

The Dirty Paper Trellis Code (DPTC) watermarking scheme [1] is a very efﬁcient high rate scheme. It has however a major drawback: its computational complexity. This problem is addressed by using a faster embedding technique. The embedding space is built by projecting some wavelet coefﬁcients onto secret carriers. The fast embedding is achieved with a dichotomous rotation in the Cox, Miller, and Bloom plane. Besides, a modern watermarking scheme should manage the psychovisual impact due to the watermarking signal. This is addressed by using a psychovisual mask. Our low complexity watermarking scheme is compared to two other psychovisual low complexity approaches and results show a good behavior in terms of robustness. The obtained results give a very clear vision, in realistic conditions of use, of the current state-of-the-art for high-rate watermarking schemes of low complexity.

Watermarking Capacity Control for Dynamic Payload Embedding (original) (raw)

Related papers