§ 瀏覽學位論文書目資料
  
系統識別號 U0002-0109201623442600
DOI 10.6846/TKU.2016.00044
論文名稱(中文) 基於差值擴張方法之可視可逆浮水印技術研究
論文名稱(英文) Difference-Expansion based reversible and visible watermarking scheme
第三語言論文名稱
校院名稱 淡江大學
系所名稱(中文) 資訊工程學系碩士班
系所名稱(英文) Department of Computer Science and Information Engineering
外國學位學校名稱
外國學位學院名稱
外國學位研究所名稱
學年度 104
學期 2
出版年 105
研究生(中文) 葉信呈
研究生(英文) Hsin-Cheng Yeh
學號 604410950
學位類別 碩士
語言別 繁體中文
第二語言別
口試日期 2016-07-12
論文頁數 66頁
口試委員 指導教授 - 陳建彰
委員 - 楊權輝
委員 - 洪文斌
委員 - 陳建彰
關鍵字(中) 可視浮水印
可逆浮水印
差值擴張
動態像素值配對
關鍵字(英) Reversible watermark
visible watermark
difference expansion
dynamic pixel value mapping
第三語言關鍵字
學科別分類
中文摘要
可視可逆浮水印技術可以將浮水印資訊嵌入至數位影像中以獲得浮水印嵌入影像,可以在浮水印嵌入影像中明顯發現可辨識之浮水印資訊,使數位影像的版權受到保護。當需要時可以由浮水印嵌入影像中抽取浮水印資訊,並還原獲得原數位影像。
本論文提出一個具顯著嵌入效果之可視可逆浮水印技術,此技術使用動態像素值配對技術將浮水印資訊嵌入至數位影像中選定的可視浮水印區域R,並使用差值擴張法將相關二值資訊嵌入至整張影像當中。可視浮水印區域的大小將受到區塊設定值k及二值浮水印影像邊長的影響而改變,當選擇的k值越大我們將得到較大的可視浮水印區域,而k值的範圍介於1至數位影像與浮水印影像的最小邊長比。首先依據所選擇的k值將可視浮水印區域分割為多個大小為k×k的不重疊區塊,每個區塊對應一個浮水印資訊,並使用本論文提出的動態像素值配對方法嵌入高視覺效果的可視浮水印。接著使用金鑰將二值浮水印資訊及浮水印資訊為黑色像素所對應之k×k區塊之LSB位元陣列進行加密後,使用差值擴張方法將二值資訊嵌入至數位影像中。
實驗結果顯示我們能夠在浮水印嵌入影像中,清楚看到明顯的可視浮水印資訊,使數位影像能夠明確得以表示影像的所有權。而在需要抽取浮水印時,使用正確金鑰即能夠有效得將浮水印資訊由浮水印嵌入影像中完整抽取,並無失真得還原原始的數位影像。
英文摘要
A visible and reversible image watermarking scheme is a technique for embedding watermark into digital image, after embedding watermark, the visible watermark is visibly and clearly shown on the embedded watermarking image for protecting the ownership of the digital image. The watermark can be extracted with recovering the original digital image when needed. This paper presents a visible and reversible image watermarking scheme, using the proposed dynamic pixel value mapping to adjust part of the digital image, named visible embedded region R. The size of R is determined by the block coefficient k and also the size of the binary watermark image, in which large k value leads to large visible embedded region, then using the difference-expansion method to embed required binary strings into the whole image. The visible embedded region R is partition into non-overlapped k×k blocks and each block is related to one bit of the watermark image. For those blocks that are related to the black pixels of the watermark image, these k×k blocks are adjusted by the dynamic pixel value mapping for highly visual detection. Using the secret key to encrypt the binary bit string S, which composed of the binary watermark image and LSB bits of the black pixels corresponded k×k blocks, is embedded into the digital image using the difference-expansion method. Experimental results show that the watermark information is clearly embedded into the embedded region R and distortion of the reversible embedding is limited.
第三語言摘要
論文目次
目錄	III
圖目錄	V
表目錄	VI
 第一章 緒論	1
