A Robust Blind Image Watermarking Scheme in the SPIHT-Compressed Bit-Stream

Practical digital multimedia is usually encountered in compressed format, and as such it is highly desirable to develop watermarking algorithms that operate totally in the compressed domain. In addition, watermarking schemes working jointly with SNR-scalable compression algorithms would be of great interest since the watermarks could be entirely retrieved at a given bit-rate. In this context, this paper proposes a robust blind image watermarking scheme operating in the SPIHT-compressed bit-stream. First, the watermark, which is a binary sequence, is encoded with an error-correction coding and interleaved to minimize the error decoding probability and combat bursts of errors. Then, in the course of SPIHT encoding process, the list of significant pixels (LSP) is used to embed the watermark sequence in a uniform quantisation manner at a given threshold where the coefficients of interest are differently refined in the next passes. Experimental results, carried out on various images, have shown the robustness of the watermark in the presence of different attacks.

[1]  N. Ansari,et al.  Interleaving for combating bursts of errors , 2004, IEEE Circuits and Systems Magazine.

[2]  En-Hui Yang,et al.  Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks , 2005, IEEE Transactions on Signal Processing.

[3]  Shih-Hsuan Yang,et al.  A digital watermarking scheme based on SPIHT coding , 2001, IEEE International Conference on Multimedia and Expo, 2001. ICME 2001..

[4]  Bijan G. Mobasseri,et al.  A foundation for watermarking in compressed domain , 2005, IEEE Signal Processing Letters.

[5]  Shih-Hsuan Yang,et al.  Bit-plane watermarking for zerotree-coded images , 2002, Asia-Pacific Conference on Circuits and Systems.

[6]  Daren Huang,et al.  A robust DWT-based blind data hiding algorithm , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[7]  T. Etzion,et al.  Two-dimensional interleaving schemes with repetitions: constructions and bounds , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[8]  R. Morelos-Zaragoza The art of error correcting coding , 2002 .

[9]  Minghua Chen,et al.  A fragile watermark error detection scheme for wireless video communications , 2005, IEEE Transactions on Multimedia.

[10]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[11]  E. Yang,et al.  Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks , 2005 .