勤益科大機構典藏:Item 987654321/7246
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 2928/5721 (51%)
Visitors : 385959      Online Users : 145
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://ir.lib.ncut.edu.tw/handle/987654321/7246


    Title: A Robust Informed Embedding with Low Complexity for Digital Watermarking
    Authors: 林基源
    Contributors: 資訊工程系
    Date: 2012-10
    Issue Date: 2018-05-24 09:17:28 (UTC+8)
    Abstract: This paper presents three novel low-complexity informed embedding algorithms based on a modified trellis structure for a digital watermarking system. These algorithms can embed adaptive robust watermarked bits according to various lengths of linear block codes in a host image of 512 x 512 pixels in size. Instead of using randomly generated reference vectors as arc labels, this algorithm uses the codewords of a linear block code to label the arcs in the trellis structure. The use of linear block code as arc offers two advantages as follows: first, to provide a satisfactory space partition for each trellis section; second, to perform embedding algorithm featuring linear block codes for each trellis section. Moreover, the algorithm proposed algorithm can perform iteration to find a tradeoff between robustness and fidelity by using a number of controllable parameters. Finally, the experimental results demonstrate three objectives as follows: first, to simulate the effect of controllable parameter on the proposed watermarking scheme; second, to report the robustness and fidelity performance of this algorithm in various attack channels, such as Gaussian noise, scaling, low pass filter, and JPEG compression; and third, to simulate computation complexity and the proposed trellis-based informed embedding, which requires less operation complexity compared with Miller's informed embedding method. © ICIC International 2012. (24 refs)
    Relation: International Journal of Innovative Computing, Information and Control
    Appears in Collections:[Department of Computer Science and Information Engineering] 【資訊工程系所】期刊論文

    Files in This Item:

    There are no files associated with this item.



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


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