F. Hartung and B. Girod. Digital watermarking of uncompressed and compressed video. Signal Processing(Special Issue on Watermarking), 66:283-302, May 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... key is available to the decoder and investigate two extreme but important special cases in some depth: in the first case, the host data themselves are available to the decoder [11] and in the second case, which we term blind information hiding 1 , no side information at all is available [21, 22]. The theory is illustrated using an example based on a Bernoulli process and a Hamming distortion function. In Sec. 4, we extend these results to the case of infinite alphabets. This allows us to treat the case of squared error distortion in Euclidean spaces, which provides considerable insight ....

....data are available at the decoder, a common assumption in the watermarking literature [3, 4, 11] In this case, X is part of the key. Other examples of keys include hash functions [26] location of watermarks [27, 28] and seeds for modulating pseudo noise sequences in spread spectrum systems [15, 22]. In blind information hiding applications, the decoder is not allowed access to any secret key, so anyone can decode the message [21, 16] The message M of interest is uniformly distributed over the message set M and is to be reliably transmitted to the decoder. M may be a ....

[Article contains additional citation context not shown here]

F. Hartung and B. Girod, "Digital Watermarking of Uncompressed and Compressed Video," Signal Processing, Vol. 66, pp. 283---301, 1998.

No context found.

F. Hartung and B. Girod. Digital watermarking of uncompressed and compressed video. Signal Processing, Special issue on copyright protection and access control for multimedia services, vol. 66, no. 3, 1998. 16

No context found.

F. Hartung and B. Girod, #Digital watermarking of uncompressed and compressed video," Signal Processing #Special Issue on Watermarking# 66, pp. 283#302, May 1998.

....estimates the FAPs with very satisfying accuracy. For details, please refer to [4, 5] 4 Watermarking of MPEG 4 Facial Animation Parameters For embedding of watermark data into the FAPs, we adopt a spread spectrum approach [6] that has been applied similarly to image and video watermarking before [3, 7, 8]. The idea is to apply small changes to the FAPs that seem random and are not conspicuous but correlate with a secret pseudo random key. The correlation can be exploited to retrieve the embedded information later on. The watermark information to be embedded may be any arbitrary 1D or 2D bit ....

F. Hartung and B. Girod. Digital watermarking of uncompressed and compressed video. Signal Processing, Special issue on copyright protection and access control for multimedia services, 66(3), 1998.

....frame. The described method estimates the FAPs with very satisfying accuracy [15] 4 Watermarking of MPEG 4 Facial Animation Parameters For embedding of watermark data into the FAPs, we adopt a spread spectrum approach [23] that has been applied similarly to image and video watermarking before [5,8,9]. The idea is to apply small changes to the FAPs that seem random and are not conspicuous but correlate with a secret pseudo random key. The correlation can be exploited to retrieve the embedded information later on. The watermark information to be embedded may be any arbitrary 1D or 2D bit ....

F. Hartung and B. Girod. Digital watermarking of uncompressed and compressed video. Signal Processing, Special issue on copyright protection and access control for multimedia services, vol. 66, no. 3, 1998.

....DECODING The basic idea of watermarking for video is the addition of a pseudo random signal to the video that is below the threshold of perception and that cannot be identified and thus removed without knowledge of the parameters of the watermarking algorithm. Our approach to accomplish this [2, 9] is a direct extension of ideas from direct sequence spread spectrum communications [10] 2.1 Embedding of Watermark Let us denote a j ; a j 2 f Gamma1; 1g (1) a sequence of information bits we want to hide in the video stream. We then spread this discrete signal by a large factor cr, called ....

....superposition of watermark and video and thus can aid the correlation step. It should be noted that the approximation in (6) namely the assumption that there is no significant cross talk from the video signal itself to the watermark, holds only for sufficient large cr and appropriate filtering [9]. The retrieval scheme is visualized in Fig. 3. filtering demodulation 1 1 1 1 correlation signal watermarked video frame pseudo noise signal filtered frame Figure 3. Visualization of watermark retrieval. 2.3 Decoding of Watermark Public Version As explained in the introduction, it is not ....

[Article contains additional citation context not shown here]

F. Hartung and B. Girod. Digital watermarking of uncompressed and compressed video. Signal Processing, 1997. Accepted.

No context found.

F. Hartung and B. Girod. Digital watermarking of uncompressed and compressed video. Signal Processing(Special Issue on Watermarking), 66:283-302, May 1998.

No context found.

F. Hartung and B. Girod, "Digital watermarking of uncompressed and compressed video", Signal Processing, 1997. Accepted.

No context found.

F. Hartung and B. Girod, "Digital watermarking of uncompressed and compressed video," Signal Processing (Special Issue on Watermarking) 66, pp. 283--302, May 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC