Skip to Main Content
In a (k, n) visual secret sharing (VSS) scheme, the alignment of the transparencies is important to the visual quality of the reconstructed secret image. Each pixel of the original secret image is expanded to m subpixels in a share image. If a share image is printed on a paper with the same size as the original secret image, the alignment or the registration of the subpixels, which is only m times smaller than that of the original secret image, could be troublesome. In this paper, we propose a (2, n)-VSS scheme that allows a relative shift between the shares in the horizontal direction and vertical direction. When the shares are perfectly aligned, the contrast of the reconstructed image is equal to that of the traditional VSS scheme. When there is a shift, the average contrast of the reconstructed image is higher than that of the traditional VSS scheme, and the scheme can still work in cases where very little shape redundancy is present in the image. The trade-off is that our method involves a larger pixel expansion. The basic building block of our scheme is duplication and concatenation of certain rows or columns of the basic matrices. This seemingly simple but very powerful construction principle can be easily used to create more general (k, n) schemes.
Information Forensics and Security, IEEE Transactions on (Volume:6 , Issue: 2 )
Date of Publication: June 2011