Please use this identifier to cite or link to this item:
標題: 使用單工碼與哈達碼應用於籬笆知情編碼之數位浮水印
Trellis-Based Informed Coding With Simplex and Hadamard Codes for Digital Watermarking
作者: 陳柏霖
Chen, Bo-Lin
關鍵字: informed coding;知情編碼;digital watermarking;robust;數位浮水印;強健性
出版社: 電機工程學系所
引用: [1] M. L. Miller, G. J. DoAerr, and I. J. Cox, "Dirty-paper trellis codes for watermark," IEEE Int. Conf. Image Processing, vol. 2, pp. II-129-II-132, 2002. [2] M. L. Miller, G. J. DoAerr, and I. J. Cox, "Applying informed coding and embedding to design a robust high-capacity watermark," IEEE Trans. Image Process., vol. 13, no. 6, pp. 792-807, Jun. 2004. [3] R. Barron, B. Chen, and G. W. Wornell, "The duality between informatino embedding and source coding with side informatino and some applicaitons," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1159-1180, May 2003. [4] S. S. Pradhan, J. Chou, and K. Ramchandran, "Duality bewteen source coding and channel coding and its extension to the side information case," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1181-1203, May 2003. [5] R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multierminal binning," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002. [6] M. J. Wainwright, "Sparse graph codes for side information and binning," IEEE Signal Processing Mag., vol. 24, no. 5, pp. 47-57, Sep. 2007. [7] M. L. Miller, I. J. Cox, and J. A. Bloom, "Informed embedding:exploiting image and detector information during watermark insertion," in IEEE Int. Conf. on Image Processing, Sep. 2000. [8] L. Lin, G. DoAerr, I. Cox, and M. Miller, "An e±cient algorithm for informed embedding of dirty-paper trellis codes for watermarking," in Proc. IEEE Int. Conf. Image Processing, Italy, 2005. [9] C. K. Wang, G. DoAerr, I. J. Cox, "Toward a better understanding of dirty paper trellis codes," IEEE Int. Conf. Image Processing, vol. 2, pp. II233-II236, 2006. [10] G. D. Forney, "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973. [11] I. J. Cox, M. L. Miller, and A. McKellips, "Watermarking as communications with side information," Proc. IEEE, vol. 87, pp. 1127-1141, Jul. 1999. [12] Y. Sun, Y. Yang, A. D. Liveris, V. Stankovic, and Z. Xiong, "Near-capacity dirty-paper code design: a source channel coding approach," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3013-3031, Jul. 2009. [13] D. Kundeur and D. Hatzinakos, "Digital watermarking for telltale tamper proofing and authentication," Proc. IEEE, vol. 87, no. 7, pp. 1167-1180, Jul. 1999. [14] F. Bartolini, A. Tefas, M. Barni, and I. Pitas, "Image authentication techniques for surveillance applications," Proc. IEEE, vol. 89, no. 10, pp. 1403-1418, Oct. 2001. [15] E. Martinian and G. W. Wornell, "Authentication with distortion constraints," in Proc. IEEE Int. Conf. Image Processing, pp. 17-20, 2002. [16] I. J. Cox, M. L. Miller, and J. A. Bloom, Digital Watermarking, New York: Morgan Kaufmann, 2001. [17] M. H. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. 29, pp. 439-441, 1993. [18] D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1897-1905, 1998. [19] P. Moulin and R. Koetter, "Data-hiding codes," Proc. IEEE, vol. 93, no. 12, pp. 2083-2126, Dec. 2005. [20] J. A. Bloom, I. J. Cox, T. Kalker, J.-P. M. G. Linnartz, M. L. Miller, and C. B. S. Traw, "Copy protection for digital video," Proc. IEEE (Special Issue on Identification and Protection of Multimedia Information), vol. 87, no. 7, pp. 1267-1276, Jul. 1999.
浮水印的應用是指將所要的訊息嵌入載體中,需要讓人感覺不到載體的改變,且在傳送時經過通道干擾或有人蓄意的破壞時,都還是能取出我們所隱藏的訊息。 本論文中,我們提出建構於籬笆結構上之知情數位浮水印,將知情編碼與知情嵌入這兩方面來作結合及探討,在知情編碼方面,系統架構結合了迴旋碼籬笆結構與線性區塊碼,且改良籬笆結構上的分支形成平行分支,也使用線性區塊碼取代迴旋碼,在知情嵌入方面我們提出兩種演算法,此演算法可在512x512大小的灰階圖上嵌入1536個位元的訊息,且我們比較不同演算法在固定失真度下模擬不同的影像攻擊,如高斯雜訊、失真壓縮攻擊、縮放係數、低通濾波等,從模擬結果可發現我們提出之演算法其強健性幾乎都優於Miller所提出的方法。

Watermarking that means we embed some information in host, and make distortion of host is unobservable, and we can get the embedded complete information even if the host is influenced by channel or attack.This paper proposes a informed watermarking based on trellis structure, and combine informed coding with informed embedding .We modified parallel trellis structure in informed coding.These algorithms employ the codewords of linear block code to label the arcs in the convolutional trellis.We present two informed embedding algorithms for watermarking system. These algorithms are capable of embedding 1536 bits of message in an gray-level image of size 512x512 pixels. With this characteristic, we can easily adjust the fidelity and robustness of watermarked images by some controllable parameters. We report the robustness and complexity performance of these algorithms under the fixed fidelity in comparison with Miller''s. And we show the robustness results in Gaussian noise, lossy compression, low-pass filer and valumetric scaling. Moreover, the proposed algorithms has better BER erformance compared with Miller''s.
其他識別: U0005-2207201121144000
Appears in Collections:電機工程學系所

Show full item record

Google ScholarTM


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