1 Information Hiding Based on Search Order Coding for VQ Indices Source: Pattern Recognition Letters, Vol.25, 2004, pp.1253 – 1261 Authors: Chin-Chen Chang, Guei-Mei Chen, and Min-Hui Lin Speaker: Chiuan-Bo Yeh ( 葉權柏 ) Date: 2004/09/15

2 Outline Introduction Vector Quantization (VQ) Search-Order Coding (SOC) The proposed scheme Experimental results Conclusions Comments

3 Introduction Host Image VQ indicesSOC indices Stego Image Secret Data VQSOCEmbed 1.Compress host image by VQ, and generate VQ indices. 2.Compress VQ indices by SOC, and generate SOC indices. 3.Use the proposed scheme to embed the secret data into SOC indices, and generate stego image.

4 Vector Quantization(1/2) Divided into blocks of the same size Encoded by the closest codeword in the codebook 01…i…01…i… i Record the VQ index

5 Vector Quantization(2/2) Block Codebook CW1 CW2 CW3 CW4 Vector v = (18,45,43,72) Compute the square of the Euclidean Distance 4 d(v,CW i ) = ∥ v - CW i ∥ 2 = ∑ (v j – CW ij ) 2 j=1 d(v,CW1) = = 1672 d(v,CW2) = = 6430 d(v,CW3) = = 7195 d(v,CW4) = = 1116 Min Choice CW4 into VQ indices.

6 Search-Order Coding(1/2) To increase the compression rate of the VQ indices of an image. There is usually a high correlation between the neighboring blocks

7 Search-Order Coding(2/2) Define indicator 0 search order codes (SOC) 1 original index values (OIV) If one of the SPs matches 0 11 indicator SOC If none of the SPs matches indicator OIV

8 The proposed scheme(1/3) Receiver determines that each bit of secret data is ‘‘ 0 ’’ or ‘‘ 1 ’’ according to whether the received compression code is SOC or OIV. Ex. Receive The secret data is The largest size of secret data can be the number of the blocks.

9 The proposed scheme(2/3) In the hiding process, there are four categories taken into consideration. Indicator Secret data 1 1 There is nothing needing to be changed. 0 1 Preserve the OIV compression code instead of the SOC one. The compression rate will decrease. 0 0 There is nothing needing to be changed. 1 0 A translation technique of translating OIV into SOC is performed. The compression rate will decrease.

10 The proposed scheme(3/3) 18 (OIV) 21 (OIV) 31 (OIV) 30 (OIV) 30 (SOC) 31 (SOC) 29 (OIV) 30 (SOC) 32 (OIV) A 3 · 3 index table for showing the original coding results of the SOC algorithm. The hiding position of each bit of the secret bit string ‘‘ ’’ in the raster scan order. [(1,1),1] OIV 1 Nothing to be changed [(2,2),1] SOC 1 OIV instead of SOC [(2,3),0] SOC 0 Nothing to be changed [(3,3),0] OIV 0 SOC instead of OIV Status Secret Data

11 Experimental results(1/2) Table 1 The amount of increasing bits for hiding data in the compression codes Code category in the results of the original SOC coding method Code category in the results of our information hiding OIV SOC OIV 0 n SOC log 2 N c – n 0 Table 2 Bit rate for embedding different sized secret binary image ‘‘ Lena ’’ into six host images The size of secret Airplane Boat Girl Lena Peppers Toys data (bits)

12 Experimental results(2/2) Table 3 Bit rates of the SOC scheme and our information hiding method with secret binary image ‘‘ Barbara ’’ of 1024 bits Methods Images Airplane Boat Girl Lena Peppers Toys SOC (Hsieh and Tsai, 1996) OIV represents to hide ‘‘ 1 ’’ OIV represents to hide ‘‘ 0 ’’ Table 4 Bit rates of the SOC scheme and our information hiding method with secret binary image ‘‘ Lena ’’ of 1024 bits Methods Images Airplane Boat Girl Lena Peppers Toys SOC (Hsieh and Tsai, 1996) OIV represents to hide ‘‘ 1 ’’ OIV represents to hide ‘‘ 0 ’’

13 Conclusions The first scheme that embeds the secret data into the compression codes of the VQ indices directly. Embedding the secret data will not incur any distortion. Receive both the compressed image and the embedded data almost at the same time.

14 Comments Find a function f such that f( indicators ) = secret data Ex. Increase distortion, and increase compression rate. 18 (OIV) 21 (OIV) 31 (OIV) 30 (OIV) 30 (SOC) 31 (SOC) 29 (OIV) 30 (SOC) 32 (OIV) indicators secret data f( ) =