|
English
|
正體中文
|
简体中文
|
Items with full text/Total items : 94286/110023 (86%)
Visitors : 21710068
Online Users : 471
|
|
|
Loading...
|
Please use this identifier to cite or link to this item:
http://asiair.asia.edu.tw/ir/handle/310904400/88380
|
Title: | A Lossy Secret Color Image Sharing Scheme with Small Shadows and Error-resilient Capability |
Authors: | Liu, Li;Liu, Li;Wang, An-Hong;Wang, An-Hong;張真誠;CHang, Chin-Chen;Li, *、Zhi-Hong;Li, Zhi-Hong;Liu, Jin-bo;Liu, Jin-bo |
Contributors: | 資訊工程學系 |
Keywords: | Journal of Information Hiding and Multimedia Signal Processing Compressive sensing, Secret sharing, (k, n)-threshold scheme, Shadow image,
Error-resilient capability |
Date: | 2015-03 |
Issue Date: | 2015-03-25 07:44:16 (UTC+0) |
Abstract: | A novel secret sharing scheme for color images with small shadows and
error-resilient capability was proposed that combines compressive sensing and Shamir’s
(k, n)-threshold scheme. Since the human eye is more sensitive to the luminance of an
image than its chromaticity, first, this scheme converts RGB images into YUV format
and compresses the components of luminance and chrominance using a different measurement
rate. Then, the measurement values are quantified and encoded as polynomial
coefficients in Shamir sharing to get n shadow images. At the receiver side, the secret
image can be reconstructed if any k of n shadows are offered, while less than k shadows
reveal no information. The simulation results showed that the scheme had a small
shadow size and also achieved good error-resilient capability. Even though the shadow
images may be affected by noise or a hostile attack in the transmission process resulting
in some distortion, the managers still are able to reconstruct the original secret image.
Therefore, this scheme provides advantages over others in the actual transmission environment. |
Relation: | 張真誠 |
Appears in Collections: | [資訊工程學系] 期刊論文
|
Files in This Item:
File |
Size | Format | |
index.html | 0Kb | HTML | 512 | View/Open |
|
All items in ASIAIR are protected by copyright, with all rights reserved.
|