首页> 外文会议>International Conference on Future Generation Communication and Networking Symposia >An Efficient Probability-Based t out of n Secret Image Sharing Scheme
【24h】

An Efficient Probability-Based t out of n Secret Image Sharing Scheme

机译:基于概率的基于概要的T出N秘密图像共享方案

获取原文

摘要

Noar and Shamir presented the concept of visual cryptography.  Many researches following it go down the same track: to expand the secret pixels to blocks. As a result, the size of the secret image becomes larger, and the quality of the expanded secret image becomes worse. In order to prevent the pixels from expanding, Yang has proposed his probability-based visual secret sharing scheme, where the concept of probability is employed to pick out pixels from the black or white sets. In this paper, we shall propose a new scheme that is a modified version of Yang’s scheme. Our experimental results show that we can obtain better recovered image quality with high contrast.
机译:noar和shamir呈现了视觉密码学的概念。在它下面的许多研究下降了相同的轨道:扩展秘密像素以阻止。结果,秘密图像的大小变大,并且扩展秘密图像的质量变得更糟。为了防止像素扩展,杨已经提出了他基于概率的视觉秘密共享方案,其中采用概率的概念来挑出来自黑色或白色集的像素。在本文中,我们将提出一个新的计划,即杨计划的修改版本。我们的实验结果表明,我们可以以高对比度获得更好的恢复图像质量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号