1.1 研究背景與動機	1
1.2 論文架構	3
 第二章 相關研究	4
2.1 差值擴張技術	4
2.2 像素值配對技術	5
2.3 Hu和Jeon的方法	6
2.4 Yang等人的方法	7
2.5 Liu和Tsai的方法	8
2.6 Chen等人的方法	10
 第三章 本論文提出方法	11
3.1 嵌入流程	11
3.2 還原流程	17
 第四章 實驗結果	21
4.1 實驗結果	21
4.2 與其他學者比較	36
4.3 安全性分析	41
 第五章 結論	43
 參考文獻	44
 附錄-期刊論文 47

圖目錄
圖 2.1 Liu 和 Tsai 嵌入方法示意圖 9 
圖 3.1掩護影像C與浮水印影像W在不同k值時產生的可視區域R  16 
圖 3.2本論文提出之浮水印嵌入範例,當k=2  16 
圖 3.3本論文提出之浮水印抽取與掩護影像還原範例,當k=2  20 
圖 4.1實驗使用圖片  21 
圖 4.2浮水印嵌入實驗結果  22 
圖 4.3浮水印嵌入位移量結果比較  25 
圖 4.4嵌入品質比圖  27 
圖 4.5本論文與其他學者之浮水印嵌入影像  28 
圖 4.6與其他學者之可視浮水印區域嵌入品質比較圖  29 
圖 4.7使用不同金鑰進行浮水印抽取與掩護影像還原結果  31 
圖 4.8胡椒鹽雜訊攻擊之實驗結果 33 
圖 4.9區域取代攻擊之實驗結果  35 
圖 4.10 本研究與其他學者[5, 14, 20, 22]提出方法之浮水印嵌入影像  38 
圖 4.11 本研究與 Hu 和 Jeon[20]、Yang 等人[22]、Liu 和 Tsai[14]及 Chen 等人[5]的方法計算時間比較  40

