English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90452/105769 (86%)
Visitors : 11962312      Online Users : 863
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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/18453


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


    Title: Lossless Data Embedding with High Embedding Capacity Based on Declustering for VQ-Compressed images
    Authors: 林智揚;Lin, Chih-Yang
    Contributors: 資訊工程學系
    Date: 2007
    Issue Date: 2012-11-26 13:53:47 (UTC+8)
    Abstract: The purpose of data hiding with reversibility property is to recover the original cover media after extracting the hidden data from the stegomedia. In this paper, we propose a reversible data-hiding scheme for embedding secret data in VQ-compressed codes based on the declustering strategy and the similarity property of adjacent areas in a natural image. Two declustering methods are proposed using the minimum-spanning-tree and the short-spanning-path algorithms, respectively. The proposed data-hiding method can achieve the benefits including easy implementation, completely recovering the original compressed codes, and high efficiency of embedding and extraction processes. The experimental results also show that the proposed method has more flexible and higher embedding capacity than other schemes.
    Relation: IEEE Transactions on Information Forensics and Security
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML140View/Open


    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