节点文献
图像欧拉数计算复杂度分析
Analysis of Computation Complexity on Euler Number of a Binary Image
【摘要】 文中用基于图段的方法计算欧拉数,并对该算法的时空复杂度进行分析比较.由于图段方法只要求较少的像素访问次数,从而节省运算时间,因此图段方法比现有的基于四方格或基于四叉树的方法更有效.这种分析还对图像欧拉数计算的VLSI硬件实现具有指导意义.
【Abstract】 In this paper,an approach to compute Euler number based on foreground run is formulated.The time/space complexity of the algorithm is analyzed.The proposed algorithm requires fewer number of pixel accesses compared to the existing methods based on bit-quad or quad-tree,for the average case and the worst case.It can be used to save computation time in many applications.
【关键词】 欧拉数;
机器视觉;
数字拓扑学;
计算复杂度;
图段;
【Key words】 Euler number; machine vision; digital topology; computation complexity; foreground run;
【Key words】 Euler number; machine vision; digital topology; computation complexity; foreground run;
【基金】 国家自然科学基金项目(60772168)
- 【文献出处】 微电子学与计算机 ,Microelectronics & Computer , 编辑部邮箱 ,2008年07期
- 【分类号】TP391.41
- 【被引频次】8
- 【下载频次】209