English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 46833/50693 (92%)
造訪人次 : 11865938      線上人數 : 277
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CCUR管理 到手機版


    請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/26931


    題名: Constructing HVS-Based Optimal Substitution Matrix Using Enhanced Differential Evolution
    作者: Tu, SF (Tu, Shu-Fen)
    Hsu, CS (Hsu, Ching-Sheng)
    貢獻者: 資訊管理學系
    關鍵詞: SIGNIFICANT-BIT SUBSTITUTION
    IMAGE HIDING SCHEME
    HUMAN VISUAL MODEL
    LSB SUBSTITUTION
    ALGORITHM
    OPTIMIZATION
    WATERMARKING
    STRATEGY
    日期: 2013
    上傳時間: 2014-03-03 11:31:19 (UTC+8)
    摘要: Least significant bit (LSB) substitution is a method of information hiding. The secret message is embedded into the last.. bits of a cover-image in order to evade the notice of hackers. The security and stego-image quality are two main limitations of the LSB substitution method. Therefore, some researchers have proposed an LSB substitution matrix to address these two issues. Finding the optimal LSB substitution matrix can be conceptualized as a problem of combinatorial optimization. In this paper, we adopt a different heuristic method based on other researchers' method, called enhanced differential evolution (EDE), to construct an optimal LSB substitution matrix. Differing from other researchers, we adopt an HVS-based measurement as a fitness function and embed the secret by modifying the pixel to a closest value rather than simply substituting the LSBs. Our scheme extracts the secret by modular operations as simple LSB substitution does. The experimental results show that the proposed embedding algorithm indeed improves imperceptibility of stego-images substantially.
    關聯: MATHEMATICAL PROBLEMS IN ENGINEERING Article Number: 824239
    顯示於類別:[資訊管理學系暨資訊管理研究所 ] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML467檢視/開啟


    在CCUR中所有的資料項目都受到原著作權保護.


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