This paper solves the visual cryptography problem by the Blakley scheme that is a geometry-based secret sharing strategy. 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. The experimental results demonstrate that the proposed approach is a simple but efficient secret image sharing approach.