.png){kind=icon}
返回
On minimum cross-entropy thresholding
.png){kind=icon}
PRE
AI
DOI：10.1016/0031-3203(95)00111-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Over last few years several papers have been written on entropy-based thresholding. Some of these methods use the gray-level histogram, while others use entropy associated with the two-dimensional histogram or the co-occurrence matrix. Recently, Li and Lee proposed a thresholding scheme that is aimed to minimize the cross entropy. This note first points out a certain conceptual problem and then proposes two algorithms which are free from that problem. The proposed schemes are tested on several data sets. The results are encouraging.
Keyword:
information
cross entropy
thresholding
segmentation
object extraction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容