摘要
提出了一种可压缩的(r,n)门限秘密图像共享方案,Shamir的门限方案是该方案的基础,它可以克服VSS方案的缺点,并能把影子图像压缩成原秘密图像大小的1/r;当所有像素灰度值小于250时,恢复图像和原秘密图像一样。随后对该方案进行改进,使其在有像素灰度值大于250的情况下,可获得无质量损失的恢复图像。
A compressible（r,n） threshold secret image sharing scheme is proposed which can overcome the shortcomings of VSS（Visual secret sharing） scheme,based on Shamir＇s threshold secret scheme.The size of each shadow image is 1/r times of the secret image.The restore image is the same as the secret one when the value of all pixels is smaller than 250.Then the authors improved it and obtained a lossless secret image shring scheme when the pixels＇ value is bigger than 250.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第33期43-45,共3页
Computer Engineering and Applications
