Sharing of multiple images: economically sized and fast-decoding approach based on modulus and Boolean operations

檔案

日期

2010-04-01

類型

期刊名稱

OPTICAL ENGINEERING

卷期與頁次

第 49 卷第 4 期

ISSN

0091-3286

語言

英文

摘要

Secret image sharing is a popular technology to secure digital images in storage and transmission. Traditionally, the technology transforms one secret image into several images called shadows or shares. Later, when the number of collected shadows reaches a specified threshold value, the decomposed image can be reconstructed. We propose a new sharing approach to transform n secret images into n shadows. Later, after gathering all the n shadows, all the n secret images can be retrieved error-free. No information in any secret image is revealed if one shadow is absent. The total size of n generated shadows is identical to the total size of n input secret images; hence, this approach does not waste storage space. Each pixel in each secret image is reconstructed using only one Boolean, one modulus, and two mathematical operations, so it is also a fast approach for reconstructing many secret images. Comparisons are included. (C) 2010 Society of Photo-Optical Instrumentation Engineers. [DOI: 10.1117/1.3407067]

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chao, K.-Y., & Lin, J.-C. (2010). Sharing of multiple images: economically sized and fast-decoding approach based on modulus and Boolean operations. OPTICAL ENGINEERING, 49(4). https://doi.org/10.1117/1.3407067

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/5555