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

Neighbor Finding Algorithm for Binary Image Represented by Interpolation Based Bintrees

作　　者：刘钢钦[1,2] 晏明辉[1,2] 

机构地区：[1]长沙市公安局 [2]国防科技大学计算机系

出　　处：《计算机工程与科学》1997年第4期33-37,共5页Computer Engineering & Science

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

关 键 词：二分树 邻域寻找 图象压缩 图象编码 搜索算法 

分 类 号：TN919.8[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]