利用无向邻接图计算二值图像的Euler数

COMPUTING THE EULER NUMBER OF BINARY IMAGE BY UNDIRECTED ADJACENT GRAPH

本文利用无向邻接图描述线性四分树表示二值图像的四分形邻接关系,将邻接关系用变型的邻接矩阵表示.在此基础上,提出了一种计算二值图像Euler数的方法,该方法的空间复杂性和时间复杂性都优于已有的方法.

This paper uses an undirected adjacent graph to describe the adjacency relations of binary image represented by linear quadtrees, and a reformed adjacent matrix is used to represent the adjacent graph. Based on this, an approach of computing the Euler number is presented. The space complexity and time complexity of this method are better than those of other existing ones.