A Probabilistic Visual Secret Sharing Scheme for Grayscale Images with Voting Strategy

In 2007, Wang et al. proposed two visual secret sharing schemes based on Boolean operations. One is a probabilistic (2, n) secret sharing (SS) scheme, called (2, n) ProbVSS scheme, for binary images and the other is a deterministic (n, n) SS scheme for grayscale images. Their schemes can solve the problems of computational complexity and pixel expansion at the same time. To provide a (2, n) ProbVSS scheme that demonstrates better reconstructed grayscale image quality than Wang et al. ´s scheme without significantly increasing computational complexity, we apply the voting strategy and the least significant bits abandoning approach in combination with the first scheme of Wang et al. ´s to handle grayscale images. Experimental results confirm that the reconstructed grayscale image quality in this proposed scheme is better than that achieved by using the pure Wang et al.´s scheme.