2D+t Wavelet Domain Video Watermarking

IEEE Trans. on Image Process.

2016

Self Cite

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.

Section: B Scalable Watermarking For Videomentioning

confidence: 99%

Quality Scalability Aware Watermarking for Visual Content

IEEE Trans. on Image Process.

2016

Self Cite

“…Video coding research provides evidence that differing texture and motion characteristics occur after wavelet decomposition from the t þ 2-D domain 40 and incorporating its alternative technique, the 2-D þ t transform. 41,42 The t þ 2-D domain decomposition compacts most of the transform coefficient energy within the low frequency temporal subband and provides efficient compression within the temporal high frequency subbands. Vast quantities of the high frequency coefficients have zero magnitude, or very close, which is unnecessary for the transforms' usefulness within this framework.…”

Section: -D + T Wavelet Domainmentioning

confidence: 99%

“…A description of reduced computational complexity by using 2-D þ t compared to t þ 2-D can be found in Ref. 42. Therefore, in this work we have used a 2-D þ t decomposition as shown in Fig.…”

Section: -D + T Wavelet Domainmentioning

confidence: 99%

Global motion compensated visual attention-based video watermarking

Oakes

2016

J. Electron. Imaging

Self Cite

Abstract. Imperceptibility and robustness are two key but complementary requirements of any watermarking algorithm. Low-strength watermarking yields high imperceptibility but exhibits poor robustness. High-strength watermarking schemes achieve good robustness but often suffer from embedding distortions resulting in poor visual quality in host media. This paper proposes a unique video watermarking algorithm that offers a fine balance between imperceptibility and robustness using motion compensated wavelet-based visual attention model (VAM). The proposed VAM includes spatial cues for visual saliency as well as temporal cues. The spatial modeling uses the spatial wavelet coefficients while the temporal modeling accounts for both local and global motion to arrive at the spatiotemporal VAM for video. The model is then used to develop a video watermarking algorithm, where a two-level watermarking weighting parameter map is generated from the VAM saliency maps using the saliency model and data are embedded into the host image according to the visual attentiveness of each region. By avoiding higher strength watermarking in the visually attentive region, the resulting watermarked video achieves high perceived visual quality while preserving high robustness. The proposed VAM outperforms the state-of-the-art video visual attention methods in joint saliency detection and low computational complexity performance. For the same embedding distortion, the proposed visual attention-based watermarking achieves up to 39% (nonblind) and 22% (blind) improvement in robustness against H.264/AVC compression, compared to existing watermarking methodology that does not use the VAM. The proposed visual attention-based video watermarking results in visual quality similar to that of low-strength watermarking and a robustness similar to those of high-strength watermarking.

“…With the introduction of lifting-based wavelet design, lifting-based integer-to-integer Haar transform [8,21] and lifting-based non-linear wavelets [22] have been used in watermarking algorithms. A more comprehensive study on the use of various wavelet kernels in watermarking algorithms can be found at [33,36,37].…”

Section: Wavelet Kernelmentioning

confidence: 99%

“…Often the algorithms claim improvements compared to the previously proposed ones but offer very little information on the reason behind it. Literature suggest that often wavelet kernels [24,33] or a hosting coefficient selection method [6,7,17,22] may play a key role in watermarking performance while it is very difficult to understand whether the improvements are influenced by any other parametric choices or not. For example, while it is general convention that high-frequency sub-band based watermarking offer high imperceptibility and less robustness to compression.…”

Section: Introductionmentioning

confidence: 99%

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

2013

Multimedia Systems

Self Cite

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