English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90069/105176 (86%)
Visitors : 6369490      Online Users : 564
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/111938

    Title: Finding an Optimal Disturbed Square Matrix Using Dynamic Programming Strategy for Steganography
    Authors: 詹啟祥;Chan, Chi-Shiang;蔡淵裕;Tsai, Yuan-Yu
    Contributors: 行動商務與多媒體應用學系
    Date: 2018-11
    Issue Date: 2019-09-02 15:15:51 (UTC+8)
    Abstract: The purpose of this paper finds an optimal disturbed square matrix for steganography. The method is inspired from square matrix encoding (SME). SME obtains stego images by embedding secret data into cover images through the square matrix. To improve security and image quality, dynamic programming strategy is applied to disturb the digits in the square matrix on the basis of a given cover image and secret data. Through the disturbed square matrix, the stego images with the best image quality can be obtained. Moreover, the embedded data can not be extracted without the corresponding disturbed square matrix. Therefore, the security of the embedding mechanism can be improved. The experimental results show that the proposed method is superior to the other related methods.
    Relation: Journal of Internet Technology
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in ASIAIR are protected by copyright, with all rights reserved.

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