线性四叉树描述的二值图像八邻域内邻居寻找算法  

8-neighborhood finding algorithm for binary image represented by linear quadtrees

作　　者：刘钢钦[1] 邱建雄[1] 杨瑞元[1] 

机构地区：[1]长沙大学计算机科学与技术系,湖南长沙410003

出　　处：《电脑与信息技术》2004年第4期31-34,59,共5页Computer and Information Technology

摘　　要：通过研究线性四叉树描述的二值图像位置码属性 ,提出了图像块八邻域内相邻的判别条件 ,在此基础上给出了相应的图像块八邻域内邻居寻找算法。该算法利用四分块子图像之间的位置 ,通过对图像块的位置码码元进行比较寻找图像块的邻居 ,因此计算量较少 ,便于计算机实现。By studying the code of each image block of binary image represented by linear quadtrees, The neighboring conditions of binary image were proposed. Based on these ,a 8-neighborhood finding algorithm is developed. This approach method finding 8-neighborhoods by comparing the orientation code of two image blocks. And it is simple and easy for implementation.

关 键 词：线性四叉树 图像分析 邻域查找 计算机图形学 二值图像 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]