English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105277 (86%)
Visitors : 8143494      Online Users : 1308
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/87218


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


    Title: Lossless and Unlimited Multi-image Sharing Based on Chinese Remainder Theorem and Lagrange Interpolation
    Authors: 張真誠;CHang, Chin-Chen;*;Ngoc-TuHuynh;Ngoc-TuHuynh;Hai-DuongLe;Hai-DuongLe
    Contributors: 資訊工程學系
    Keywords: Multi-image sharing;Chinese remainder theorem;Lagrange interpolation;Losslesss
    Date: 2014-06
    Issue Date: 2014-12-30 11:38:23 (UTC+8)
    Abstract: This study proposes a novel multi-image threshold sharing scheme based on Chinese remainder theorem and Lagrange interpolation. The exceptional property of the scheme is its ability to retrieve any secret image without recovering all the other images. Therefore, it works efficiently and reduces computation cost in case it needs to recover only one image from shares. In term of capacity, the scheme has no limitation on number of input secret images, output shares and the recovery threshold. Another advantage of the scheme is that it can be used for many image formats whether it is binary or grayscale or color. Moreover, the scheme can recover the secret images without any distortion.
    Relation: SIGNAL PROCESSING;99:159–170
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

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