完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chao, Kun-Yuan | en_US |
dc.contributor.author | Lin, Ja-Chen | en_US |
dc.date.accessioned | 2014-12-08T15:09:54Z | - |
dc.date.available | 2014-12-08T15:09:54Z | - |
dc.date.issued | 2009-03-01 | en_US |
dc.identifier.issn | 0218-0014 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1142/S0218001409007090 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/7563 | - |
dc.description.abstract | 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). | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Polynomial-style sharing | en_US |
dc.subject | fast schemes | en_US |
dc.subject | computation complexity | en_US |
dc.subject | pixel expansion rate | en_US |
dc.subject | exclusive-OR | en_US |
dc.title | SECRET IMAGE SHARING: A BOOLEAN-OPERATIONS-BASED APPROACH COMBINING BENEFITS OF POLYNOMIAL-BASED AND FAST APPROACHES | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1142/S0218001409007090 | en_US |
dc.identifier.journal | INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE | en_US |
dc.citation.volume | 23 | en_US |
dc.citation.issue | 2 | en_US |
dc.citation.spage | 263 | en_US |
dc.citation.epage | 285 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000265094700005 | - |
dc.citation.woscount | 8 | - |
顯示於類別: | 期刊論文 |