Fast watermarking of MPEG-1/2 streams using compressed-domain perceptual embedding and a generalized correlator detector

A novel technique is proposed for watermarking of MPEG-1 and MPEG-2 compressed video streams. The proposed scheme is applied directly in the domain of MPEG-1 system streams and MPEG-2 program streams (multiplexed streams). Perceptual models are used during the embedding process in order to avoid degradation of the video quality. The watermark is detected without the use of the original video sequence. A modified correlation-based detector is introduced that applies nonlinear preprocessing before correlation. Experimental evaluation demonstrates that the proposed scheme is able to withstand several common attacks. The resulting watermarking system is very fast and therefore suitable for copyright protection of compressed video

Non Oblivious Watermarking Technique for JPEG2000 Compressed Images Using Arnold Scrambling of Unequal Size Watermark Blocks

In this paper, a watermarking technique for JPEG2000 compressed image is proposed. Scrambling of secret message is performed block-wise using Arnold Transform. Secret message is divided into non-overlapping blocks of unequal size and then Arnold transform is applied on each block and secret key is generated based on the periodicity of each block. Scrambled secret message is embedded into qualified significant wavelet coefficients of a cover image. After embedding the secret message into wavelet coefficients, the remaining processes of JPEG2000 standard are executed to compress the watermarked image at different compression rates. Scaling Factor (SF) is used to embed watermark into wavelet coefficients and the value of SF is stored into COM box of the code stream of JPEG2000 compressed image and this SF value and secret key are used to extract the embedded watermark on the receiver side. The performance of the proposed technique is robust to a variety of attacks like image cropping, salt and pepper noise, and rotation. Proposed technique is compared with the existing watermarking techniques for JPEG2000 compressed images to show its effectiveness

Quantization Watermarking for Joint Compression and Data Hiding Schemes

International audienceEnrichment and protection of JPEG2000 images is an important issue. Data hiding techniques are a good solution to solve these problems. In this context, we can consider the joint approach to introduce data hiding technique into JPEG2000 coding pipeline. Data hiding consists of imperceptibly altering multimedia content, to convey some information. This process is done in such a way that the hidden data is not perceptible to an observer. Digital watermarking is one type of data hiding. In addition to the imperceptibility and payload constraints, the watermark should be robust against a variety of manipulations or attacks. We focus on trellis coded quantization (TCQ) data hiding techniques and propose two JPEG2000 compression and data hiding schemes. The properties of TCQ quantization, defined in JPEG2000 part 2, are used to perform quantization and information embedding during the same time. The first scheme is designed for content description and management applications with the objective of achieving high payloads. The compression rate/imperceptibility/payload trade off is our main concern. The second joint scheme has been developed for robust watermarking and can have consequently many applications. We achieve the better imperceptibility/robustness trade off in the context of JPEG2000 compression. We provide some experimental results on the implementation of these two schemes

On robustness against JPEG2000: a performance evaluation of wavelet-based watermarking techniques

With the emergence of new scalable coding standards, such as JPEG2000, multimedia is stored as scalable coded bit streams that may be adapted to cater network, device and usage preferences in multimedia usage chains providing universal multimedia access. These adaptations include quality, resolution, frame rate and region of interest scalability and achieved by discarding least significant parts of the bit stream according to the scalability criteria. Such content adaptations may also affect the content protection data, such as watermarks, hidden in the original content. Many wavelet-based robust watermarking techniques robust to such JPEG2000 compression attacks are proposed in the literature. In this paper, we have categorized and evaluated the robustness of such wavelet-based image watermarking techniques against JPEG2000 compression, in terms of algorithmic choices, wavelet kernel selection, subband selection, or watermark selection using a new modular framework. As most of the algorithms use a different set of parametric combination, this analysis is particularly useful to understand the effect of various parameters on the robustness under a common platform and helpful to design any such new algorithm. The analysis also considers the imperceptibility performance of the watermark embedding, as robustness and imperceptibility are two main watermarking properties, complementary to each other

Quality scalability aware watermarking for visual content

Scalable coding-based content adaptation poses serious challenges to traditional watermarking algorithms, which do not consider the scalable coding structure and hence cannot guarantee correct watermark extraction in media consumption chain. In this paper, we propose a novel concept of scalable blind watermarking that ensures more robust watermark extraction at various compression ratios while not effecting the visual quality of host media. The proposed algorithm generates scalable and robust watermarked image code-stream that allows the user to constrain embedding distortion for target content adaptations. The watermarked image code-stream consists of hierarchically nested joint distortion-robustness coding atoms. The code-stream is generated by proposing a new wavelet domain blind watermarking algorithm guided by a quantization based binary tree. The code-stream can be truncated at any distortion-robustness atom to generate the watermarked image with the desired distortion-robustness requirements. A blind extractor is capable of extracting watermark data from the watermarked images. The algorithm is further extended to incorporate a bit-plane discarding-based quantization model used in scalable coding-based content adaptation, e.g., JPEG2000. This improves the robustness against quality scalability of JPEG2000 compression. The simulation results verify the feasibility of the proposed concept, its applications, and its improved robustness against quality scalable content adaptation. Our proposed algorithm also outperforms existing methods showing 35% improvement. In terms of robustness to quality scalable video content adaptation using Motion JPEG2000 and wavelet-based scalable video coding, the proposed method shows major improvement for video watermarking

Digital Image Watermarking for Arbitrarily Shaped Objects Based On SA-DWT

Many image watermarking schemes have been proposed in recent years, but they usually involve embedding a watermark to the entire image without considering only a particular object in the image, which the image owner may be interested in. This paper proposes a watermarking scheme that can embed a watermark to an arbitrarily shaped object in an image. Before embedding, the image owner specifies an object of arbitrary shape that is of a concern to him. Then the object is transformed into the wavelet domain using in place lifting shape adaptive DWT(SADWT) and a watermark is embedded by modifying the wavelet coefficients. In order to make the watermark robust and transparent, the watermark is embedded in the average of wavelet blocks using the visual model based on the human visual system. Wavelet coefficients n least significant bits (LSBs) are adjusted in concert with the average. Simulation results shows that the proposed watermarking scheme is perceptually invisible and robust against many attacks such as lossy compression (e.g.JPEG, JPEG2000), scaling, adding noise, filtering, etc.Comment: International Journal of Computer Science Issues, Volume 5, pp1-8, October 200