Reversible Data Embedding Using a Diference Expansion Source
Reversible Data Embedding Using a Diference Expansion Source: IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 13, NO. 8, AUGUST 2003 Author: Jun Tian Speaker: Jin Lin, Huang Date: 2004. 6. 9 2021/10/20 1
Outline Abstract difference-expansion algorithm embedding/extract 2021/10/20 2
Abstract In this paper, it’s present a high capacity, high visual quality, reversible data-embedding method for digital images. Caculate the difference values for neighboring pixel values, and select some difference values for difference-expansion(DE) 2021/10/20 3
The difference-expansion(DE) algorithm 1. The original image is grouped into pairs of pixel values 2. The paring consists of two neighboring pixel values (could be done horizontally or row, or a key-based special pattern) 3. To each pattern, design a scaning order for all the difference values h. we get a sequence of h={h 1, h 2…, hn} if h=0 or 255 no use this pattern. 2021/10/20 4
The DE embedding algorithm 206 avg= =203 X = Y avg h 201 h=X-Y=5 If b=1 We need the same h’ so h+1 X’=avg+ =209 2021/10/20 X’ h’ Y’ h’=2*h+b =2*5+1=11 Y’=avg =198 5
The DE extracting algorithm 209 avg’= =203 X’ = Y’ avg’ h’ 198 h’=209 -198=11 h’=2*h+b=11 b X=209 =206 X 2021/10/20 Y b=LSB(h’)=1, h=5 Y=198+ =201 6
2021/10/20 7
Thanks! In this paper present a simple and efficientt reversible date-embedding method for digital image. 2021/10/20 8
- Slides: 8