Traditional image matching algorithm has the advantage of high matching precision, but large computation increase the matching time.
已有的图像匹配算法虽然具有匹配精度高的优点,但由于计算量大,匹配时间较长。
We focus on the reducing search time of block matching procedure by replacing full search matching with matching in the neighbourhood and matching based on classification of image block.
此文改全局匹配为邻域匹配和分类匹配,从二条途径探讨了缩短匹配时间的方法。
To shorten the matching time, the four level fractal approximation coding based on matching in neighborhood is presented.
为了缩短分形编码中值域块与定义域块池中的定义域块逐一匹配时间,提出了四级邻域匹配分形近似编码。
应用推荐