ASIA unversity:Item 310904400/7044
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 90429/105609 (86%)
造訪人次 : 10285967      線上人數 : 134
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    題名: The Study of Data Hiding Scheme Based on Vector Quantization and Table Lookup
    作者: Chun-Sheng Liao
    貢獻者: Department of Information Science and Applications
    關鍵詞: Data Hiding;Vector Quantization;Principal Component Analysis;Clusters;Pseudo Random Number Generator;Block Truncation Coding
    日期: 2008
    上傳時間: 2010-01-05 14:20:14 (UTC+8)
    摘要: The increasing popularity of multimedia network technology, data transmission on the Internet becomes very easy and convenient. However, the pubic channel does not secure enough because digital data transmission on the public network is very easy to be modified, intercepted, and copied. Even though traditional cryptography schemes can provides very good security, however as an encrypted data normally reveals the importance of its content. The encrypted data might also attract the interest by hackers. To provide a secure transmission, data hiding becomes an important issue. Data hiding or called Steganography is a kind of camouflage approach which can provide a secure transmission. Data hiding differs from traditional cryptography schemes, in that it embeds secret information into normal host media such as images, music, and texts. It can decrease the suspect of the interest by the hackers because the embedded media does not look like it has valuable.
    In this thesis, we have proposed three data-hiding schemes. The first proposed scheme is based on the VQ encoding and the principal component analysis. The principal component analysis is used to reorder VQ codewords, and then to spilt them into two cluster groups. To decrease the reconstructed image quality, the codewords uniform selection is also provided. The second scheme uses the concept of the table lookup which partitions gray-level colors into several groups or called clusters. Each cluster is given a unique value by a pseudo random number generator with a known seed. Secret bits are then embedded into the selected groups. To increase the data security, a seed of the pseudo random number generator must be changed at each time for decreasing the possible detection. The third data hiding scheme is based on block truncation coding (BTC) scheme and the concept of pixels clustering. The proposed scheme utilities two reconstructed values and one bitmap of each BTC block to hide secret data. Two reconstructed values for each block uses the second proposed data hiding scheme to hide secret data On the other hand, for the binary bitmap, the Hamming code is applied to each binary bitmap of BTC blocks for increasing the hiding capacity.
    顯示於類別:[行動商務與多媒體應用學系] 博碩士論文


    檔案 描述 大小格式瀏覽次數


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