Please use this identifier to cite or link to this item:
標題: 里得米勒碼應用於資料藏匿技術之探討
Study of Data Hiding Techniques With Reed Muller Codes
作者: 張建斌
Chang, Jian-Bin
關鍵字: 里得米勒碼;Reed Muller Codes;線性區塊碼;資料藏匿;Linear Block Codes;Data Hiding
出版社: 通訊工程研究所
引用: [1] C.E. Shannon, “ A Mathematical Theory of Communication,” Bell Syst. Tech. J., 27:379-423, July 1948. [2] R. Crandall, Some Notes on Steganography, 1998. posted on stegano-graphy Mailing List. [3] F. Galand and G. Kabatiansky, “Information hiding by covering,” in Proc. ITW2003, Paris, France, 2003, pp. 151–154. [4] J. Fridrich and D. Soukal, “Matrix embedding for large payloads,” IEEE Trans. Inform. Forens. Sec., vol. 1, no. 3, pp. 390–395, Sep. 2006. [5] J. Fridrich, “Minimizing the embedding impact in steganography,” in Proc. of the 8th ACM workshop on Multimedia and security, pp. 2–10, Sep. 2006. [6] J. Fridrich, P. Lisonek, and D. Souka, “On steganographic embedding effciency,” in Proc. 8th Inf. Hiding Workshop, ser. Lecture Notes in Computer Science. Alexandria, VA: Spring, Jul. 10–12, 2006. [7] W. Zhang, S. Wang, and X. Zhang, “Improving embedding efficiency of covering codes for applications in steganography,” IEEE Commun. Lett., vol. 11, pp. 680–682, Aug. 2007. [8] J. Fridrich and T. Filler, “Practical methods for minimizing embedding impact in steganography,” in Proc. SPIE Electron. Imaging, vol. 66, pp. 1–15, Jan. 2007. [9] M. J. Wainwright, “Sparse graph codes for side information and binning,” IEEE Signal Processing Mag., vol. 24, no 5, pp. 47-57, Sep. 2007. [10] Z. X. Qian, X. P. Zhang and S. Z. Wang, “Matrix Selection in High Payload Embedding,” in Proc. IIH-MSP2009, pp. 328–331, Sep. 2009. [11] C. Wang, W. Zhang, J. Liu, and N. Yu,“Fast Matrix Embedding by Matrix Extending,” IEEE Trans. Inf. Theory, vo7. 1, no. 1, pp. 346–350, Feb. 2012 [12] Y. K. Gao, X. L. Li and B. Yang, “Constructing specific matrix for efficient matrix embedding,” in Proc. ICME2009, pp. 1006–1009, 2009. [13] I. S. Reed,“A class of multiple error correcting codes and the decoding scheme,”IEEE Trans. Inf. Theory, vol. IT-4, no. 4, pp. 38-49, Sep. 1954. [14] R. E. Krichevskiy,“On the number of Reed-Muller code correctable errors,”Dokl. Sov. Acad. Sci., vol. 191, pp. 541–547, 1970. [15] S.N.Litsyn,“On decoding complexity of low-rate Reed-Muller codes,”in Proc. 9th All-Union Conf. Coding Theory and Information Transmission, Odessa, Ukraine, U.S.S.R., 1988, pp. 202–204. in Russian. [16] K.G.Paterson and Alan E. Jones, “Efficient decoding algorithms for generalized Reed-Muller Codes,”IEEE Trans. Commun.,vol.48,no.8,pp.1272-1285, Aug 2000.
In this study, we use Linear Block Codes: Reed Muller codes for binary data hiding algorithm. The main principle is to find a vector which has the same syndrome as the select combination of collection which is the closest to the host. Finally, the purpose is to achieve high embedding efficiency and low distortion .
Then we make use of iteration and factor graph to modify Reed decoding algo- rithm. It can make a balance between decoding complexity and embedding efficiency. According to the experimental results, although the complexity will increase slightly , however, the goal of increase embedding efficiency can be achieved by using the methods.

本篇論文是利用線性區塊碼:里得米勒碼(Reed Muller codes)運用在二元資料藏匿上,其主要原理是在一組具有相同徵狀的向量集合裡找到一個最接近載體的向量碼,目的就是為了達到高藏匿效率以及低失真度。
其他識別: U0005-1807201314550200
Appears in Collections:通訊工程研究所

Show full item record
TAIR Related Article

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.