Reversible Data Embedding Using Difference Expansion IEEE Transactions on Circuits and Systems for Video Technology, Vol. 13, No. 8, Aug. 2003, page(s):

Slides:

Advertisements

Similar presentations

Reversible Data Hiding Based on Two-Dimensional Prediction Errors

Advertisements

1 Adjustable prediction-based reversible data hiding Authors: Chin-Feng Lee and Hsing-Ling Chen Source: Digital Signal Processing, Vol. 22, No. 6, pp.

A High Performance Multi-layer Reversible Data Hiding Scheme Using Two-Step Embedding Authors: Jinxiang Wang Jiangqun Ni Jinwei Pan.

A reversible data hiding method by histogram shifting in high quality medical images Author: Li-Chin Huang, Lin-Yu Tseng, Min-Shiang Hwang Source: The.

Reversible watermarking Wu Dan Introduction Difference expansion Histogram bin shifting.

Source: Signal Processing, Vol. 89, Issue 6, June 2009, Pages Author: Piyu Tsai, Yu-Chen Hu, and Hsui-Lien Yeh Speaker: Hon-Hang Chang Date:

Steganography of Reversible Data Hiding Producer: Chia-Chen Lin Speaker: Paul 2013/06/26.

Consecutive Numbers Algebra I.

1 Hiding Data in Images by Simple LSB Substitution Source: Pattern Recognition, Vol. 37, pp , 2004 Authors: Chi-Kwong Chan and L.M. Cheng Speaker:

Objectives: 1.Be able to determine if an equation is in explicit form or implicit form. 2.Be able to find the slope of graph using implicit differentiation.

1 Reversible data hiding for high quality images using modification of prediction errors Source: The Journal of Systems and Software, In Press, Corrected.

Reversible watermarking Wu Dan Introduction What?

Reversible image hiding scheme using predictive coding and histogram shifting Source: Authors: Reporter: Date: Signal Processing, Vol.89, Issue 6, pp ,

Reversible Date Hiding Based on Histogram Modification of pixel Differences IEEE Transactions on circuits and systems for video technology, VOL. 19, NO.

1 Reversible Watermark Using the Difference Expansion of a Generalized Integer Transform Source : IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 8,

1 資訊隱藏技術之研究 The Study of Information Hiding Mechanisms 指導教授： Chang, Chin-Chen ( 張真誠 ) 研究生： Lu, Tzu-Chuen ( 呂慈純 ) Department of Computer Science and Information.

A lossless data hiding scheme based on three- pixel block differences Ching-Chiuan Lin and Nien-Lin Hsueh Pattern Recognition, Vol. 41(4), April 2008 Pages.

1 Adaptive Data Hiding in Edge Areas of Images With Spatial LSB Domain Systems Adviser: Chih-Hung Lin Speaker ： Chia-Wei Chang Date:2009/10/06.

1 Reversible visible watermarking and lossless recovery of original images Source: IEEE transactions on circuits and systems for video technology, vol.

1 Reversible Watermark Using the Difference Expansion of a Generalized Integer Transform Source : IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 8,

1 Adaptive Data Hiding in Edge Areas of Images with Spatial LSB Domain Systems Source: IEEE Transactions on Information Forensics and Security, Vol. 3,

Efficient Huffman Decoding Aggarwal, M. and Narayan, A., International Conference on Image Processing, vol. 1, pp. 936 – 939, 2000 Presenter :Yu-Cheng.

Reversible Data Hiding in Encrypted Images With Distributed Source Encoding Source: IEEE Transactions on Circuits and Systems for Video Technology Vol.26.

Consecutive Numbers Algebra I.

Image camouflage by reversible image transformation

Consecutive Integer Problems

Picode: A New Picture-Embedding 2D Barcode

Reversible Data Hiding in JPEG Images using Ordered Embedding

Source : Signal Processing, Volume 133, April 2017, Pages

1. Be able to add and subtract rational functions.

Source :Journal of visual Communication and Image Representation

Reversible data hiding scheme based on significant-bit-difference expansion Sourse: IET Image Processing ( Volume: 11, Issue: 11, ), Pages 1002.

New Framework of Reversible Data Hiding in Encrypted JPEG Bitstreams

Source : Signal Processing, vol. 150, pp , September 2018

Yongjian Hu, Member, IEEE, Heung-Kyu Lee, Kaiying Chen, and Jianwei Li

A Restricted Region-based Data-hiding Scheme

Source: Information Sciences, 2018, accpeted.

Source : Signal Processing, vol. 126, pp , November 2016

