English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49287/83828 (59%)
Visitors : 7147374      Online Users : 77
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: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/90313


    Title: Block-based progressive visual secret sharing
    Authors: Hou, Young-Chang;Quan, Zen-Yu;Tsai, Chih-Fong;Tseng, A-Yu
    Contributors: 淡江大學資訊管理學系
    Keywords: Visual secret sharing;Progressive visual secret sharing;Secret block;Steganography
    Date: 2013-06
    Issue Date: 2013-06-11 14:20:12 (UTC+8)
    Publisher: Philadelphia: Elsevier Inc.
    Abstract: Block-based progressive visual secret sharing (BPVSS) is an encryption technique that utilizes the human visual system to recover a secret image. The recovery method is based on building up different image blocks step by step. In the last few years, several research projects have been devoted to the study of BPVSS. However, they have some common drawbacks. Their dispatching matrices are chaotically designed by adding some redundant 0/1s in order to maintain the size as a fixed value, which makes the methods hard to be implemented. In addition, the pixel expansion ratio grows faster when the number of participants increases and the visual quality of the restored image is quite poor. In this paper, we propose a non-expanded block-based progressive visual secret sharing scheme with noise-like and meaningful shares. Experimental results demonstrate the feasibility of this scheme. Our design has several advantages over other related methods: (1) the model is concise, easy to implement, and the number of participants need not be restricted; (2) with noise-like shares, the contrast of the restored image is 50%, which means that the hidden message can be clearly recognized by the naked eye; (3) when transparencies are transferred from noise-like patterns into a meaningful cover image, the contrast in the shares and the restored image is 25%, which is still superior to that obtained in other studies; (4) our scheme is more suitable for grayscale and color secret images; (5) the size of the transparencies is the same as that of the secret image.
    Relation: Information Sciences 233(1), pp.290–304
    DOI: 10.1016/j.ins.2013.01.006
    Appears in Collections:[資訊管理學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML192View/Open
    index.html0KbHTML109View/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