English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105278 (86%)
Visitors : 8908151      Online Users : 601
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/6453

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

    Title: A Novel Image Hiding Scheme Based on VQ and Hamming Distance
    Authors: Chang, C. C.;Tai, W. L.;Lin, C. C.
    Keywords: Data hiding;vector quantization (VQ);hamming distance
    Date: 2007-07
    Issue Date: 2009-12-17 14:58:03 (UTC+8)
    Publisher: Asia University
    Abstract: Data hiding is popularly employed in protecting the copyright, secret information and communication secretly with the convenience of network communication. In order to reduce the amount the transmitted data via network, VQ (vector quantization) is applied to compressing the transmitted data. Since VQ is a low-bit-rate compression scheme, it is difficult to find large redundant hiding space and to get stego-images with high quality for hiding data in VQ-based compressed images. A hiding method for VQ-based compressed images is proposed in this paper according to the Hamming distance between the index values of codewords. Our method makes hiding data more effective and provides stego-images with higher quality than other conventional methods. Experimental results demonstrate the effectiveness and the feasibility of our method.
    Relation: Fundamenta Informaticae 77(3): 217-228
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    310904400-6453.doc62KbMicrosoft Word225View/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