Skewed Histogram Shifting for Reversible Data Hiding using a Pair of Extreme Predictions Source: IEEE Transactions on Circuits and Systems for Video Technology(

Source:. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL

Source: IEEE Access, Vol. 6, Dec. 2017, pp

Sourse: IEEE Transactions on Circuits and Systems for Video Technology

Data hiding based Hamming code

Reversible Data Hiding in JPEG Images

Source : Journal of Visual Communication and Image Representation, vol

Reversible data hiding in encrypted images based on absolute mean difference of multiple neighboring pixels Source: Journal of Visual Communication and.

Skewed Histogram Shifting for Reversible Data Hiding using a Pair of Extreme Predictions Source: IEEE Transactions on Circuits and Systems for Video Technology(

Dynamic embedding strategy of VQ-based information hiding approach

Authors:Tae-Yun Chung; Min-Suk Hong; Young-Nam Oh;

Source : Journal of Visual Communication and Image Representation, vol

Partial reversible data hiding scheme using (7, 4) hamming code

High Capacity Data Hiding for Grayscale Images

Data hiding method using image interpolation

EarthTour Presentations

Chair Professor Chin-Chen Chang Feng Chia University

Partial reversible data hiding scheme using (7, 4) hamming code

New Framework for Reversible Data Hiding in Encrypted Domain

An efficient reversible data hiding with reduplicated exploiting modification direction using image interpolation and edge detection Source： Multimedia.

Authors: Jun Tian Speaker: J.H. Liu

Author :Ji-Hwei Horng (洪集輝) Professor National Quemoy University

Sourse: Information Sciences, Vol. 494, pp , August 2019

Source: IET Image Processing, Vol. 4, No. 4, Aug. 2010, pp

Dynamic improved pixel value ordering reversible data hiding

An Efficient Spatial Prediction-Based Image Compression Scheme

LSB matching revisited

Sourse: arXiv preprint, arXiv: , 2018 (Submit to IEEE Trans

High-Capacity Data Hiding in Halftone Images Using Minimal-Error Bit Searching and Least-Mean Square Filter Author: Soo-Chang Pei and Jing-Ming Guo Source:

A Restricted Region-based Data-hiding Scheme

Adopting secret sharing for reversible data hiding in encrypted images

Reversible data hiding in encrypted binary images by pixel prediction

Presentation transcript:

Reversible Data Embedding Using Difference Expansion IEEE Transactions on Circuits and Systems for Video Technology, Vol. 13, No. 8, Aug. 2003, page(s): Authors: Jun Tian Speaker: J.H. Liu

Outline  Data Embedding  Reversible Data Hiding  Difference Expansion  Expandable  Changeable  Difference Expansion Decoding  Expandable decoding  Changeable decoding  Conclusions

Data Embedding  Reversible data hiding 1

Difference Expansion  One of data embedding methods  Basic case:  h = x – y l = ( x + y ) / 2 x=l + h /2 + LSB( h ) y=l - h /2  Hint : There divide(/) is integer divide.  For example, x/y meaning floor(x/y). x =206 y =201 average l = If h is odd, bit will lost with h /2. We must return it into x. 2

Difference Expansion - method location map L Case1. expandable : h’ = 2× h + b 1  h = x - y Case2. changeable : bitstream C 0 Case3. non-changeable0  bitstream C = collection of LSBs( h )  Expandable : | h’ | = |2x h + b | ≦ min(2(255- l ),2x l -1) Changeable : | h’ | = |2x( h /2)+ b | ≦ min(2(255 -l ),2x l -1) 3

Expandable  1 st step: h’ = h x2 + secret bit ( b )  2 nd step: x’ = l + h’ /2 + LSB( h’ ) y’ = l - h’ /2  location map L = 1 x’ =209 y’ =198 l = b = 1 l =203 h’ =5*2+1=11 x’ =203+11/2+11%2=209 y’ =203-11/2=198

Changeable  It is non-expandable  1 st step: h’ = ( h /2)x2 + b  2 nd step: lost bit( c ) = LSB( h )  3 rd step: x’ = l + h’ /2 + LSB( h’ ) y’ = l - h’ /2  location map L = 0 x =246 y =200 l = There we will lost the LSB of h. We record the LSBs of h at bitstream C. x’ =247 y’ =

Expandable decoding  1 st step: get h’ = x’-y’  2 nd step: get b = LSB( h’ )  3 rd step: get h = h’ /2  4 th step: get x = l + h /2 + LSB( h ) y = l - h /2 Note: average l is never changed. x‘ = 209 y‘ = 198 l = l =( )/2=203 h’ = =11 b =11%2=1 h =11/2=5 x =203+5/2+5%2 = =206 y =203-5/2=201 x = 206 y = 201 l =

Changeable decoding  1 st step: get h’ = x’ - y’  2 nd step: get b = LSB( h’ )  3 rd step: get h = h’- b + bitstream( c )  4 th step: get x = l + h /2 + LSB( h ) y = l - h /2 x’ = 247 y’ = 200 l = l =( )/2=223 h’ = =47 b =47%2=1 h =47-1+0=46 x =223+(46/2)+46%2 = =246 y =223-46/2=200 7 x =246 y =200 l =

Conclusions  Simple and efficient reversible embedding method.  The method of location map L is not good enough. We may improve the method of location map anywise.  The case of changeable is a kind of useless. 8