摘要
本文提出线性四元树表示的二值图象的邻接寻找算法,利用该算法的执行结果可以定义一个线性四元树对应的有向邻接图,通过其对应的邻接矩阵的简单运算,能够用代数方法计算图象的Euler数。
Neighbor finding algorithms for binary image represented by linear quadtrees-are described. With the results of the algorithms, the adjacency digraph corresponding to a linear quadtree can be defined. With simple operation on the corresponding adjacency mat-rix, computation of the Euler number of the image is algebraically implemented.
出处
《计算机学报》
EI
CSCD
北大核心
1989年第9期682-688,共7页
Chinese Journal of Computers
