.png){kind=icon}
Return
On minimum cross-entropy thresholding
.png){kind=icon}
PRE
AI
DOI：10.1016/0031-3203(95)00111-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
information
cross entropy
thresholding
segmentation
object extraction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more