Robust Lossless Image Data Hiding Designed for Semi-Fragile Image by malj

VIEWS: 8 PAGES: 8

									 Reversible Data Hiding Based on Histogram
      Modification of Pixel Differences

        IEEE Transactions on Circuits and System for Video Technology, 2009

Authors: Wei-Liang Tai, Chia-Ming Yeh, and Chin-Chen Chang,
                                                 Reporter :Wei-De Hsu




                                                                              1
           Outlines
Introductions
Proposed scheme
  Histogram Modification on Pixel Differences
  Binary Tree Structure
  Prevent Overflow and Underflow
  Embedding Process
  Extraction Process

Experimental results
Conclusions

                                                2
      Introductions
Ni’s scheme
                      P




                          Z




                              3
                      Proposed scheme
     Histogram Modification on Pixel Differences
                                                                             10
   55   5
        5    6
             6    3
                  4    5
                       5                 2 3
                                     5 0 1 2 1
                                                                              8
   23   4
        5    9
             9    9
                  8    6
                       6             2 4 1 2 1
                                     3 5 2 3                                  6
                                                                                                                     Series1
   4 5 5 2 2
    4 5 5 3                          1 1 0 2 1
                                     2     3 2                                4                                      Series1

                                                                              2
                                                                              2
   3 2 7 1 1
    3 3 6 1                            4 6
                                     0 3 5 0 0
                                                                              0
                                                                              0
                                                                                  0 1 2 3 4 5 6 7 8 9 10
    2 1 4 4
   2 1 5 4 4                           2 4
                                     1 1 3 0 0                                    0 1 2 3 4 5 6 7 8 9 10


                                if  d i  P                                          Secret=101010101
                                      xi ,    i  0 or d i  P
                                               if
                                                                                       0,   yi  xi 1  P
                                                                                            if
                                yi   xi  1  d i  P and xi  xi 1,
                                             , if                                 bi  
                                      x  1  d  P and x  x                           1,    yi  xi 1  P  1
                                                                                            if
      xi    if i  0
                  ,
di                                  i , if i              i   i 1,

      xi 1  xi  
                  , otherwise
                                if  d i  P                                             yi  1  if yi  xi 1  P and yi  xi 1,
                                                                                               , 
                                                                                       
                                       xi  b  d i  P and xi  xi 1,
                                              , if                                xi   yi  1,  if yi  xi 1  P and yi  xi 1,
                                 yi                                                   y ,    otherwise
                                       xi  b, if d i  P and xi  xi 1,              i                                   4
      Proposed scheme
Binary Tree Structure




                        5
     Proposed scheme
Prevent Overflow and Underflow




                                 6
                     Proposed scheme
Embedding Process             10
10                             9

8                              8
                               7
6
                               6
4                               Series1
                               5
                                                                                   Series1
2
                               4
0                              3
     1   3   5   7   9   11
                               2
                               1
                               0
                                    0     1   2   3   4   5   6   7   8   9   10




                                                                                             7
      Conclusions
Present an efficient extension of the histogram
modification technique

Introduced a binary tree that predetermines the
multiple peak points used to embed messages

only information the sender and recipient must
share is the tree level L

                                                  8

								
To top