CHEN XIAOYU HUANG. Introduction of Steganography A group of data hiding technique,which hides data in undetectable way. Features extracted from modified.

Slides:



Advertisements
Similar presentations
Low-Complexity Transform and Quantization in H.264/AVC
Advertisements

[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
Capacity-Approaching Codes for Reversible Data Hiding Weiming Zhang, Biao Chen, and Nenghai Yu Department of Electrical Engineering & Information Science.
JPEG Compresses real images Standard set by the Joint Photographic Experts Group in 1991.
F5 A Steganographic Algorithm
F5 a Steganographic algorithm - andreas westfeld
Steganography - A review Lidan Miao 11/03/03. Outline History Motivation Application System model Steganographic methods Steganalysis Evaluation and benchmarking.
A Matlab Playground for JPEG Andy Pekarske Nikolay Kolev.
School of Computing Science Simon Fraser University
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
JPEG.
CS :: Fall 2003 MPEG-1 Video (Part 1) Ketan Mayer-Patel.
T.Sharon-A.Frank 1 Multimedia Image Compression 2 T.Sharon-A.Frank Coding Techniques – Hybrid.
Multimedia Data The DCT and JPEG Image Compression Dr Mike Spann Electronic, Electrical and Computer.
CS430 © 2006 Ray S. Babcock Lossy Compression Examples JPEG MPEG JPEG MPEG.
Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.
1 JPEG Compression CSC361/661 Burg/Wong. 2 Fact about JPEG Compression JPEG stands for Joint Photographic Experts Group JPEG compression is used with.jpg.
Image Compression JPEG. Fact about JPEG Compression JPEG stands for Joint Photographic Experts Group JPEG compression is used with.jpg and can be embedded.
Image and Video Compression
Concepts of Multimedia Processing and Transmission IT 481, Lecture 5 Dennis McCaughey, Ph.D. 19 February, 2007.
CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.
Bit-4 of Frequency Domain-DCT Steganography Technique 1 Nedal M. S. Kafri and Hani Y. Suleiman Networked Digital Technologies, NDT '09. First International.
Digital Image Processing Image Compression
A Novel steganographic method for JPEG images by Vasiliy Sachnev - Introduction  JPEG compression  Steganography - Block based steganography method (F5)
Steganography Ed Norris ECE /4/03. Introduction  Undetectable information hiding  Why undetectable?  The message and the communication itself.
Reversible hiding in DCT-based compressed images Authors:Chin-Chen Chang, Chia-Chen Lin, Chun-Sen Tseng and Wei-Liang Tai Adviser: Jui-Che Teng Speaker:
Introduction to Steganalysis Schemes Multimedia Security.
Chapter 17 Image Compression 17.1 Introduction Redundant and irrelevant information  “Your wife, Helen, will meet you at Logan Airport in Boston.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Benchmarking steganographic and steganalysis techniques Electronic Imaging of SPIE 2005 Authors:Kharrazi, Mehdi, Husrev T. Sencar, and Nasir Memon Department.
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
Program Homework Implementation of the Improved Spread Spectrum Watermarking System.
JPEG.
Reporter :Chien-Wen Huang Date : Information Sciences, Vol. 176, No. 22, Nov. 2006, pp Received 29 December 2004; received in revised.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
Introduction to JPEG m Akram Ben Ahmed
基於 (7,4) 漢明碼的隱寫技術 Chair Professor Chin-Chen Chang ( 張真誠 ) National Tsing Hua University National Chung Cheng University Feng Chia University
1 Chapter 3 Text and image compression Compression principles u Source encoders and destination decoders u Lossless and lossy compression u Entropy.
Presenting: Yossi Salomon Noa Reiter Guides: Dr. Ofer Hadar Mr. Ehud Gonen.
基於(7,4)漢明碼的隱寫技術 Chair Professor Chin-Chen Chang (張真誠)
Chair Professor Chin-Chen Chang Feng Chia University Jan. 2008
Data Compression.
A Simple Image Compression : JPEG
An Information Hiding Scheme Using Sudoku
Information Steganography Using Magic Matrix
Reversible Data Hiding in JPEG Images using Ordered Embedding
Chair Professor Chin-Chen Chang Feng Chia University Aug. 2008
Steganography with Digital Images
Information Steganography Using Magic Matrix
New Framework of Reversible Data Hiding in Encrypted JPEG Bitstreams
A Data Hiding Scheme Based Upon Block Truncation Coding
Steganography in digital images
Embedding Secrets Using Magic Matrices
Chair Professor Chin-Chen Chang (張真誠) National Tsing Hua University
Image Coding and Compression
Some Novel Steganographic Methods for Digital Images
Reversible Data Hiding Scheme Using Two Steganographic Images
Advisor:Prof. Chin-Chen Chang Student :Kuo-Nan Chen
Information Steganography Using Magic Matrix
Information Hiding and Its Applications
Digital Steganography Utilizing Features of JPEG Images
High Capacity Data Hiding for Grayscale Images
A Robust and Recoverable Tamper Proofing Technique for Image Authentication Authors: Chin-Chen Chang & Kuo-Lung Hung Speaker : Chin-Chen Chang.
De-clustering and Its Application to Steganography
A Data Hiding Scheme Based Upon Block Truncation Coding
Source: Pattern Recognition, Volume 40, Issue 2, February 2007, pp
Information Hiding Techniques Using Magic Matrix
Steganographic Systems for Secret Messages
Chair Professor Chin-Chen Chang Feng Chia University Jan. 2008
Presentation transcript:

CHEN XIAOYU HUANG

Introduction of Steganography A group of data hiding technique,which hides data in undetectable way. Features extracted from modified images and original images have to be statistically undistinguishable Images, audio, video, text…..digital compressed images(JPEG)

Ternary Embedding Technique Popular steganographic: ME,MME(Binary computation) Improving existing steganogrphic data hiding methods by replacing the binary computation to ternary----ternary coefficients Higher information density Larger number of possible solutions Better solution with minimum distortion impact

JPEG was designed specifically to discard information that the human eye cannot easily see.

Partition image into 8x8 blocks, left-to-right, top-to-bottom Compute Discrete Cosine Transform(DCT) of each block Quantize coefficients according to psychovisual quantization tables Order DCT coefficients in zigzag order Perform runlength coding of bitstream of all coefficients of a block Perform Huffman coding for symbols formed by bit patterns of a block

The first step reduces the dynamic range requirements in the DCT processing stage that follows V(i,j) is the dot of original image; F(0,0) is the Direct Current, other F(u,v) is Alternating Current Discrete Cosine Transform(DCT)

Quantisation Quantisation is a process to transfer DCT coefficients to a smaller range. The purpose of quantisation is to reduce the non-zero coefficients’ amplitute and increase the number of zero coefficients(high frequency). Quantisation is the main reason causes a picture’s quality drops.

Sq(u,v) is the result after quantisation F(u,v) is the DCT coefficients Q(u,v) is the quantisation table Round is the function to round up or down

Example Consider a 8x8 block using formula F(i,j)=V(i,j)-128, we get a block

Example Using DCT, we get a result of -415 is the Direct Current Consider a quantisation table

Example Using formula We get a result

Information Hiding in JPEG Coefficients Information hiding into JPEG image adds more distortion beside the JPEG compression rounding errors: Example: C’ 1 =4.23, C’’ 1 =4, r 1 =0.23

Information Hiding in JPEG Coefficients A message M is to be embedded into C’, and the message embedded set is S. We denote LSB(c i ’’ ) as x i. If x i = m i, then s i = c i. If x i ≠ m i, then, To minimize the absolute value of r i

Information Hiding in JPEG Coefficients The distortion, d i, is given by Finally, the additional distortion e i caused by changing any single bit ci is given by A goal in information hiding is to design embedding functions to minimizing the distortion

Modified Matrix Coding The notation (t, n, k),where n = 2 k − 1. denotes embedding k message bits into an n bit sized block by changing t bits of it. Divides cover data C, into blocks of length n and message data M, into blocks of length k. Matrix Coding: t=1 Modified Matrix Coding: t>=1 t≥1 is more efficient than t=1.

Matrix Coding-Example 1 two bits x1, x2 three modifiable bit places a1, a2, a3 hanging one place at most. In all four cases we do not change more than one bit

Matrix Coding Parity check matrix (H): dependency between message bits and code word bits Ex: k=3, n=2^k-1 = 7, H: X = HC T p=binvec2dec(X ⊕ M) Change p to embed message bits Cp = ¬ Cp (1->0 and 0->1)

Example: A cover block C = ( ) The message to be transmitted M=(1 1 0) Parity check matrix H= We have X = HC T = and p=binvec2dec(X ⊕ M) = 3 Then we change the 3 rd bit in the cover C, resulting in S = ( )

In receiving, we have S, H, we can retrieve m, i.e.,

Modified Matrix Coding For t = 2, we find pairs of numbers (β, γ) such that β ⊕ γ = p, there are (n−1)/2 such pairs which can be enumerated easily For each of the pairs (βi, γi), the embedding error is given by one of four cases: Find the pair (βi, γi) with the minimum e i

Modified Matrix Coding Embedding error analysis Embedding error Per changed coefficient

Modified Matrix Coding Modified matrix encoding (MME) always has several solutions and may choose the best one which causes the lowest distortion The number of possible solutions for MME N MME is computed as follows:

Ternary Data Hiding Technique Improvement of MME. converted to the ternary coefficients (i.e., 0,1,2)as follows: Data hiding method uses vector v = (v1, v2, …, vn) (where n = 3 m -1), M org = Hv T ; for m = 2, the parity check matrix H:

Ternary Data Hiding Technique modifying one coefficient (2 solutions): C’(j + ) = C(j + ) + 1, index j + : C’(j - ) = C(j - ) – 1, index j - : modifying two coefficients (more solutions): Required M org, j +, j - All two flip solutions: 4 groups coefficients with indexes p1 and p2 modified according (+1,-1), (-1,+1), (+1,+1), (-1,-1)

Table 2. Two flip solutions

Possible solutions The number of all possible solutions for the proposed method NTE can be computed as follows: More possible solutions than MME.

Distortion Distortion can be computed as follows:

Encoder For bitmap image I and binary message M: Divide image into 8 by 8 blocks. Compute rounded DCT coefficients Convert binary message M into ternary M t. Find maximum m of N is the number on non zero rounded DCT coefficients Divide stream of computed ternary coefficients into blocks of n = 3 m -1 coefficients. Hide data to each block, rebuild a stego image.

Decoder: For stego image I stego process following: Get the stream of modified DCT coefficients Define stream of ternary coefficients. Divide stream of ternary coefficients to blocks of n = 3 m -1 coefficients. Recover the hidden message from each block using M = HV T Convert ternary hidden message to binary.

Experimental results Tested by powerful steganalysis algorithm by T. Pevny and J. Fridrich [12]. Simply, Ternary embedding is better.

References Some Notes on Steganography, Ron Crandall, Friday, December 18, 1998 F5—A Steganographic Algorithm, High Capacity Despite Better Steganalysis, Andreas Westfeld Ternary Data Hiding Technique for JPEG steganography. Vasily Sachnev, Hyoung Joong Kim Modified Matrix Encoding Technique for Minimal Distortion Steganography, Younhee Kim, Zoran Duric, and Dana Richards Wikipedia

THANKS!