Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/4878
標題: 應用於數位浮水印系統之改良型籬笆髒紙碼效能分析
Performance Analysis of Modified Dirty Paper Trellis Codes for Digital Watermarking Systems
作者: 李育誠
Lee, Iu-Cheng
關鍵字: watermarking
浮水印
data hiding
trellis
資料隱藏
籬笆結構
出版社: 通訊工程研究所
引用: [1] M. H. M. Costa, “Writing on dirty paper,” IEEE Trans. Inf. Theory,vol. 29, pp. 439-441, 1983. [2] B. Chen, and G. Wornell, “Quantization index modulation: A class of provably good methods for digital watermarking and information embeeding,” IEEE Transcations on Information Theory, vol 47, pp.1423-1433, May 2001. [3] J. Chou, S. Pradhan, and K. Ramchandran, “On the duality between distributed source coding and data hiding,” Conference Record of the Thirty-Third Asilomar Conference. on Signals, Systems, and Computers, vol. 2, 1503-1507, Oct. 1999. [4] M. L. Miller, “Watermarking with dirty-paper codes,” IEEE Int.Conf. on Image processing, vol. 2, 538-541, Oct. 2001. [5] M. L. Miller, G. J. DoAerr, and I. J. Cox, “Dirty-paper trellis codes for watermarking,” IEEE Int. Conf. on Image processing, vol. 2, II-129-II-132, Sept. 2002. [6] 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. [7] C. K. Wang, G. DoAerr, and I. J. Cox, “Toward a better understanding of dirty paper trellis codes," IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, vol. 2, II-233-II-236, May. 2006. [8] C. K. Wang, G. DoAerr, and I. J. Cox, “Trellis coded modulation to improve dirty paper trellis watermarking," Proceedings of SPIE, vol. 6505, pp. 65050G, 2007. [9] Y. Sun, M. Uppal, A. Liveris, S. Cheng, V. Stanković, and Z. Xiong, “Nested turbo codes for the Costa problem," IEEE Trans. Commum., vol. 56, no. 3, pp. 388-399, Mar. 2008. [10] G. Ungerboeck, “Channel coding with multilevel/phase signals,”IEEE Transactions on Information Theory, vol. 28, pp. 55-67, Jan.1982. [11] M. W. Marcellin, and T. R. Fischer, “Trellis coded quantization of memoryless and Gauss-Markov sources,” IEEE Trans. Commun.,vol. 38, pp. 82-93, Jan. 1990. [12] G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973. [13] S. Lin, and D. J. Costello. Jr, “Error Control Coding, 2nded”, Prentice Hall, 2004.
摘要: 數位浮水印是髒紙碼(Dirty-paper code)的一種應用。浮水印是指將訊息嵌入載體中,不但需讓人感覺不出載體的變化,且須確保當影像在傳送過程經過通道或遭受他人惡意攻擊時,仍能取回隱藏訊息。本篇論文中,我們提出一種改良型的數位浮水印嵌入系統。這個系統以改良型籬笆結構碼來進行數位浮水印的嵌入,將1585個位元藏入一張512 x 512像素大小的影像,在籬笆結構上的每條分支,我們不使用高斯分佈隨機亂數來標記,改而使用線性區塊碼(Linear block code),再利用籬笆結構的解碼演算法來決定我們所要嵌入的浮水印,在以上條件控制下,我們可以調整浮水印強度跟嵌入後的影像品質。 在模擬實驗中,我們使用籬笆結構跟線性區塊碼的配合,更進一步對線性區塊碼做適當分割(Partition)後,標在記籬笆結構的分支上,在不同通道攻擊之下,改良型的籬笆結構碼仍然可以達到較好的位元錯誤率效能。
Digital watermarking is application of Dirty-paper code. 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. In this paper, we propose a modified digital watermarking system. This system is embedded the watermark with a modified trellis code. We use a 512 x 512 pixels image to embed 1585 bits. In stead of Gaussian distribution random code, we use linear block code to label each arcs in trellis structure, and then identify the desired watermark by the decoding algorithm of trellis code. In above condition, we can adjust the robustness of watermark and the fidelity of the embedded image. In our simulation, we use the cooperation of trellis structure and linear block code. Furthermore, we partition the linear block code appropriately before we label codeword on each branch of trellis. Through different channel attacks, the modified trellis code still has better bit error rate performance.
URI: http://hdl.handle.net/11455/4878
其他識別: U0005-1507201015562100
文章連結: http://www.airitilibrary.com/Publication/alDetailedMesh1?DocID=U0005-1507201015562100
Appears in Collections:通訊工程研究所

文件中的檔案:

取得全文請前往華藝線上圖書館



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