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.