Watermarking of uncompressed and compressed video
Signal Processing
Video Watermarking and Benchmarking
Proceedings of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies
Real-time steganography in compressed video
MRCS'06 Proceedings of the 2006 international conference on Multimedia Content Representation, Classification and Security
| Hi-index | 0.00 |
In this work we propose a new algorithm for fragile, high capacity yet file-size preserving watermarking of MPEG-2 streams. Watermarking is done entirely in the compressed domain, with no need for full or even partial decompression. The algorithm is based on a previously developed concept of VLC mapping for compressed domain watermarking. The entropy-coded segment of the video is first parsed out and then analyzed in pairs. It is recognized that there are VLC pairs that never appear together in any intra-coded block. The list of unused pairs is systematically generated by the intersection of "pair trees." One of the trees is generated from the main VLC table given in ISO/IEC 13818-2:2000 standard. The other trees are dynamically generated for each intra coded blocks. Forcing one VLC pairs in a block to one of the unused ones generates a watermark block. The change is done while maintaining run/level change to a minimum. At the decoder, the main pair tree is created offline using publicly available VLC tables. Through a secure key exchange, the indices to unused code pairs are communicated to the receiver. We show that the watermarked video is reasonably resistant to forgery attacks and remains secure to watermark detection attempts.