M. D. Swanson, B. Zhu, and A. H. Tewfik, "Data hiding for video-in-video," Proceedings of the IEEE International Conference on Image Processing, Oct. 26-29, 1997, Santa Barbara, CA, vol. 2, pp. 676-679.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the watermarked wavelet 36 coefficients forms the marked video sequence. An original video frame, marked frame and the corresponding watermark are shown in Figure 16 through Figure 18. 4. 4 Data Hiding Using the perceptual models, a small data stream may be embedded in an image or video [2,79]. The embedded data is a type of watermark, and the larger image or video that contains the data is called the host object. Perceptual models are necessary to maximize the number of bits a host object can contain, without the embedded data becoming visible. A text file, audio clip, or a ....

M. D. Swanson, B. Zhu, and A. H. Tewfik, "Data hiding for video-in-video," Proceedings of the IEEE International Conference on Image Processing, Oct. 26-29, 1997, Santa Barbara, CA, vol. 2, pp. 676-679.

....the information content of the extracted N bits and increases the robustness of the visual hash function. Using a secret ke K (a number uniquely associated with an author, movie distributor, or a digital camera) we generate N random matrices with entries uniformly distributed in the interval [0, 1]. Then, a low pass filter is repeatedly applied to each random matrix to obtain N random smooth patterns Pi, 1 i N. An example of four random patterns and thei smoothened versions are shown in Figure 1. All patterns are then made DC free by subtracting the mean from each pattern. Considering ....

