.png){kind=icon}
返回
Fast recursive algorithms for two-dimensional thresholding
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(97)00043-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Two-Dimensional (2D) thresholding behaves well in segmenting images of low siginal-to-noise ratio. But the computation complexity of the conventional 2D entropic algorithm is bounded by O(L-4). In this paper, firstly, a fast recursive 2D entropic thresholding algorithm is proposed. By rewriting the formula for calculation of entropy in recurrence form, a lengthy calculation is saved. Analysis shows that the computation complexity of 2D entropic thresholding is reduced to O(L-2). The fast recursive algorithm is also used successfully in 2D Otsu thresholding method. Experimental results show that the processing time of each image is reduced from more than 2 h to less than 10 s. The required memory space is also greatly reduced. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.
Keyword:
image
segmentation
thresholding
recursive algorithm
entropy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Electrocatalysis at graphite and carbon nanotube modified electrodes: edge-plane sites and tube ends are the reactive sites石墨和碳纳米管修饰电极上的电催化: 边缘平面位和管端是反应位点
PREAI
分享收藏 没有更多内容
没有更多内容