表目錄
表 4.1 圖 4.2 之浮水印嵌入實驗數據與結果分析   23 
表 4.2 本研究與其他學者[5, 13, 14, 19, 20, 22]提出之可視可逆浮水印技術 比較   37 
表 4.3 竊取大小為 128x128之二值浮水印影像及 LSB 位元陣列正確還原 機率  42
參考文獻
[1]	A. Jolfaei, X. W. Wu and V. Muthukkumarasamy. “On the security of permutation-only image encryption schemes,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 2, pp. 235–246, 2016.
[2]	A. M. Alattar. “Reversible watermark using the difference expansion of a generalized integer transform,” IEEE Transactions on Image Processing, vol. 13, no. 8, pp. 1147–1156, 2004. 
[3]	B. Ou, X. L. Li, Y. Zhao, R. R. Ni and Y. Q. Shi. “Pairwise prediction-error expansion for efficient reversible data hiding,” IEEE Transactions on Image Processing, vol. 22, no. 12, pp. 5010–5021, 2013.
[4]	C. C. Lin, S. P. Yang and N. L. Hsueh. “Lossless data hiding based on difference expansion without a location map,” Congress on Image and Signal Processing, 2008. 
[5]	C. C. Chen, Y. H. Tsai and H. C. Yeh. “Difference-expansion based reversible and visible image watermarking scheme,” Multimedia Tools Applications, 2016. (Accepted)
[6]	C. C. Chen and W. J. Wu. “A secure boolean-based multi-secret image sharing scheme,” Journal of Systems and Software, vol. 92, no. 1, pp. 107–114, 2014. 
[7]	D. Coltuc and J. M. Chassery. “Very fast watermarking by reversible contrast mapping,” IEEE Signal Processing Letters, vol. 14, no. 4, pp. 255–258, 2007. 
[8]	J. Li, X. L. Li, B. Yang and X. M. Sun. “Segmentation-based image copy-move forgery detection scheme,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 3, pp. 507–518, 2015. 
[9]	J. Tian. “Reversible data embedding using a difference expansion,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, no. 8, pp. 890–896, 2003. 
[10]	L. Luo, Z. Y. Chen, M. Chen, X. Zeng and Z. Xiong. “Reversible image watermarking using interpolation technique,” IEEE Transactions on Information Forensics and Security, vol. 5, no. 1, pp. 187–193, 2010. 
[11]	C. F. Lee, H. L. Chen and H. K. Tso. “Embedding capacity raising in reversible data hiding based on prediction of difference expansion,” Journal of System and Software, vol. 83, no. 10, pp. 1864–1872, 2010. 
[12]	C. C. Lin, S. P. Yang and N. L. Hsueh. “Reversible data hiding based on three-circular-pixel difference expansion,” Fundamenta Informaticae, vol.91, no. 3–4, pp. 581–595, 2009. 
[13]	P. Y. Lin, Y. H. Chen, C. C Chang and J. S. Lee. “Contrast-adaptive removable visible watermarking (CARVW) mechanism,” Image Vision Computing, vol. 31, no. 4, pp. 311–321, 2013. 
[14]	T. Y. Liu and W. H. Tsai. “Generic lossless visible Watermarking—A new approach,” IEEE Transactions on Image Processing, vol. 19, no. 5, pp. 1224–1235, 2010. 
[15]	M. A. M. Abadi, H. Danyali and M. S. Helfroush. “Reversible watermarking based on interpolation error histogram shifting,” 5th International Symposium on Telecommunications (IST), 2010. 
[16]	S. M. Wadi and N. Zainal. “Decomposition by binary codes-based speedy image encryption algorithm for multiple applications,” IET Image Processing, vol. 9, no. 5, pp. 413–423, 2015.
[17]	W. C. Shi, F. Zhao, B. Qin and B. Liang. “Improving image copy-move forgery detection with particle swarm optimization techniques,” China Communications, vol. 13, no. 1, pp. 139–149, 2016.
[18]	C. C, Thien and J. C. Lin. “Secret image sharing,” Computers & Graph, vol. 26, no. 5, pp. 765–770, 2002. 
[19]	H. M. Tsai and L. W. Chang. “Secure reversible visible image watermarking with authentication,” Signal Process Image Communication, vol. 25, no. 1, pp. 10–17, 2010. 
[20]	Y. J. Hu and B. W. Jeon. “Reversible visible watermarking and lossless recovery of original images,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 16, no. 11, pp. 1423–1429, 2006. 
[21]	Y. J. Hu, H. K. Lee, K. Y. Chen and J. W. Li. “Difference expansion based reversible data hiding using two embedding directions,” IEEE Transactions on Multimedia, vol. 10, no. 8, pp. 1500–1512, 2008. 
[22]	Y. Yang, X. M. Sun, H. F. Yang, C. T. Li and R. Xiao. “A contrast-sensitive reversible visible image watermarking technique,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 19, no. 5, pp. 656–667, 2009. 
[23]	Z. C. Ni, Y. Q. Shi, N. Ansari, W. Su, Q. Sun and X. Lin. “Robust lossless image data hiding designed for semi-fragile image authentication,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 18, no. 4, pp. 497–509, 2008. 
[24]	Z. C. Ni, Y. Q. Shi, N. Ansari and W. Su. “Reversible data hiding,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 16, no. 3, pp. 354-362, 2006.
論文全文使用權限
校內
校內紙本論文立即公開
同意電子論文全文授權校園內公開
校內電子論文立即公開
校外
同意授權
校外電子論文立即公開

如有問題,歡迎洽詢!
圖書館數位資訊組 (02)2621-5656 轉 2487 或 來信