English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51897/87065 (60%)
Visitors : 8468012      Online Users : 172
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/96143


    Title: Hierarchy-based reversible data hiding
    Authors: Huang, Hsiang-Cheh;Chang, Feng-Cheng
    Contributors: 淡江大學資訊創新與科技學系
    Keywords: Reversible data hiding;Hierarchical structure;Histogram;Quad;Image quality;Capacity
    Date: 2013-01
    Issue Date: 2014-03-05 07:55:42 (UTC+8)
    Publisher: Kidlington, Oxford: Pergamon Press
    Abstract: In this paper, we propose a new method for reversible data hiding by employing the hierarchical relationships of original images. There are many parameters for accessing the performances of reversible data hiding algorithms, including the output image quality, the hiding capacity, and the overhead for decoding. Considering the ease of implementation and the little overhead needed for decoding, we employ modification of difference values between pixels by using histogram-based scheme with extensions to pyramidal structure by utilizing inherent characteristics of original images. By doing so, global and local characteristics of original images can be utilized for hiding more capacity with acceptable quality of output image. With our method, better performances can be obtained with enhanced image quality, the more embedding capacity, and comparable amount of side information for decoding. More importantly, the reversibility of our method is guaranteed, meaning that original image and hidden message can both be perfectly recovered at the decoder. Simulation results demonstrate that proposed method in this paper outperforms those in conventional algorithms.
    Relation: Expert Systems with Applications 40(1), pp.34-43
    DOI: 10.1016/j.eswa.2012.07.010
    10.1016/j.eswa.2012.07.010
    Appears in Collections:[資訊創新與科技學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML257View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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