SECRET IMAGE SHARING: A BOOLEAN-OPERATIONS-BASED APPROACH COMBINING BENEFITS OF POLYNOMIAL-BASED AND FAST APPROACHES

檔案

日期

2009-03-01

類型

期刊名稱

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE

卷期與頁次

第 23 卷第 2 期,頁 263–285

ISSN

0218-0014

語言

英文

摘要

In secret image sharing, a polynomial interpolation technique heavy experiences a computation load when the secret image is retrieved later. To the contrary, fast approaches often need larger storage space due to pixel expansion property. This paper proposes a missing-allowable (k, n) scheme which is fast and with a reasonable pixel expansion rate (per). The scheme generates n extremely-noisy shadow images for the given secret color image A, and any k out of these n shadows can recover A loss-freely. In average, to decode a color pixel of A, the retrieval uses only three exclusion-OR operations among 24-bit numbers. Hence, the new method has very fast decoding speed, and its pixel expansion rate is always acceptable (0 < per < 2).

所屬典藏

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

引用此條目

Chao, K.-Y., & Lin, J.-C. (2009). SECRET IMAGE SHARING: A BOOLEAN-OPERATIONS-BASED APPROACH COMBINING BENEFITS OF POLYNOMIAL-BASED AND FAST APPROACHES. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 23(2), 263–285. https://doi.org/10.1142/S0218001409007090

BibTeX RIS

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

分享

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