2011
DOI: 10.1016/j.eswa.2011.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Optimal multilevel thresholding using bacterial foraging algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
40
0
2

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 165 publications
(43 citation statements)
references
References 15 publications
0
40
0
2
Order By: Relevance
“…In general, optimal thresholding methods are simple and effective in bi-level thresholding [7]. However, they are; including Otsu's unsupervised method; inefficient in determining the optimal thresholds due to the exponential growth in computation time in when dealing with multilevel thresholding problems [7].…”
Section: Introductionmentioning
confidence: 99%
“…In general, optimal thresholding methods are simple and effective in bi-level thresholding [7]. However, they are; including Otsu's unsupervised method; inefficient in determining the optimal thresholds due to the exponential growth in computation time in when dealing with multilevel thresholding problems [7].…”
Section: Introductionmentioning
confidence: 99%
“…The second is proposed by Otsu et al [13] and maximizes the between-class variance. Although the two methods have proved to be highly efficient for bi-level thresholding, the computational complexity for MT increases with each new threshold [16].…”
Section: Related Workmentioning
confidence: 99%
“…The second submitted by Kapur in [6] uses the maximization of the entropy to measure the homogeneity of the classes. Their efficiency and accuracy have been already proved for a bi-level segmentation [9]. Although both Otsu's and Kapur's can be expanded for multilevel thresholding, their computational complexity increases exponentially with each new threshold [9].…”
Section: Introductionmentioning
confidence: 99%