论文部分内容阅读
为了减小可视分存方案中的像素膨胀m以及提高重构秘密图像的质量(使用相对差α衡量,0≤α≤1),基于反色可视分存方案和概率模型的可视分存方案构造出了(k,n)-反色概率可视分存方案。该方案采用(k,n)-概率可视分存方案得到没有像素膨胀的分存图,对每幅分存图通过反色可视分存方案进行处理后分发给每个参与者c幅分存图(c为正整数)。采用反色运算和OR运算可以重构原始密图,证明可得其相对差为1-(1-α)c,随着c的增大,重构密图的质量不断提高。该方案的像素膨胀是反色可视分存方案的像素膨胀的1/m;当c为1时,该方案是已有的概率可视分存方案。
In order to reduce the pixel expansion m in the visual sharing scheme and to improve the quality of the reconstructed secret image (measured as relative difference α, 0 ≦ α ≦ 1), the visual sub-scheme based on the inverse color shading scheme and the probability model The proposed scheme constructs the (k, n) - inverse color probability visual dispatch scheme. The scheme uses (k, n) - Probabilistic visual sharing scheme to get the pixel-free image. Each image is processed by anti-color visualization scheme and distributed to each player. Deposit (c is a positive integer). The original secret map can be reconstructed by the inverse color operation and the OR operation. It is proved that the relative difference is 1- (1-α) c. As the c increases, the quality of the reconstructed dense map increases. The pixel expansion of the scheme is 1 / m of the pixel expansion of the anti-color visual sharing scheme; when c is 1, the scheme is the existing visual probability sharing scheme.