一种改进的均值金字塔快速搜索算法

针对传统均值金字塔搜索算法存在起始点不定,搜索范围缺乏约束的问题,提出一种改进的快速搜索算法,可以在搜索的起始阶段就从接近最佳匹配码字开始,同时对搜索范围加以限定.该方法利用了金子塔结构内部的不等式关系,并将码字排列成二叉树的结构,在付出一定额外存储空间的代价下,避免了大量的无用搜索.实验结果表明,在同等精度的条件下,该方法的搜索效率要高于传统的均值金字塔搜索算法.

An Improved Mean Pyramid Fast Search Algorithm

Aimed at solving the problem which consisting in conventional mean pyramid structure search algorithm that we are not sure from which point to start and we don't have restrictions to narrow the search range,this paper presents an improved fast search algorithm,which can start the search from the point that near the closest codeword and narrow the search range.This algorithm makes use of the indwelling inequation in pyramid structure and arranges codewords according to bintree structure.We avoid many useless search at the expense of additional storage space.Experiment result shows that the proposed algorithm has a higher efficiency over conventional mean pyramid search algorithm at the same accuracy level.