Watermarking of MPEG-2 video in compressed domain using VLC mapping

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 variable length code (VLC). 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/IEC13818-2:1995 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 watermarked 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 avail...

• Type: Conference
• Year: 2005
• Where: MMSEC
• Authors: Bijan G. Mobasseri, Michael P. Marcinak
• Keywords: MMSEC 2005, Variable Length Code, VLC Pairs, Vlc Tables