Vector quantization (VQ) is an effective lossy compression technique for data compression. One of the key problems for basic VQ method, i.e., full search algorithm, is that it is computationally intensive. Many fast encoding algorithms have been developed for this reason. Although the latest fast encoding algorithm introduced by Byung Cheol Song et al. generates better results than some other algorithms, its pyramid structure is not suitable for representing an image with multiresolution. In this paper, a reasonable half-L2-norm pyramid data structure and a new method of searching and processing codewords is provided to significantly speed up the searching process especially for high vector dimensions and codebook with large size, reduce the actual requirement for memory and produce the same encoded image quality as full search algorithm. Simulation results show that the proposed method outperforms some existing related fast encoding algorithms.