插值二分树描述的二值图象邻域寻找的搜索算法

Neighbor Finding Algorithm for Binary Image Represented by Interpolation Based Bintrees

通过分析插值二分树编码方法，归纳出了图象的插值二分码的若干性质，在此基础上提出了图象二分块相邻的充要条件，并给出了相应的寻找图象块邻域的算法。该算法仅对图象二分块的坐标进行简单运算及判别。

By analysing the coding method of interpolation based bintree,several properties of bintree are derived.Based on this,the conditions of adjacency for two image regions are presented and the neighbor finding algorithm is developed.This algorithm operates only on the coordinates of image blocks and is easy for implementation.