English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4054257      Online Users : 814
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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/79628


    Title: Reversible Data Hiding Using Prediction-based Adaptive Embedding
    Authors: Huang, Hsiang-cheh;Chen, Yueh-hong;Chang, Feng-cheng;Li, Sheng-hong
    Contributors: 淡江大學資訊創新與科技學系
    Keywords: Reversible data hiding;Multi-level embedding;Prediction;Image quality;Capacity;Side information
    Date: 2012-12-20
    Issue Date: 2012-12-26 13:15:08 (UTC+8)
    Publisher: Springer
    Abstract: In this paper, we propose a new algorithm in reversible data hiding with prediction-based scheme. Reversible data hiding can be implemented with two types, one is by modifying the histogram of images, named the histogram-based scheme, and the other is by changing the difference value between neighboring pixels, called the difference-expansion-based (DE-based) method. Considering the ease of implementation, we employ the histogram-based scheme as the base, integrated with the DE-based methods, which is famous for the abundance in embedding capacity, in our algorithm. For hiding the secret information, the differences between original and predicted images are produced firstly, and they are intentionally altered to make reversible data hiding possible. By utilizing the advantages from the two types of methods, by change of histograms of difference values, global and local characteristics of original images can be utilized for hiding more capacity with acceptable quality of output image. With our method, it performs better in embedding capacity, image quality, and side information than conventional algorithm in literature. It also has the potential for the integration to relating algorithms for practical applications.
    Appears in Collections:[資訊創新與科技學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    IWUCA2012-Proceeding-file-098.pdf7KbAdobe PDF491View/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