下載/瀏覽

Download Report

Transcript 下載/瀏覽

A new steganographic method for
color and grayscale image hiding
Adviser: Chih-Hung Lin
Speaker:I-Chun Pan
Date:2009/11/17
1
Introduce of Authors






ELSEVIER Computer Vision and Image Understanding
Volume 107, Issue 3, September 2007, Pages 183-194 .
Received 16 March 2006; accepted 4 November 2006,
Available online 20 December 2006.
Author: Yuan-Hui Yu , Chin-Chen Chang ,Iuon-Chang Lin .
Yuan-Hui Yu is with Department of Information Engineering
and Computer Science, Ching Yun University ,
Taoyuan ,Taiwan.
Chin-Chen Chang is with Department of Information
Engineering and Computer Science, Feng Chia University,
Taichung, Taiwan.
Iuon-Chang Lin is with Department of Management
Information Systems, National Chung Hsing University,
Taichung, Taiwan.
2
Outline



Introduction
Related work
Proposed scheme




Embedding procedure
Extracting procedure
Experimental result
Conclusions
3
Introduction 1/3

Steganographic method’s types



Hiding secret data in spatial domain.
Hiding secret data in transformed
domain.
Secret image types of hiding


Hiding grayscale image in host image.
Hiding color image in host image.
4
Introduction 2/3

3 types of secret images can be
embedding in a true color image




1. Color secret image.
2. palette-based 256-color secret
image.
3. grayscale image.
Another hiding data in this method.

Annotation data .
5
Introduction 3/3

Protection system

Conventional crypto system (DES).
6
Related work 1/2

Lin et al.’s hiding scheme.
7
Related work 2/2

Lin et al.’s extraction procedure .
8
Proposed scheme 1/7

The embedding procedure.
9
Proposed scheme 2/7

Hiding located:256-color palette
1
2
3
Successive 512 pixels located in
the third row.
Successive 256 pixels located in
the third row.
3
2
1
10
Proposed scheme 3/7

Hiding located: annotation data.
1
2
.
.
.
.
5
Embedded in third fifth and seventh
rows from the top boundary.
7
5
3
2
1
Embedded in remaining successive
256 color pixels located in the third
row and fifth row from bottom
boundary.
11
Proposed scheme 4/7

Data embedding



1. Secret data converted to binary
representation.
2. Encrypted secret data by the DES.
3. Encrypted data is divided 3 units.
1
1
1
2
2
3
3
3
Encrypted data(8-bit)

4. Using optimal pixel value substitution
process (OPVSP).
12
Proposed scheme 5/7

OPVSP for embedding
Example:
set sr=6,hr=100
hr ' =100+(6 mod8)=102
If 102 < 100 then cr=102+8 ///Unsubstantiated
If 102 > 100 then cr=102- 8=94 ///Substantiated
If 94>=0 and |100-94|<|100-102|
then hr’=cr ///Unsubstantiated
so hr’=102
13
Proposed scheme 6/7

Extracting the hidden palette data .
Example:
sr=102 mod 8=6
14
Proposed scheme 7/7

The extracting procedure.
15
Experimental result 1/4

Experimental methods



Color secret image hidden in a true
color image.
Grayscale secret image hidden in a true
color image.
Annotation data and secret image are
embedding in the host image.
16
Experimental result 2/4
Secret image type: color image
Host image type: true color image
17
Experimental result 2/4
Q is in the interval[-1,1].
If Q=1,means stego-image and host image
are exactly the same.
18
Experimental result 3/4
Secret image type: grayscale image
Host image type: true color image
19
Experimental result 4/4
AAD : annotation data size(byte)
20
Conclusions


Proposed a new steganographic method for embedding a
color or a grayscale image in a true color image.
Future work


Improving time efficiency when the color quantization of a
secret image is performed.
Incorporating with well known compression algorithms, such
as JPEG, to compress/decompress secret image before/after
the proposed scheme.
21
The END !
22