摘要
依据多幅秘密图像的像素组合与基矩阵之间的映射关系,该文分析了目前存取式多秘密视觉密码存在的冗余基矩阵问题,提出了一种减小基矩阵规模的压缩算法。该算法以一列像素为处理单元,且满足秘密图像的整体对比性。在此基础上,设计了新的存取式多秘密视觉密码的秘密分享与恢复流程。与现有的方案相比,该方案能够有效减小共享份的尺寸,且对于简单图像的压缩效果更加明显。
According to the mapping relationship between the multiple secret images’ pixel combinations and the basis matrices,the redundant basis matrices are analyzed in the access-based multi-secret visual cryptography.A compression algorithm is proposed to decrease the size of basis matrices.The algorithm takes one column pixels as disposal unit,and satisfies the entire contrast of secret images.Based on the algorithm,new secret sharing and recovering procedures are designed for the access-based multi-secret visual cryptography.Compared with previous schemes,the present scheme can diminish the size of shares effectively,and the compression effects are obvious for the simple images.
出处
《电子与信息学报》
EI
CSCD
北大核心
2013年第5期1055-1062,共8页
Journal of Electronics & Information Technology
基金
国家自然科学基金(61070086)资助课题
关键词
视觉密码
多秘密
存取式
冗余基矩阵
压缩算法
Visual cryptography
Multiple secrets
Access-based
Redundant basis matrices
Compression algorithm
