簡易檢索 / 詳目顯示
| 研究生： |
許育僑 Yu-chiao Hsu |
|---|---|
| 論文名稱： |
利用動態規劃來達到可逆式資料隱藏法的最大隱藏容量 Capacity maximization for reversible data hiding based on dynamic programming approach |
| 指導教授： |
鍾國亮
Kuo-liang Chung 楊維寧 Wei-ning Yang |
| 口試委員: |
陳雲岫
none |
| 學位類別： |
碩士 Master |
| 系所名稱： |
管理學院 - 資訊管理系 Department of Information Management |
| 論文出版年： | 2007 |
| 畢業學年度： | 95 |
| 語文別： | 中文 |
| 論文頁數： | 26 |
| 中文關鍵詞： | 最大隱藏容量 、動態規劃 、浮水印 、資料隱藏 |
| 外文關鍵詞： | Capacity maximization, reversible (lossless) data hiding |
| 相關次數： | 點閱：208 下載：4 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
最近，Ni等人提出一個有效率的可逆式的資料隱藏法，他的演算法不但能恢復原始影像，而且它的PSNR也比其他的可逆式資料隱藏法還高。我們提出改良一個可逆式資料隱藏的演算法來達到最大隱藏容量的需求，而不是過去Ni等人所提出的貪婪式的演算法，我們利用動態規劃來最佳化峰頂和峰谷的最大隱藏容積的配對。在相同的CorelDraw X3測試圖像下，實驗結果證實在相同的影像品質下，我們提出的方法比原方法平均提升為2%比率的隱藏容量。
Recently, an efficient reversible data hiding algorithm by Ni et al. was presented. Their algorithm can recover the original image without any distortion and its PSNR lower bound is higher than that of all existing reversible data hiding algorithms. Based on dynamic programming approach, this paper presents an improved data hiding algorithm which achieves the capacity maximization requirement. Under the CorelDraw X3 testing images, experimental results demonstrate that our proposed improved data hiding algorithm has maximal capacity improvement ratio, 2%, and has same image quality when compared to the previous algorithm by Ni et al.
[1] J. Cox, J. Kilian, T. Leighton, and T. Shamoon, “Secure spread spectrum watermarking for multimedia,” IEEE Trans. Image processing, vol. 6, no. 12, pp. 1673–1687, Dec. 1997.
[2] A. Z. Tirkel, C. F. Osborne, and R. G. Van Schyndel, “Image watermarking–a spread spectrum application,” in Proc. IEEE 4th Int. Symp. Spread Spectrum Techn. Applicat., vol.2, pp. 785–789, Dec. 1997.
[3] L. M. Marvel, C. G. Jr. Boncelet. and C. T. Retter, “Spread spectrum image steganography,” IEEE Trans. Image Processing, vol. 8, no. 8, pp. 1075–1083, Aug. 1999.
[4] M. Gkizeli, D. A. Pados, and M. J. Medley, “Embedding image watermarks in DC component,” IEEE Trans. Circuits and system for Video Technolgy, vol. 16, no. 2, pp. 391–405, Feb. 2007.
[5] J. Irvine and D. Harle, Data Communications and Networks: An Engineering Approach, Wiley, New York, 2002.
[6] S. L. Li, K. C. Leung, L. M. Cheng and C. K. Chan, “Data hiding in images by adaptive LSB substitution based on the pixel-value differencing,” Innovative Computing, Informationand Control., vol. 3, 30-01, pp. 58–61, Aug. 2006.
[7] R. Liu and T. Tan, “An SVD-based watermarking scheme for protecting rightful ownership,” IEEE Trans. Multimedia, vol. 4, no. 1, pp. 121–128, Mar. 2002.
[8] K. L. Chung, C. H. Shen and L. C. Chang, “A novel SVD- and VQ-based image hiding scheme,” Pattern Recognition Letters, vol. 22, no. 9, pp. 1051–1058, July 2001.
[9] M. Jo and H. D. Kim, “A digital image watermarking scheme based on vector quantization,” IEICE Trans. Information and system, vol. E85-D, no. 6, pp.1054–1056, Jun. 2002.
[10] W. Honsinger, P. Jones, M. Rabbani, and J. C. Stoffel, Lossless recovery of an original image containing embedded data, US Patent, 6,278,791, 2001.
[11] B. Macq and F. Deweyand, “Trusted headers for medical images,” in Proc. DFG VIII-D II Watermarking Workshop, Erlangen, Germany, Oct. 1999.
[12] J. Fridrich, M. Goljan and R. Du, “Invertible authentication,” in Proc. SPIE , Security and Watermarking of Multimedia Contents, San Jose, CA, pp. 197–208, Jan. 2001.
[13] Z. Ni, Y.Q. Shi, N. Ansari and W. Su, “Reversible data hiding,” IEEE Trans. Circuits and Systems for Video Technology, vol. 16, no. 3, pp. 354–362, Mar. 2006.
[14] C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New Jersey, 1982.
