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

Fast compressed domain watermarking of MPEG multiplexed streams

In this paper, a new technique for watermarking of MPEG compressed video streams is proposed. The watermarking scheme operates directly in the domain of MPEG multiplexed streams. Perceptual models are used during the embedding process in order to preserve the quality of the video. The watermark is embedded in the compressed domain and is detected without the use of the original video sequence. Experimental evaluation demonstrates that the proposed scheme is able to withstand a variety of attacks. The resulting watermarking system is very fast and reliable, and is suitable for copyright protection and real-time content authentication applications

Hardware Implementations of Video Watermarking

Various digital watermarking (WM) techniques for still imaging have been studied in the last several years. Recently, many new WM schemes have been proposed for other types of digital multimedia data, such as text, audio and video. This paper presents a brief overview of existing digital video WM. We classify WM techniques and discuss the properties of video WM. Since each WM application has its own specific requirements, WM design must take the intended application into consideration. Video WM applications are also discussed in the paper. The features of video WM implementations in software and hardware and their differences are presented through the description of four examples of existing work

Wavelet İle Dayanıklı Mpeg Video Damgalama

DergiPark: 245960trakyafbdYarı kör resim damgalama metodu PRN sayılarını DWT HH bant katsayılarından T1 basamağından büyük olanlarına damgalar. Saldırıya uğramış resim katsayıları başlangıç resim ile korelasyon yapılır. Damgayı bulmak için, basamak T2’den (T2 gt; T1 ) büyük olan katsayılar başlangıç resmi ile korelasyon edilir. Bu fikir LL ve HH bantlarına damgalama olarak geliştirilmiştir. Bu makalede ise bu daha önce geliştirdiğimiz bu fikri MPEG videoları için kullandık. Deney sonuçlarımız gösteriyorki bazı saldırılar için LL bantında damgalama, diğer bir grup saldırıda ise HH bantında damgalama daha iyi sonuç vermektedir.A semi-blind image watermarking scheme embeds a pseudo random sequence in all the high pass DWT coefficients above a given threshold T1. The attacked DWT coefficients are then correlated with the original watermark. For watermark detection, all the coefficients higher than another threshold T2 ( gt;T1) are chosen for correlation with the original watermark. This idea was extended to embed the same watermark in two bands (LL and HH). In this paper, we embed a pseudo random sequence in MPEG-1 using two bands (LL and HH). Our experiments show that for one group of attacks (i.e., JPEG compression, Gaussian noise, resizing, low pass filtering, rotation, and frame dropping), the correlation with the real watermark is higher than the threshold in the LL band, and for another group of attacks (i.e., cropping, histogram equalization, contrast adjustment, and gamma correction), the correlation with the real watermark is higher than the threshold in the HH band

Cognitive computation of compressed sensing for watermark signal measurement

As an important tool for protecting multimedia contents, scrambling and randomizing of original messages is used in generating digital watermark for satisfying security requirements. Based on the neural perception of high-dimensional data, compressed sensing (CS) is proposed as a new technique in watermarking for improved security and reduced computational complexity. In our proposed methodology, watermark signal is extracted from the CS of the Hadamard measurement matrix. Through construction of the scrambled block Hadamard matrix utilizing a cryptographic key, encrypting the watermark signal in CS domain is achieved without any additional computation required. The extensive experiments have shown that the neural inspired CS mechanism can generate watermark signal of higher security, yet it still maintains a better trade-off between transparency and robustness

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