A novel fast template matching algorithm for incomplete target searching based on block statistics was presented. This algorithm divided the template and the candidate image into several blocks with the same size. Absolute distance was used to calculate the pixel matching degree between the corresponding pixels. Then, the block matching degree and the target matching degree were proposed by statistical method. In order to speed up the searching process, the pyramid of the multi-level images was built. Experimental results demonstrate that the proposed algorithm performs well on locating both the complete targets and non-complete ones. The execution time is limited to several milliseconds and the algorithm has strong noise immunity.