.png){kind=icon}
返回
A new run-based algorithm for Euler number computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-015-0464-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Euler number of a binary image is an important topological feature for many image processing, image analysis, pattern recognition, and computer vision applications. This paper proposes a new run-based Euler number computation algorithm. The conventional run-based algorithm processes rows of the given image one-by-one from top to bottom in a single phase. For each row, it finds the runs in the row and records the start and end locations of each run to compute neighbor runs. In contrast, our algorithm calculates the Euler number of an image in two phases. In the first phase, we process odd rows alternately to find runs and only record its end location. In the second phase, we process each of the remaining even rows to find runs and calculate neighboring runs between the current row and the rows immediately above and below using the recorded run data. Using this method, the number of accesses required to compute the Euler number decreases in almost all cases. Analysis of the time complexity and experimental results demonstrate that our algorithm outperforms conventional Euler number computation algorithms.
Keyword:
Euler number
Topological feature
Pattern recognition
Image processing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2
论文数:
1.9K
被引数:
1.9K
机构
引用论文
Melatonin concentrations in pineal organ culture are suppressed by sera from tumor‐bearing mice
.png){kind=icon}
PREAI
分享收藏分享收藏
查看更多内容