Hiding and Retrieval Techniques for Digital Media机密讯息.ppt

Secret Hiding and Retrieval Techniques for Digital Media機密訊息在數位媒體中的隱藏及擷取技術之研究 Advisor: Chin-Chen Chang1, 2 Student: Yi-Hui Chen2  1 Dept. of Information Engineering and Computer Science, Feng Chia University 2 Dept. of Computer Science and Information Engineering, National Chung Cheng University Outline Part I: Secrets Hiding for Digital Images Image Steganography LSB-based High-Capacity Data Embedding Scheme for Images Part II: Secrets Hiding for Compression Codes Joint Coding and Embedding Techniques for Multimedia Images Part I : Secrets Hiding for Digital Images LSB-based High-Capacity Data Embedding Scheme for Images Image Steganography Prison Problem Zhang and Wang’s Method Proposed Scheme (1/5) Steganography (2/5) Steganography (3/5) Steganography (4/5) Steganography (5/5) Experiments (1/4) Experiments (2/4) Experiments (3/3) Experiments (4/4) Part II : Secret Hiding for Compression Codes Joint Coding and Embedding Techniques for Multimedia Images VQ Vector Quantization (VQ) Overview: Side Match VQ (SMVQ) Assumption: Neighboring pixel intensities in an image are pretty similar. Proposed scheme (1/3) Proposed scheme (2/3) Proposed scheme (3/3) Experiments (1/3) Further Works Secrets data hiding No extra indicator need to store Other digital media Text-based document Audios Thanks for your attention * * Secrets Sender Receiver Internet ?Steganography - Prison Problem ?Quality, Capacity and Security Secrets Alice Bob Warden Escape n = 2 Hiding capacity = log2(2n+1) ≒ 2.32 n = 2 Hiding capacity = log2(3n) ≒ 3.17 n=2 a1 a2 50 51 0 1 F(50, 51)=50×1+51×3 mod 9 = 5 F(0, 1)=0×1+1×3 mod 9 =3 S = 3, 2 (0≦ S 3n) p=(3-5+(9-1)/2) mod 9 =2 p=(2-3+(9-1)/2) mod 9 =3 Minus (1)3(1)3 p=2=(02)3 a1 a2 50 51 0 1 Minus (1)3(1)3 (-11)3 (0 -1)3 50+(1) = 51 51+(-1)= 50 p=3=(10)3 0+(-1)=-1 1+(0)=1 51 50 F(1, 1)=1×1+1×3 mod 9 = 4 p=(2-4+(9-1)/2) mod 9 =2 a1 a2 51 50 1 1 a1 a2 51 50