Abstract

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 (RL) 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.