....q tuples of the extracted bits ( q = 5) We start by generating q random permutations r, 2 . rq of integers between 1 and N. The permutations could be fixed for all images and blocks or change with the block. Then for each i, 1 i N, we seed a PRNG (with uniform probability distribution on [ 1,1]) with a seed consisting of a concatenation of the secret ke K, the block number B, the number i, and q bits r(i) 2(i) rq(i) The PRNG then generates a pseudo random sequence (i) of a desired length (determined by the particular watermarking technique) i) PRNG(K B i b(i) b2( ....

M.D. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video in Video", Proc. ICIP '97, vol. II, pp. 676-679, 1997.

....original image. In some watermarking techniques, one must have access at least to a hash of the image (or a hash of the whole video) in order to recreate the watermark sequence at the receiving end in order to be able to correlate the watermark with the watermark extracted from the image itself [2]. Such techniques are not truly oblivious because the hash needs to be exchanged prior to watermark detection. Secure oblivious watermarking of videos fo fingerprinting or authentication requires watermarks that depend on each frame. Indeed, one watermark pattern inserted into each frame would ....

....frame itselfi Obviously, the latter case leads to more versatile schemes. A reliable method for generating a good approximation of the watermark from the image itself (even afte watermarking and attacks) will clearly lead to more useful and elegant oblivious watermarking schemes. Tewfik et al. [2] describe a watermarking technique in which a user defined noise like signature is modulated with a perceptual mask calculated from small blocks using perceptual masking. The same signature is used for all video frames. The watermark pattern in this application is frame dependent and does not ....

M.D. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video in Video", Proc. ICIP '97, vol. 1I, pp. 676 679.

....original image. In some watermarking techniques, one must have access at least to a hash of the image (or a hash of the whole video) in order to recreate the watermark sequence at the receiving end in order to be able to correlate the watermark with the watermark extracted from the image itself [1]. Such techniques are not truly oblivious because the hash needs to be exchanged prior to watermark detection. Secure oblivious watermarking of videos for fingerprinting or data embedding requires watermarks that depend on each frame. Indeed, one watermark pattern inserted into each frame would ....

....frame itself. Obviously, the latter case leads to more versatile schemes. A reliable method for generating a good approximation of the watermark from the image itself (even after watermarking and attacks) will clearly lead to more useful and elegant oblivious watermarking schemes. Tewfik et al. [1] describe a watermarking technique in which a user defined noise like signature is modulated with a perceptual mask calculated from small blocks using frequency masking. The same signature is used for all video frames. The watermark pattern in this application is frame dependent and does not ....

[Article contains additional citation context not shown here]

M. D. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video in Video", Proc. ICIP '97, vol. II, pp. 676--679.

....of a digital audio signal, an enhancement signal used to refine the analog signal, or simply supplemental information such as station 2 identification or tra#c information. More generally, the host signal in these hybrid transmission systems could be some other type of analog signal such as video [7], or even a digital waveform for example, a digital pager signal could be embedded within a digital cellular telephone signal. In general, designers of information embedding systems for these kinds of applications seek to achieve high embedding rates with high levels of robustness and low ....

....rate requirement and maximum acceptable level of embedding distortion, the more e#cient an embedding method is, the higher the robustness that can be achieved. A great many information embedding algorithms have been proposed [1] in this still emerging field. Some of the earliest proposed methods [8, 9, 7] employ a quantize and replace strategy: after first quantizing the host signal, these systems change the quantization value to embed information. A simple example of such a system is so called low bit(s) modulation (LBM) where the least significant bit(s) in the quantization of the host signal ....

[Article contains additional citation context not shown here]

M. D. Swanson, B. Zhu, and A. H. Tewfik, "Data hiding for video-in-video," in Proceedings of the 1997 IEEE International Conference on Image Processing, vol. 2, (Piscataway, NJ), pp. 676--679, 1997.

....by standard image processing operations. Research on digital watermarking can be categorized into two broad classes depending on the data embedding domain. While one is based on embedding data in the spatial domain [1] the other is based on injection in the frequency or transform domain [2,3,4,5,6]. Most of the recent research on watermarking emphasize the transform domain approach. Cox, et. al [2] proposed the spread spectrum coding method for digital watermarking, and used the DCT transform coefficients for data embedding. Their method is very robust to image transformations because ....

....watermarking, and used the DCT transform coefficients for data embedding. Their method is very robust to image transformations because they embedded small amounts of information in widely spread frequency bands. Other researchers too have used the transform domain approach, for example, DCT [2,3,4] or the wavelet transform [5,6] While most of the contemporary research on watermarking concentrates on copyright protection in internet data distribution [7,8] a different kind of watermarking, commonly known as data hiding, is at present receiving considerable attention. Data hiding is ....

[Article contains additional citation context not shown here]

M. D. Swanson, B. Zhu and A. H. Tewfik, "Data Hiding for Video-in-Video," IEEE International Conference of Image Conference, Vol. II, pp. 676-679, Santa Barbara, Oct. 1997.

....discrete cosine or the discrete wavelet transform coefficients to embed the signature data. While much of the initial work was on watermarking image data [3,4,5] recently several methods have been proposed for embedding audio and video information in video sequences. For example, Swanson et al. [6] proposed a data hiding algorithm to embed compressed video and audio data into video. The message data is embedded in the DCT domain, by modifying the projections of the 8x8 host block DCT coefficients. The data hiding rate is two bits per 8x8 block. The authors demonstrate robustness to additive ....

....to the changes in low frequency regions than in highly textured regions. Thus, insertions in the textured regions is less likely to result in visible distortions compared to less textured regions. Selective visual masking can be used to make the embeddings locally adaptive. For example, in [6] the authors use a model for frequency masking. This model predicts the detection threshold at a frequency f given the masking frequency f m and local contrast c m . We suggest an alternative texture masking scheme that determines the amount of signature data to embed for each 8x8 host DC block. ....

M. D. Swanson, B. Zhu and A. H. Tewfik, "Data Hiding for Video-in-Video," Proceedings of IEEE International Conference of Image Processing (ICIP '97), Vol. 2, pp. 676-679, Santa Barbara, California, October, 1997.

....standardization of hardware and software for open transmission of such data, a mechanism for hidden data transmission over the established infrastructure will provide an economical alternative to expensive dedicated secure channels and specialized terminals. The emerging technology of data hiding [1] [4] therefore presents an overwhelming urge in the world today. Digital watermarking [5] 12] is a closely related technology for copyright protection, that is receiving much attention lately. Here a small amount of a specific signature information, called the watermark, is invisibly hidden ....

....This functionality opens up possibilities for numerous other applications besides copyright protection. A previous successful approach to achieving this functionality comprises quantizing the host data elements first and then perturbing them around the quantized values to represent hidden data [1]. The perturbations must be small relative to the quantization step size. While this can be readily combined with the source and channel coding framework described in this paper, and has in fact been used for our implementations, for the sake of completeness, we present an alternative approach ....

[Article contains additional citation context not shown here]

M. D. Swanson, B. Zhu, A. H. Tewfik, "Data hiding for Video-In-Video," Proc. International Conference on Image

....presence even though the watermark survived in most of the blocks. Detailed study of the robustness of this technique with respect to image distortion will be described in a forthcoming paper [7] We are currently studying alternative watermarking schemes, such as the scheme proposed by Swanson [8], and its suitability for tamperproofing. To further test the scheme, we have cropped a rectangular portion of the unwatermarked image (see Figure 3) with feather width 11 and pasted it into the corresponding watermarked image. There was absolutely no visible indication of tampering in the ....

M. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video-in-video", Proc. ICIP '97, vol. II, pp. 676--679, 1997.

....original image. In some watermarking techniques, one must have access at least to a hash of the image (or a hash of the whole video) in order to recreate the watermark sequence at the receiving end in order to be able to correlate the watermark with the watermark extracted from the image itself [1]. Such techniques are not truly oblivious because the hash needs to be exchanged prior to watermark detection. Secure oblivious watermarking of videos for fingerprinting or data embedding requires watermarks that depend on each frame. Indeed, one watermark pattern inserted into each frame would ....

....frame itself. Obviously, the latter case leads to more versatile schemes. A reliable method for generating a good approximation of the watermark from the image itself (even after watermarking and attacks) will clearly lead to more useful and elegant oblivious watermarking schemes. Tewfik et al. [1] describe a watermarking technique in which a user defined noise like signature is modulated with a perceptual mask calculated from small blocks using frequency masking. The same signature is used for all video frames. The watermark pattern in this application is frame dependent and does not ....

[Article contains additional citation context not shown here]

M. D. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video in Video", Proc. ICIP '97, vol. II, pp. 676--679.

....space. We could improve the robustness by adding another low frequency watermark that would not interfere with the spread spectrum watermark. Another possibility would be to watermark directly the JPEG stream instead of the raw image data. We are currently testing other watermarking techniques [9] and their suitability for tamper proofing. Figure 1 Robustness to contrast decrease. Figure 2 Robustness to contrast increase. Figure 3 Robustness to brightness adjustment. Figure 4 Robustness to white Gaussian noise. Figure 5 Robustness to repeated blurring. Figure 6 Robustness to sharpening ....

M. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video-in-video", Proc. ICIP '97, vol. II, pp. 676--679, 1997.

No context found.

M. D. Swanson, B. Zhu, and A. H. Tewfik, "Data hiding for video-in-video," in Proceedings of the 1997 IEEE International Conference on Image Processing, vol. 2, pp. 676--679, (Piscataway, NJ), 1997.

No context found.

M. D. Swanson, B. Zhu, and A. H. Tew#k, #Data hiding for video-in-video," in Proc. of the 1997 IEEE International Conference on Image Processing,vol. 2, pp. 676#679, #Piscataway, NJ#, 1997.

No context found.

M. Swanson, B. Zhu, and A. H. Tewfik, "Data Hiding for Video in Video", Proc. ICIP '97, vol. II, pp. 676--679.

No context found.

M. Swanson, B. Zhu, and A. H. Tewfik, "Data hiding for video in video", Proc. ICIP '97, vol. II, pp. 676--679, 1997.

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