臺灣博碩士論文加值系統

2012年學者Hong與Chen提出了一個高隱藏資訊量的資料隱藏技術，稱為合適像素配對法（Adaptive Pixel Pair Matching，APPM），在遮蔽圖像物件中每一對鄰近像素藏入任意一個k進制數字(k>=1)。APPM方法運用一對鄰近像素值對應於二維空間之參考座標，並根據欲嵌入的秘密資訊數字，在鄰近區域集附近內尋找到一個座標來進行置換。此方法不僅實現了高隱藏資料量，而且對一些已知的隱藏攻擊技術具有很好的抵抗力。APPM方法是在二維度空間中搜尋最佳資料隱藏的解決方案，然而其搜尋空間的約束也限制了這些解決方案的效能。本篇論文提出一個運用座標映射對應方法之資料隱藏的通式，將遮蔽圖像中每n個像素組成一組圖像區塊，來對應於 維度空間之參考座標，並以最小平方誤差映射隱藏函數從鄰近區域集搜尋最佳隱藏區塊解。本論文中並實現了以每一組圖像區塊為3個像素(n=3)之資料隱藏實例，且經實驗數據證明，確實較APPM方法的資料隱藏方法，具有更佳的資料隱藏能力。

In 2012 Hong and Chen proposed a novel data embedding method using adaptive pixel pair matching (APPM), in which a k-ary(k>=1) number is embedded in each pair of pixels of the cover image. It uses a pixel pair as a reference coordinate in two-dimensional space, and searches for a nearby coordinate in the neighborhood set to replace the pixel pair according to a given message digit. The method not only achieves a high hiding-payload, but also has good resistibility against the attacks of some well-known steganalysis techniques. APPM searches for the best embedding solution in 2D space in which the constraint for the searching space limits the performance of the scheme. In this paper a general form of data embedding using conceptualized coordinate mapping method is proposed. It processes n pixel values of an image block as a reference coordinate in n-dimensional space, and searches for the neighborhood set with least square error to constructs the embedding function. The construction of the proposed scheme with three-pixel block (n=3) under various message bases are illustrated in the paper. Experimental results show that the proposed scheme has higher embedding efficiency than that of the APPM.

書名頁 i
授權書 ii
論文口試委員審定書 iii
中文摘要 iv
英文摘要 v
致謝 vi
目錄 vii
表目錄 ix
圖目錄 x
第一章 緒論 1
　　第一節 研究背景與動機 1
　　第二節 研究目的與範圍 3
　　第三節 論文架構 5
第二章 相關研究與技術 6
　　第一節 最不重要位元置換法 6
　　第二節 最佳化像素調整法 7
　　第三節 基於探索像素修改方向法 8
　　第四節 鑽石編碼嵌入法 9
　　第五節 合適像素配對法 11
第三章 研究方法 14
　　第一節 工作原理模介紹 14
　　第二節 範例說明 27
　　第三節 溢位處理 28
第四章 實驗結果 31
　　第一節 實驗環境介紹 31
　　第二節 MSE理論值分析 32
　　第三節 實驗結果 34
第五章 結論與未來研究 38
參考文獻 39

[1] N. F. Johnson and S. Jajodia, “Exploring stegnography：seeing the unseen,” IEEE Computer, vol. 31, no. 2, pp. 26–34, 1998.
[2] J. Fridrich, Steganography in Digital Media：Priciples, Algorithms, and Applications. Cambridge, U.K. ：Cambridge Univ. Press, 2009.
[3] N. Provos and P. Honeyman, “Hide and seek：An introduction to steganography,” IEEE Security Privacy, vol. 3, no. 3, pp. 3244, 2003.
[4] A. Cheddad, J. Condell, K. Curran and P. McKevitt, “Digital image steganography：Survey and analysis of current methods,” Signal Processing, vol. 90, pp. 727752, 2010.
[5] W. Bender, D. Gruhl, N. Morimoto and A. Lu, “Techniques for data hiding,” IBM Systems Journal, vol. 35, no. 3&4, pp. 313336, 1996.
[6] F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, “Information hiding – a survey.” Proceedings of the IEEE, vol. 87, no. 7, pp. 1062–1078, 1999.
[7] S. Katzenbeisser and F. A. P. Petitcolas, “Information hiding techniques for steganography and digital watermarking,” Artech House Book Company.
[8] G. L. Simmons, “The prisoners’ problem and subliminal channels,” Proceedings of Crypto 83, pp. 51–67, 1984.
[9] C.C. Thien and J.C. Lin “A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function,” Pattern Recognition, vol. 36, no. 12, pp. 28752881, 2003.
[10] C.K. Chan and L.M. Cheng, “Hiding data in images by simple LSB substitution,” Pattern Recognition, vol. 37, no. 3, pp. 469474, 2004.
[11] R. Z. Wang, C. G. Lin and J. C. Lin, “Hiding data in images by optimal moderately significant-bit replacement,” Electronics Letters, vol. 36, no 25, pp. 2069–2070, 2000.
[12] R. Z. Wang, C. F. Lin and J. C. Lin, “Image hiding by optimal LSB substitution and genetic algorithm,” Pattern Recognition, vol. 34, no. 3, pp. 671–683, 2001.
[13] C. K. Chan and L. M. Cheng, ”Hiding data in images by simple LSB substitution,” Pattern Recognition, Vol. 37, No. 3, pp. 469–474, 2004.
[14] J. Mielikainen, “LSB Matching revisited,” IEEE Signal Processing Letters, vol. 13, no. 5, pp. 285–287, 2006.
[15] X. Zhang and S. Wang, “Efficient steganographic embedding by exploiting modification direction,” IEEE Communication Letters, vol. 10, no. 11, pp.782–783, 2006.
[16] W. Hong, T. S. Chen and C. W. Shiu, “A minimal Euclidean distance searching technique for Sudoku steganography,” Information Science and Engineering, vol. 1, pp. 515518, 2008.
[17] R.M. Chao, H.C. Wu, C.C. Lee and Y.P. Chu, “A novel image data hiding scheme with diamond encoding,” EURASIP Journal on Information Security, Article ID 658047, pp. 1 9, 2009.
[18] W. Hong and T.S. Chen, “A novel data embedding method using adaptive pixel pair matching,” IEEE Transactions on Information Forensics and Security, vol. 7, no. 1, pp. 176184, 2012.