English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21710460      Online Users : 368
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/7400


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


    Title: An Efficient Probability-based t out of n Secret Image Sharing Scheme
    Authors: Chang, C. C.;Wang, Y. Z.;Chan, C. S.
    Date: 2008-12
    Issue Date: 2010-01-29 06:39:16 (UTC+0)
    Publisher: Asia University
    Abstract: Noar and Shamir presented the concept of visual cryptography. Many researches following it go down the same track: to expand the secret pixels to blocks. As a result, the size of the secret image becomes larger, and the quality of the expanded secret image becomes worse. In order to prevent the pixels from expanding, Yang has proposed his probability-based visual secret sharing scheme, where the concept of probability is employed to pick out pixels from the black or white sets. In this paper, we shall propose a new scheme that is a modified version of Yangpsilas scheme. Our experimental results show that we can obtain better recovered image quality with high contrast.
    Relation: The 2008 International Symposium on Signal Processing, Image Processing and Pattern Recognition (SIP 2008) , 2008-12. Hainan Island, China.
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML257View/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