1 / 17

Reversible visible watermarking and lossless recovery of original images

Reversible visible watermarking and lossless recovery of original images. Source: IEEE transactions on circuits and systems for video technology, vol. 16, no. 11, November 2006 Authors: Yongjian Hu and Byeungwoo Jeon Speaker: Chia-Chun Wu ( 吳佳駿 ) Date: 2007/05/02. Outline. Introduction

biana
Download Presentation

Reversible visible watermarking and lossless recovery of original images

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Reversible visible watermarking and lossless recovery of original images Source: IEEE transactions on circuits and systems for video technology, vol. 16, no. 11, November 2006 Authors: Yongjian Hu and Byeungwoo Jeon Speaker: Chia-Chun Wu (吳佳駿) Date: 2007/05/02

  2. Outline • Introduction • Reversible visible watermarking • Proposed method • Embedding • Lossless Recovery • Experimental results • Conclusions • Our proposed method

  3. Introduction (1/2) • Generally, a visible watermark is translucently laid on the host image and designed to be irreversible so as to resist unintentional modifications or malicious attacks.

  4. Introduction (2/2) • However, in some potential applications, a visible watermark is first used as a tag or ownership identifier and then needs to be removable. • Example: • 1. patient’s images • 2. remote sensing • 3. military imagery

  5. Reversible visible watermarking Host image Marked-image Embedding algorithm SKKU SKKU User key (80 bits) Host image Marked-image Extraction algorithm recover SKKU SKKU User key (80 bits)

  6. The Proposed method − Embedding (1/5) H=Sc∪ Dc W =Binary watermark S =Pixel sequence composed of one-bit pixels on Ik Fig. 1. Framework of visible watermark embedding and data hiding. User key (80 bits) = Watermark size (8 bits+8 bits) + Origin position of R (16 bits+16 bits) + Dc size (16 bits) + key bit plane level (3 bits) …

  7. The Proposed method − Embedding (2/5) Host Image I Watermark W I-R R

  8. The Proposed method − Embedding (3/5) R Hiding Compression Dc = 010 W D R’

  9. The Proposed method − Embedding (4/5) LSB of I-R 0 0 0 Dc = 010, |Dc| = 3 S=0,|S|=1, |Sc|=1 X S=00, |S|=2, |Sc|=2 X S=000, |S|=3, |Sc|=2 X S=000010101011 Sc=001001011 |S|=12, |Sc|=9 O Payload: H=Sc∪ Dc H=001001011010 To find S which satisfy |Dc|=|S|-|Sc|

  10. The Proposed method − Embedding (5/5) Watermarked imagesIm (I-R)m Rm

  11. The Proposed method − Lossless Recovery (1/2) LSB of(I-R)m |Dc| = 3 Sc=001001011 S=000010101011 |Sc|=9, |S|=12 O Dc= 010 To find Sc which satisfy |Dc|=|S|-|Sc|

  12. The Proposed method − Lossless Recovery (2/2) Extraction R’ Decompression Dc = 010 D W R

  13. Experimental results (1/2) Fig. 2. Visibly watermarked images with the MSB plane ofR asRD (upper row) and the second MSB plane of R as RD(lower row), respectively.

  14. Experimental results (2/2) TABLE I: Performance evaluation. The unit of |D|; |Dc|; and |S| is Bytes. NRD and Nkbdenote the bit plane level of RDandthe key bit plane, respectively. The PSNR is calculated without R. (Unit: DB)

  15. Conclusions • Design for binary watermarks • The first work that implements a reversible visible watermarking system.

  16. Our proposed method-embedding (1/2) Histogram Host Image I a=3 b=6 I-R R peak zero D Watermark I’ W

  17. Our proposed method-embedding (2/2) a=3 b=6 I’ D= 1001 Watermarked imagesIm

More Related