A novel bit-quad-based Euler number computing algorithm.
A novel bit-quad-based Euler number computing algorithm.
复制标题
一种新颖的基于位四元的欧拉数计算算法
DOI：
10.1186/s40064-015-1511-8
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Zhao X
中科院分区：
文献类型：
--
作者：
Yao B;He L;Kang S;Chao Y;Zhao X
二值图像的欧拉数是计算机视觉和模式识别中的一个重要拓扑性质。提出了一种新的基于位四元组的欧拉数计算算法。该算法基于图论和对比特四元组模式的分析，只需要计算两个比特四元组模式。此外，通过使用在处理前一位四元组期间获得的信息，处理位四元组要检查的像素的平均数量仅为1.75。实验结果表明，该方法的性能明显优于传统的欧拉数计算算法。
The Euler number of a binary image is an important topological property in computer vision and pattern recognition. This paper proposes a novel bit-quad-based Euler number computing algorithm. Based on graph theory and analysis on bit-quad patterns, our algorithm only needs to count two bit-quad patterns. Moreover, by use of the information obtained during processing the previous bit-quad, the average number of pixels to be checked for processing a bit-quad is only 1.75. Experimental results demonstrated that our method outperforms significantly conventional Euler number computing algorithms.