As the electronic industry advances rapidly toward automatic manufacturing smaller, faster, and cheaper products, computer vision play more important role in IC packaging technology than before. One of the important tasks of computer vision is finding target position through similarity matching. Similarity matching requires distance computation of feature vectors for each target image. In this paper we propose a projection transform of wavelet coefficient based multi resolution data-structure algorithm for faster template matching, a position sequence of local sharp variation points in such signals is recorded as features. The proposed approach reduces the number of computation by around 70% over multi resolution data structure algorithm. We use the proposed approach to match similarity between wavelet parameters histograms for image matching. It is noticeable that the proposed fast algorithm provides not only the same retrieval results as the exhaustive search, but also a faster searching ability than existing fast algorithms. The proposed approach can be easily combined with existing algorithms for further performance enhancement.