基於圖形方式之奇偶校驗的低複雜度資料隱藏演算法

Low-complexity Data Hiding Algorithms with Graph-based Parity Check

黃俊穎(Jyun-Ying Huang)

指導教授 ： 黃育銘

國立暨南國際大學/科技學院/資訊工程學系/碩士(2013年)

摘要

本文介紹兩種於灰階影像上基於圖型同位元檢查的低複雜度資料隱寫演算法。這兩種算法可將n個位元秘密嵌入n+1或n個像素。根據這兩種演算法的性能給出了理論平均失真率的分析。演算法1可以用最少的1的個數下的基於圖型同位元檢查運算模型生成最佳的切換序列。演算法2可以進一步增強嵌入率和由+/-1資料隱寫技術的嵌入算法的效率。理論失真分析表明，這兩種算法都優於其他方案。

關鍵字

資料隱藏 ； 基於樹狀結構同位元檢查 ； +/-1隱寫技術 ； 嵌入率 ； 嵌入效能

並列摘要

This paper presents low-complexity steganographic algorithm based on the proposed graph-based parity check methodology for gray-scale images. Both algorithms embed a segment of n secret bits into n+1 and n cover pixels, respectively. The performances of both algorithms are given by theoretical distortion analysis. Algorithm1 can generate an optimal toggle sequence with the least number of 1’s under the graph-based parity check model. Algorithm 2 can further enhance the embedding rate and the embedding efficiency of Algorithm1 by the technique of +/-1 steganography. The theoretical distortion analyses show that both algorithms are better than the other schemes.

並列關鍵字

data hiding ； tree-based parity check ； +/-1 steganography ； embedding rate ； embedding efficieiency

參考文獻

[1 ] R. Crandall, “Some notes on steganograph,” http://of.inf.tu-duresden.de/~westfeld/

crandall.pdf, 1998.

[2 ] X. Zhang and S. Wang, “Efficient steganographic embedding by exploiting modification direction,” IEEE Communications Letters, vol. 10, no. 11, pp.781-783, Nov. 2006.

[3 ] R. Y. M. Li, O. C. Au, K. K. Lai, C. K. Yuk, and S.-Y. Lam, “Data hiding with tree based parity check,” in Proc. IEEE Int. Conf. Multimedia and Expo, Beijing, China, Jul. 2-3, 2007, pp. 635–638.

[4 ] Chung-Li Hou, Chang-Chun Lu, Shi-Chun Tsai and Wen-Guey Tzeng,“An optimal data hiding scheme with tree-based parity check,” IEEE Trans. Image Processing, vol. 20, no. 3, Mar. 2011, pp. 880–886