博碩士論文 995302013 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:21 、訪客IP:18.119.106.114
姓名 金冠媛(Kuan-Yuan Jin)  查詢紙本館藏   畢業系所 資訊工程學系在職專班
論文名稱 植基於相鄰像素差值直方圖位移之可逆式資訊隱藏技術
(A Reversible Data Hiding Scheme Based on Histogram Shifting Using Adjacent Pixel Difference)
相關論文
★ 以伸展樹為基礎的Android Binder Driver★ 應用增量式學習於多種農作物判釋之研究
★ 應用分類重建學習偵測航照圖幅中的新穎坵塊★ 用於輔助工業零件辨識之尺寸估算系統
★ 使用無紋理之3D CAD工業零件模型結合長度檢測實現細粒度真實工業零件影像分類★ 一個建立在平行工作系統上的動態全球計算平台
★ 用權重參照計數演算法執行主動物件垃圾收集★ 一個動態負載平衡之最大可能性估算計算架構
★ 利用多項系統負載資訊進行動態P2P系統重組的策略研究★ 基於Hadoop系統的雲端應用程式特徵擷取與計算監測架構
★ 適用於大型動態分散式系統的調適性計算模型★ 一個提供彈性虛擬資料中心的雲端服務平台
★ 雲端彈性虛擬機房服務平台之資源控管中心★ 一個適用於自動供應雲端系統的動態調適計算架構
★ 線性相關工作與非相關工作的探索式排程策略★ 適用於大資料集高效率的分散式階層分群演算法
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 資訊隱藏(Data Hiding)為一種將機密訊息藏入媒體檔案中的方法,它可以將資料藏於檔案中而且傳送過程中不易被察覺有異的一種方法。接收端在收到偽裝檔案後,它可以透過其特定方法擷取傳送端藏入的機密訊息。若取出藏入訊息外也能將原始媒體檔案還原,即為可逆式的資訊隱藏(Reversible Data Hiding)方法。直方圖位移技術(Histogram Shifting Technique)是一種可逆式的影像資訊隱藏方法,這個方法利用像素統計直方圖中的峰點和零點位置,進行部分像素值的位移來隱藏機密訊息於影像中。回復時,採用反向方法,取出機密訊息外也能還原原始統計直方圖來還原原始影像。
本篇論文主要介紹一個用於資訊匿蹤的可逆式資訊隱藏技術。這個技術利用影像中的每一組 2×2 像素區塊內具有接近像素值的特色,進行兩階段的像素差值運算,並搭配直方圖位移技術來隱藏機密資訊。在第一階段的運算中,它利用兩兩相鄰像素差值進行直方圖位移技術隱藏第一部分的機密資訊; 第二階段,它選取 2×2 像素區塊內兩兩相鄰像素中的大數差值進行直方圖位移技術隱藏第二部分的機密資訊。其中第一階段因為有較多的像素差值,可以隱藏較多資訊,而第二階段為了還原部分因第一階段改變的像素差值,採用反向運算的技術,這種技術除了隱藏資訊外也能降低偽裝影像的失真率。因為在嵌入機密資訊的過程中,我們的方法一直維持著 2×2 像素區塊內像素值大者恆大、 小者恆小的結果,因此擷取機密資訊且還原原始影像的步驟即為嵌入機密資訊方法的反向操作。從實驗數據來看,我們跟過去文獻所提出的方法比較起來具有較佳的影像品質與資訊藏量。
摘要(英) Data hiding is a study of embedding secret data into cover media to produce a stego-media object, such that no one suspects the existence of the hidden data in the stego-media object. A data hiding method is reversible if the method can extract the secret data from the stego-media that is encoded by the method, and meanwhile, recover the cover media without any distortion. Histogram shifting technique is one of the reversible data hiding schemes that can be applied to image data hiding. It provides stego-images of good visual quality and high embedding capacity. In this technique, the pixel values between a pair of peak and zero points of the histogram are shifted or modified for data embedding, where the pair of peak and zero points are utilized to extract the embedding data and to recover the cover image completely.
This paper presents a reversible data hiding scheme, which can embed secret bits into a cover image to produce a stego-image, and recover the cover image and the hidden secret bits from the stego-image. It is inspired by the fact that the pixel values in each block of 2×2 pixels are similar in a natural image. Both the embedding and the extraction procedures of the proposed scheme consist of two phases. The first phase uses the differences between neighboring pixel values and the histogram shifting technique to embed secret bits. The second phase identifies the largest pixel of each 2×2 block, and uses difference embedding and histogram shifting to embed secret bits. The input of the first phase tends to have more rooms (differences) to embed secret bits, and the output of the first phase creates an image of 2×2 blocks of larger neighboring differences. The second phase aims to use the opposite operations against the first phase to minimize some differences of the neighboring pixels in a 2×2 image block. The invariant of the proposed scheme is that, the maximum pixel and the minimum pixel in each block always remain the largest and the smallest respectively, during the embedding procedure. With the invariant, the extraction procedure can extract the secret bits and recover the original cover image from the stego-image by the reverse operations of the embedding procedure. The experimental results indicate that our scheme achieves better visual quality and higher embedding capacity than other schemes proposed by prior similar studies.
關鍵字(中) ★ 可逆式資訊隱藏
★ 直方圖位移
★ 影像品質
關鍵字(英) ★ Reversible data hiding
★ Histogram shifting
★ Visual quality
論文目次 中文摘要..................................................i Abstract.................................................ii
目錄.....................................................iv
圖目錄...................................................vi
表目錄...................................................vii
一、緒論.................................................. 1
1-1前言................................................ 1
1-2研究背景............................................ 2
1-2-1 空間域........................................ 2
1-2-2 頻率域........................................ 2
1-2-3 壓縮域........................................ 3
1-3研究動機............................................ 3
1-4論文架構............................................ 3
二、文獻探討 .............................................. 5
2-1 Ni 等學者的方法..................................... 5
2-2 Zhao 等學者的方法................................... 5
2-3 Wang 與 Hsiang 學者的方法 .......................... 7
2-4 Lee 與 Chen 學者的方法 ............................. 9
三、研究內容與方法 ........................................ 11
3-1 方法特性 .......................................... 11
3-2 嵌入機密資訊 ...................................... 13
3-3 擷取機密資訊 ...................................... 18
3-4 嵌入機密資訊範例 ................................... 23
3-5 擷取機密資訊範例 ................................... 27
四、實驗結果與分析 ........................................ 31
4-1 實驗環境 .......................................... 31
4-2 實驗介紹 .......................................... 31
4-3 實驗結果 .......................................... 33
4-4 實驗分析與討論 .................................... 35
五、結論 ................................................ 41
參考文獻 ................................................ 42
參考文獻 [1] M. Willett, “Cryptography old and new,” Computers & Security, vol. 1, no. 2, pp. 177–186, 1982.
[2] W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644 – 654, 1976.
[3] S. Farrell, “Applications directly using cryptography,” IEEE Internet Computing, vol. 14, no. 3, pp. 84 –87, 2010.
[4] W. Bender, D. Gruhl, N. Morimoto, and A. Lu, “Techniques for data hiding,” IBM Systems Journal, vol. 35, no. 3, pp. 313–336, 1996.
[5] M.Fallahpour, D.Megias, andM.Ghanbari, “Subjectively adapted high capacity lossless image data hiding based on prediction errors,” Multimedia Tools and Applications, vol. 52, no. 2, pp. 513–527, 2011.
[6] O.M. Al-Qershi and B.E. Khoo, “High capacity data hiding schemes for medical images based on difference expansion,” Journal of Systems and Software, vol. 84, no. 1, pp. 105–112, 2011.
[7] W.J. Wang, C.T. Huang, and S.J. Wang, “VQ applications in steganographic data hiding upon multimedia images,” IEEE Systems Journal, vol. 5, no. 4, pp. 528 –537, 2011.
[8] Z. Ni, Y. Q. Shi, N. Ansari, and W. Su, “Reversible data hiding,” IEEE Trans. Circuits Syst. Video Technol., vol. 16, no. 3, pp. 354–362, Mar. 2006.
[9] C.H. Yang and M.H. Tsai, “Improving histogram-based reversible data hiding by interleaving predictions,” IET Image Processing, vol. 4, no. 4, pp. 223–234, 2010.
[10]Z. Zhao, H. Luo, Z.M. Lu, and J.S. Pan, “Reversible data hiding based on multilevel histogram modification and sequential recovery,” AEU - International Journal of Electronics and Communications, vol. 65, no. 10, pp. 814–826, 2011.
[11]C.T. Wang and F.Y. Hsiang, “A Markov-based reversible data hiding method based on histogram shifting,” Journal of Visual Communication and Image Representation, vol. 23, no. 5, pp. 798–811, 2012.
[12] D.C. Lou, C.L. Chou, H.K. Tso, and C.C. Chiu, “Active steganalysis for histogram-shifting based reversible data hiding,” Optics Communications, vol. 285, no.10–11, pp. 2510–2518, 2012.
[13]C.F. Lee and H.L. Chen, “Adjustable prediction-based reversible data hiding,” Digital Signal Processing, vol. 22, no. 6, pp. 941-953, 2012.
[14]H.C. Huang and F.C. Chang, “Hierarchy-based reversible data hiding,” Expert Systems with Applications, vol. 40, no. 1, pp. 34-43, 2013.
[15]X.T. Wang, C.C. Chang, T.S. Nguyen, and M.C. Li, “Reversible data hiding for high quality images exploiting interpolation and direction order mechanism,” Digital Signal Processing, vol. 23, no. 2, pp. 569-577, 2013.
[16]S. Bhattacharyya and G. Sanyal, “Data hiding in images in discrete wavelet domain using PMM,” World Academy of Science, Engineering and Technology, vol. 68, pp. 597-605, 2010.
[17]C.C. Chang, P.Y. Pai, C.M. Yeh and Y.K. Chan, “A high payload frequency-based reversible image hiding method,” Information Sciences, vol. 180, no. 11, pp. 2286-2298, 2010.
[18]D. Bhattacharyya and T.H. Kim, “Image data hiding technique using discrete fourier transformation,” Ubiquitous Computing and Multimedia Applications Communications in Computer and Information Science, vol. 151, pp. 315-323, 2011.
[19]Y.K. Lin, “High capacity reversible data hiding scheme based upon discrete cosine transformation,” Journal of Systems and Software, vol. 85, no. 10, pp. 2395-2404, 2012. [20]C. C. Chang and W.C. Wu, “A reversible information hiding scheme based on vector quantization,” Knowledge-Based Intelligent Information and Engineering Systems, Lecture Notes in Computer Science, vol. 3683, 2005.
[21]C.C. Chang and T.D. Kieu, “A reversible data hiding scheme using complementary embedding strategy,” Information Sciences, vol. 180, no. 16, pp. 3045-3058, 2010.
[22]J.D. Lee and Y.H. Chiou, “Reversible data hiding based on histogram modification of SMVQ indices,” Industrial Informatics (INDIN), 2010 8th IEEE International Conference on, pp. 466-471, 2010.
[23]C.C. Lin and X.B. Zhang, “A high capacity reversible data hiding scheme based on SMVQ,” Genetic and Evolutionary Computing (ICGEC), 2012 6th International Conference on, pp. 169-172, 2012.
[24]C.C. Chang, T.S. Nguyen, and C.C. Lin, “A novel VQ-based reversible data hiding scheme by using hybrid encoding strategies,” Journal of Systems and Software, vol. 86, no. 2, pp. 389-402, 2013.
指導教授 王尉任(Wei-Jen Wang) 審核日期 2013-7-22
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明