A (k,n) secret image sharing approach shares a protected image to n shared images and
gathering k shared images can reconstruct the original image. This paper solves the secret
image sharing problem by a geometry secret sharing strategy named the Blakley scheme. We
first partition the protected image into non-overlapping sets of k pixels. Every k pixels forms a
point under a k-dimensional space and the set solution to each generated affine hyperplane
intersecting in this point stores as one shared image. Gathering k shared images can calculate
the reconstructed image that is consistent with the protected image. We also present an
efficient hyperplanes selection strategy. The experimental results demonstrate that the
proposed approach is a simple but efficient secret image sharing approach.
Relation:
Journal of Information Science and Engineering 24(5), pp.1567-1577
