A (k, n) secret image sharing method shares a protected image in n shared images and the protected image can be reconstructed by k shared images. This study solves the secret image sharing problem by a geometry secret sharing strategy named the Blakley scheme. The protected image is first partitioned into non-overlapping sets of k pixels. Each set of k pixels forms a point under a k-dimensional space and the set solution to each generated affine hyperplane, only intersecting at this point stores to the corresponding shared image. The reconstructed image, consistent with the protected image, is obtained from k shared images. Additionally, an efficient hyperplanes selection strategy is presented. Experimental results indicate that the proposed approach is efficient for secretly sharing a digital image.