ASIA unversity:Item 310904400/4402
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90429/105609 (86%)
Visitors : 10283540      Online Users : 72
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:

    Title: Visual cryptography for gray-level images by dithering techniques
    Authors: C. C. Lin;W. H. Tsai
    Contributors: Department of Information Communication
    Keywords: Visual cryptography;Secret sharing;Watermarking;Dithering
    Date: 2003-01
    Issue Date: 2009-11-25 10:31:13 (UTC+8)
    Publisher: Asia University
    Abstract: A (k,n)-threshold visual cryptography scheme is proposed to encode a secret image into n shadow images, where any k or more of them can visually recover the secret image, but any k−1 or fewer of them gain no information about it. The decoding process of a visual cryptography scheme, which differs from traditional secret sharing, does not need complicated cryptographic mechanisms and computations. Instead, it can be decoded directly by the human visual system. Previous efforts in this topic are almost restricted in processing binary images, which are insufficient for many applications. In this paper, a new visual cryptography scheme suitable for gray-level images is proposed. Instead of using gray subpixels directly to construct shares, a dithering technique is used first to convert a gray-level image into an approximate binary image. Then existing visual cryptography schemes for binary images are applied to accomplish the work of creating shares. The overall effect of the proposed method is the achievement of visual encryption and decryption functions for gray-level images. Some comparisons with a previously proposed method are also made. Some experimental results are shown to prove the feasibility of the proposed method. Finally, an application is mentioned to show its practicability.
    Relation: Pattern Recognition Letters 24 (1-3): 349-358
    Appears in Collections:[Department of Information Communication] Journal Article

    Files in This Item:

    File Description SizeFormat
    310904400-4402.doc33KbMicrosoft Word344View/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