1999
DOI: 10.1016/s0031-3203(97)00158-1
|View full text |Cite
|
Sign up to set email alerts
|

A fast recurring two-dimensional entropic thresholding algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
36
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(36 citation statements)
references
References 0 publications
0
36
0
Order By: Relevance
“…All experiments were done under VC++6.0 and on a P4-1.7 GHz PC with 512 MB RAM. 2-D entropy crossover method based on a fast algorithm [25] was used to get the optimal threshold point and 3×3 mean filter was used as the second feature in our experiment. T 1 = 0.08 and T 2 = 0.5 were preset according to lots of image segmentation experiments.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…All experiments were done under VC++6.0 and on a P4-1.7 GHz PC with 512 MB RAM. 2-D entropy crossover method based on a fast algorithm [25] was used to get the optimal threshold point and 3×3 mean filter was used as the second feature in our experiment. T 1 = 0.08 and T 2 = 0.5 were preset according to lots of image segmentation experiments.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…Introducing some other image information could improve the segmentation results. Thus, two-dimension (2-D) thresholding methods that consider two kinds of image information simultaneously have been proposed [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25].…”
Section: Introductionmentioning
confidence: 99%
“…Segmentation results of the proposed algorithm are compared with the threshold surface method, Huang's method and two-dimensional (2D) entropic thresholding [5,10,17]. The threshold surface method by Yanowitz is efficient for a nonuniform illuminated image [10].…”
Section: Results Of Target Segmentationmentioning
confidence: 99%
“…This technique selects an optimum threshold value that maximizes the a posteriori entropy H 0 of the gray level histogram. In order to improve the segmentation performance of Pun's method, Ahmed and Wu introduced two-dimensional entropy thresholding using the gray level histogram and a histogram of the spatial average level in a given image [4,5]. Brink and Pendock [7] presented a thresholding scheme that minimizes the crossentropy distance which is a more general measure of discrepancy.…”
Section: Introductionmentioning
confidence: 99%
“…Consequently, the time needed for fuzzy entropy methods is an obstacle for realtime targets. A 2D entropy thresholding algorithm that used the 2-D entropies based on the 2-D-gray level and local average gray levelhistogram to segment images was presented by Wu et al (1999), Sahoo et al (2004), Feng et al (2004, and Jansing et al (1999).…”
Section: Introductionmentioning
confidence: 99%