.png){kind=icon}
返回
Maximum entropy-based optimal threshold selection using deterministic reinforcement learning with controlled randomization
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(02)00203-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Traditional maximum entropy-based thresholding methods are very popular and efficient in the case of bilevel thresholding. But they are very computationally expensive when extended to multilevel thresholding since the inevitable exhaustive search of optimal thresholds needed to maximize the posterior entropy. In this paper, a reinforcement learning (R-L) approach is proposed for the maximum entropy thresholding. We show that finding the optimal thresholds using the maximum entropy criterion is equivalent to learning an optimal policy of the RL problem. Therefore, the powerful Q-learning algorithm. which is widely used in RL, can be employed to eradicate the computation burden of the maximum entropy-based thresholding methods. The experimental results show that the proposed method is suitable in the case of multilevel thresholding and the performance is better than that of the genetic algorithm-based entropy thresholding method. (C) 2002 Published by Elsevier Science B.V.
Keyword:
genetic algorithms
image segmentation
maximum entropy criterion
multilevel thresholding
Q-learning algorithm
reinforcement learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
.png){kind=icon}
查看更多内容