O'Reilly logo

Lossless Information Hiding in Images by Shi-Ze Guo, Zhe-Ming Lu

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

4.3. Modified Fast Correlation Vector Quantization–Based Scheme

Image blocks encoded by VQ are usually in the form of indices, which represent codewords' positions in a codebook C. The VQ encoder E quantizes the input image block x by selecting a best-matched code vector cb [cb  C = {c0, c1,…, cN1}, where N is the size of the codebook C]. Here, the Euclidean distance given in Eq. (4.2) is often employed as a metric for the best matching. It is obvious that this quantization might cause some distortion to the watermark information embedded in the pixel domain, if the embedding algorithms are sensitive to this operation, like most value expansion–based lossless information hiding algorithms [3438]. So a lossless watermarking algorithm that works ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required